./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS --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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- 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-6b4ec56 [2022-11-20 16:16:34,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 16:16:34,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 16:16:34,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 16:16:34,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 16:16:34,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 16:16:34,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 16:16:34,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 16:16:34,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 16:16:34,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 16:16:34,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 16:16:34,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 16:16:34,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 16:16:34,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 16:16:34,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 16:16:34,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 16:16:34,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 16:16:34,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 16:16:34,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 16:16:34,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 16:16:34,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 16:16:34,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 16:16:34,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 16:16:34,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 16:16:34,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 16:16:34,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 16:16:34,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 16:16:34,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 16:16:34,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 16:16:34,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 16:16:34,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 16:16:34,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 16:16:34,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 16:16:34,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 16:16:34,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 16:16:34,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 16:16:34,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 16:16:34,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 16:16:34,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 16:16:34,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 16:16:34,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 16:16:34,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-20 16:16:34,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 16:16:34,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 16:16:34,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 16:16:34,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 16:16:34,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 16:16:34,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 16:16:34,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 16:16:34,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 16:16:34,233 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 16:16:34,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 16:16:34,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 16:16:34,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 16:16:34,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 16:16:34,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 16:16:34,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 16:16:34,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 16:16:34,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 16:16:34,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 16:16:34,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 16:16:34,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 16:16:34,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 16:16:34,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 16:16:34,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 16:16:34,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 16:16:34,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:16:34,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 16:16:34,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 16:16:34,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 16:16:34,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 16:16:34,240 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-20 16:16:34,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 16:16:34,241 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 16:16:34,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-20 16:16:34,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 16:16:34,242 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-20 16:16:34,242 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-20 16:16:34,242 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_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/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_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS 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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2022-11-20 16:16:34,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 16:16:34,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 16:16:34,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 16:16:34,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 16:16:34,565 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 16:16:34,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-20 16:16:37,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 16:16:38,049 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 16:16:38,050 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-20 16:16:38,057 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/data/5b90cafff/2a927d30c31d491cbe178eb4c610edc1/FLAG8b2c1a47c [2022-11-20 16:16:38,072 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/data/5b90cafff/2a927d30c31d491cbe178eb4c610edc1 [2022-11-20 16:16:38,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 16:16:38,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 16:16:38,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 16:16:38,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 16:16:38,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 16:16:38,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465c0917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38, skipping insertion in model container [2022-11-20 16:16:38,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 16:16:38,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 16:16:38,359 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-20 16:16:38,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:16:38,394 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 16:16:38,420 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-20 16:16:38,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:16:38,437 INFO L208 MainTranslator]: Completed translation [2022-11-20 16:16:38,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38 WrapperNode [2022-11-20 16:16:38,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 16:16:38,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 16:16:38,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 16:16:38,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 16:16:38,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,481 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-20 16:16:38,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 16:16:38,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 16:16:38,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 16:16:38,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 16:16:38,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 16:16:38,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 16:16:38,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 16:16:38,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 16:16:38,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (1/1) ... [2022-11-20 16:16:38,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:16:38,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:16:38,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 16:16:38,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 16:16:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 16:16:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 16:16:38,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 16:16:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 16:16:38,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 16:16:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 16:16:38,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 16:16:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 16:16:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 16:16:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 16:16:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 16:16:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 16:16:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 16:16:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 16:16:38,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 16:16:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 16:16:38,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 16:16:38,624 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 16:16:38,779 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 16:16:38,782 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 16:16:39,216 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 16:16:39,331 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 16:16:39,332 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 16:16:39,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:16:39 BoogieIcfgContainer [2022-11-20 16:16:39,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 16:16:39,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 16:16:39,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 16:16:39,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 16:16:39,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:16:38" (1/3) ... [2022-11-20 16:16:39,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e37f24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:16:39, skipping insertion in model container [2022-11-20 16:16:39,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:16:38" (2/3) ... [2022-11-20 16:16:39,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e37f24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:16:39, skipping insertion in model container [2022-11-20 16:16:39,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:16:39" (3/3) ... [2022-11-20 16:16:39,356 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-20 16:16:39,367 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 16:16:39,379 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 16:16:39,380 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 16:16:39,380 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 16:16:39,518 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 16:16:39,600 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:16:39,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-20 16:16:39,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:16:39,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-20 16:16:39,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-20 16:16:39,674 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-20 16:16:39,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-20 16:16:39,701 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;@29c64d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:16:39,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 16:16:40,030 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-20 16:16:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:16:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash -275952594, now seen corresponding path program 1 times [2022-11-20 16:16:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:16:40,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088943988] [2022-11-20 16:16:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:16:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:40,336 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-20 16:16:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:16:40,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088943988] [2022-11-20 16:16:40,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088943988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:16:40,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:16:40,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 16:16:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659085623] [2022-11-20 16:16:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:16:40,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 16:16:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:16:40,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 16:16:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 16:16:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:40,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:16:40,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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-20 16:16:40,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:40,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:40,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 16:16:40,445 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-20 16:16:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:16:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2072012938, now seen corresponding path program 1 times [2022-11-20 16:16:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:16:40,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639574466] [2022-11-20 16:16:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:16:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:41,302 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-20 16:16:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:16:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639574466] [2022-11-20 16:16:41,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639574466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:16:41,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:16:41,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 16:16:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699863656] [2022-11-20 16:16:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:16:41,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 16:16:41,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:16:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 16:16:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-20 16:16:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:41,308 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:16:41,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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-20 16:16:41,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:41,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:16:41,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 16:16:41,550 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-20 16:16:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:16:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash 439153583, now seen corresponding path program 1 times [2022-11-20 16:16:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:16:41,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022639532] [2022-11-20 16:16:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:16:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:41,815 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-20 16:16:41,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:16:41,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022639532] [2022-11-20 16:16:41,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022639532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:16:41,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886364853] [2022-11-20 16:16:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:41,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:16:41,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:16:41,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:16:41,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 16:16:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:42,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 16:16:42,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:16:42,349 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-20 16:16:42,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:16:42,642 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-20 16:16:42,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886364853] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 16:16:42,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 16:16:42,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-20 16:16:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387112219] [2022-11-20 16:16:42,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:16:42,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 16:16:42,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:16:42,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 16:16:42,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-20 16:16:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:42,649 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:16:42,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 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-20 16:16:42,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:42,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:16:42,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:16:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:16:42,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 16:16:43,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:16:43,086 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-20 16:16:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:16:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash 232719478, now seen corresponding path program 1 times [2022-11-20 16:16:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:16:43,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192530802] [2022-11-20 16:16:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:16:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:43,418 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-20 16:16:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:16:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192530802] [2022-11-20 16:16:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192530802] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:16:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003680376] [2022-11-20 16:16:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:43,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:16:43,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:16:43,422 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:16:43,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 16:16:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:43,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 16:16:43,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:16:43,839 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-20 16:16:43,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:16:44,121 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-20 16:16:44,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003680376] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 16:16:44,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 16:16:44,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-20 16:16:44,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312863793] [2022-11-20 16:16:44,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:16:44,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 16:16:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:16:44,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 16:16:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-20 16:16:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:44,127 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:16:44,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-20 16:16:44,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:44,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:16:44,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:16:44,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:44,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:16:44,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:16:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:16:44,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 16:16:44,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:16:44,566 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-20 16:16:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:16:44,567 INFO L85 PathProgramCache]: Analyzing trace with hash 100827375, now seen corresponding path program 1 times [2022-11-20 16:16:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:16:44,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675090131] [2022-11-20 16:16:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:44,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:16:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:46,898 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-20 16:16:46,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:16:46,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675090131] [2022-11-20 16:16:46,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675090131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:16:46,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68626445] [2022-11-20 16:16:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:16:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:16:46,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:16:46,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 16:16:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:47,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 16:16:47,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:16:48,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:16:48,411 INFO L350 Elim1Store]: Elim1 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-20 16:16:49,748 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-20 16:16:49,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:16:50,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:16:50,854 INFO L350 Elim1Store]: Elim1 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 127 treesize of output 75 [2022-11-20 16:16:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:16:53,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68626445] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:16:53,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:16:53,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 19] total 52 [2022-11-20 16:16:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279462634] [2022-11-20 16:16:53,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:16:53,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 16:16:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:16:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 16:16:53,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=2174, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 16:16:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:53,245 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:16:53,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.865384615384615) internal successors, (305), 52 states have internal predecessors, (305), 0 states have call successors, (0), 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-20 16:16:53,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:53,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:16:53,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:16:53,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:16:53,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:16:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:16:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:16:57,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-20 16:16:57,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 16:16:57,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:16:57,545 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-20 16:16:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:16:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1303894886, now seen corresponding path program 2 times [2022-11-20 16:16:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:16:57,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988098654] [2022-11-20 16:16:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:16:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:16:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:16:58,093 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-20 16:16:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:16:58,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988098654] [2022-11-20 16:16:58,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988098654] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:16:58,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320582797] [2022-11-20 16:16:58,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:16:58,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:16:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:16:58,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:16:58,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 16:16:58,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:16:58,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:16:58,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 16:16:58,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:16:58,875 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-20 16:16:58,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:16:59,374 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-20 16:16:59,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320582797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:16:59,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:16:59,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2022-11-20 16:16:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605975594] [2022-11-20 16:16:59,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:16:59,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 16:16:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:16:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 16:16:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 16:16:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:59,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:16:59,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.666666666666667) internal successors, (253), 33 states have internal predecessors, (253), 0 states have call successors, (0), 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-20 16:16:59,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:59,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:16:59,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:16:59,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:16:59,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-20 16:16:59,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:17:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:17:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:17:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-20 16:17:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 16:17:01,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 16:17:02,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 16:17:02,099 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-20 16:17:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:17:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1964803798, now seen corresponding path program 3 times [2022-11-20 16:17:02,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:17:02,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551611095] [2022-11-20 16:17:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:17:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:17:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:17:02,430 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-20 16:17:02,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:17:02,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551611095] [2022-11-20 16:17:02,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551611095] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:17:02,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127236919] [2022-11-20 16:17:02,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 16:17:02,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:17:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:17:02,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:17:02,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 16:17:02,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 16:17:02,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:17:02,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 16:17:02,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:17:02,887 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-20 16:17:02,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:17:03,169 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-20 16:17:03,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127236919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:17:03,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:17:03,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-20 16:17:03,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125878684] [2022-11-20 16:17:03,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:17:03,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 16:17:03,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:17:03,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 16:17:03,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-11-20 16:17:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:03,178 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:17:03,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.125) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 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-20 16:17:03,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:03,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:17:03,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:17:03,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:17:03,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-20 16:17:03,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-20 16:17:03,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:17:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:17:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:17:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:17:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 16:17:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:17:04,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 16:17:04,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:17:04,921 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-20 16:17:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:17:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1094981842, now seen corresponding path program 1 times [2022-11-20 16:17:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:17:04,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139147974] [2022-11-20 16:17:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:17:04,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:17:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:17:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:17:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:17:05,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139147974] [2022-11-20 16:17:05,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139147974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:17:05,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437507093] [2022-11-20 16:17:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:17:05,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:17:05,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:17:05,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:17:05,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 16:17:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:17:05,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 16:17:05,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:17:06,205 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-20 16:17:06,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:17:06,760 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-20 16:17:06,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437507093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:17:06,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:17:06,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-11-20 16:17:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720851828] [2022-11-20 16:17:06,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:17:06,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 16:17:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:17:06,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 16:17:06,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2022-11-20 16:17:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:06,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:17:06,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.435897435897436) internal successors, (290), 39 states have internal predecessors, (290), 0 states have call successors, (0), 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-20 16:17:06,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:06,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:17:06,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:17:06,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:17:06,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:17:06,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-20 16:17:06,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:17:06,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:17:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:17:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:17:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-20 16:17:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:17:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:17:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 16:17:09,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 16:17:09,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:17:09,654 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-20 16:17:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:17:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1229161583, now seen corresponding path program 4 times [2022-11-20 16:17:09,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:17:09,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910078572] [2022-11-20 16:17:09,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:17:09,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:17:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:17:12,256 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-20 16:17:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:17:12,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910078572] [2022-11-20 16:17:12,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910078572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:17:12,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163531749] [2022-11-20 16:17:12,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 16:17:12,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:17:12,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:17:12,259 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:17:12,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 16:17:12,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 16:17:12,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:17:12,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 16:17:12,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:17:13,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 16:17:14,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 16:17:14,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 16:17:15,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:15,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-20 16:17:15,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:15,711 INFO L350 Elim1Store]: Elim1 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 63 treesize of output 43 [2022-11-20 16:17:16,847 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-20 16:17:16,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:17:18,888 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse1) (not (< c_~max3~0 .cse1)) (<= .cse1 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2)) (< (+ ~M~0 1) c_~N~0))))))) is different from false [2022-11-20 16:17:45,805 WARN L233 SmtUtils]: Spent 16.50s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:17:47,399 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~max2~0 c_~max3~0)) (.cse0 (= c_~max1~0 c_~max2~0)) (.cse2 (<= c_~max3~0 c_~max2~0)) (.cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (or (and (or .cse0 .cse1) (or (= c_~max1~0 c_~max3~0) .cse2)) (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select (select .cse3 c_~A~0.base) .cse4)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse6 (select (select .cse7 c_~A~0.base) .cse4))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse5)) (not (< ~M~0 c_~N~0)) (<= .cse5 c_~max2~0) (= .cse6 .cse5) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse6)))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse8 (select (select .cse10 c_~A~0.base) .cse4))) (or (not (< c_~max1~0 .cse8)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse9)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse9) (< (+ ~M~0 1) c_~N~0)))) (= c_~max2~0 .cse8))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse11 (select (select .cse12 c_~A~0.base) .cse4))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse11)) (< c_~max3~0 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= c_~max2~0 .cse11) (< (+ ~M~0 1) c_~N~0))))) .cse1) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse13)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse13) (< c_~max1~0 (select (select .cse14 c_~A~0.base) .cse4)) (< (+ ~M~0 1) c_~N~0)))))) (or .cse2 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse15 (select (select .cse16 c_~A~0.base) .cse4))) (or (= c_~max3~0 .cse15) (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse15)) (< c_~max3~0 (select (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse17)) (not (< ~M~0 c_~N~0)) (<= .cse17 c_~max2~0) (= c_~max1~0 .cse17) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse18 c_~A~0.base) .cse4))))))) is different from false [2022-11-20 16:17:48,602 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_~max1~0 c_~max2~0)) (.cse0 (< c_~max2~0 c_~max3~0)) (.cse7 (<= c_~max3~0 c_~max2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse1)) (= .cse1 c_~max2~0) (< c_~max3~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse3)) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 .cse3) (< (+ ~M~0 1) c_~N~0))))) .cse5) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) (and (or .cse5 .cse0) (or (= c_~max1~0 c_~max3~0) .cse7))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (< c_~max1~0 (select (select .cse8 c_~A~0.base) c_~A~0.offset)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse9)) (not (< ~M~0 c_~N~0)) (<= .cse9 c_~max2~0) (= c_~max1~0 .cse9) (< (+ ~M~0 1) c_~N~0))))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse10 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse10)) (= .cse10 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse11)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse11) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse14 (select (select .cse15 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse13)) (not (< ~M~0 c_~N~0)) (<= .cse13 c_~max2~0) (= .cse14 .cse13) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse14)))))) (or .cse7 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse16 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse16)) (= .cse16 c_~max3~0) (< c_~max3~0 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))))) is different from false [2022-11-20 16:17:49,088 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~max2~0 c_~max3~0)) (.cse4 (<= c_~max3~0 c_~max2~0)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse0 c_~max2~0) (< (+ ~M~0 1) c_~N~0))))) .cse2) (or (and (or .cse3 .cse2) (or (= c_~max1~0 c_~max3~0) .cse4)) (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse5 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse6 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse6)) (= .cse6 c_~max3~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse8 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse8)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse9) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse9)) (< (+ ~M~0 1) c_~N~0)))) (= .cse8 c_~max2~0))))) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse11) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse11)) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse13) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse13)) (<= .cse13 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse14 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse15 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse15)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse16)) (<= .cse16 c_~max2~0) (= .cse16 .cse15) (< (+ ~M~0 1) c_~N~0)))))))))) is different from false [2022-11-20 16:17:51,464 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_~max1~0 c_~max2~0)) (.cse10 (< c_~max2~0 c_~max3~0)) (.cse5 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse0)) (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse2)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse3)) (= .cse2 .cse3) (<= .cse3 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))))))) (or .cse5 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse6)) (= .cse6 c_~max3~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse8)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (= .cse8 c_~max2~0) (< (+ ~M~0 1) c_~N~0))))) .cse10) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max2~0 .cse12) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse12)) (< (+ ~M~0 1) c_~N~0) (< c_~max1~0 (select (select .cse13 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))))) (or (and (or .cse11 .cse10) (or (= c_~max1~0 c_~max3~0) .cse5)) (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0) (< c_~max1~0 (select (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse15)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max2~0 .cse16) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse16)) (< (+ ~M~0 1) c_~N~0)))) (= .cse15 c_~max2~0))))))) is different from false [2022-11-20 16:17:51,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_~max1~0 c_~max2~0)) (.cse8 (< c_~max2~0 c_~max3~0)) (.cse5 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= .cse0 c_~max2~0) (= .cse1 .cse0) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse0)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse1)))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse3 c_~max3~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max1~0 .cse3)) (< (+ ~M~0 1) c_~N~0))))) .cse5) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse7 c_~max2~0) (not (< c_~max1~0 .cse7)) (< (+ ~M~0 1) c_~N~0))))) .cse8) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (< c_~max1~0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse10 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= .cse10 c_~max2~0) (= c_~max1~0 .cse10) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse10)) (< (+ ~M~0 1) c_~N~0))))))) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse12) (< c_~max1~0 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (< c_~max3~0 .cse12)) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< c_~max1~0 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< (+ ~M~0 1) c_~N~0)))) (and (or .cse11 .cse8) (or (= c_~max1~0 c_~max3~0) .cse5))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse15 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse16) (not (< c_~max3~0 .cse16)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse15)))))))) is different from false [2022-11-20 16:17:52,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= c_~max1~0 c_~max2~0)) (.cse5 (< c_~max2~0 c_~max3~0)) (.cse6 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse0 c_~max2~0) (not (< c_~max1~0 .cse0)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse1) (< (+ ~M~0 1) c_~N~0) (not (< c_~max3~0 .cse1))))))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse3 c_~max2~0) (not (< c_~max1~0 .cse3)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0))))) .cse5) (or .cse6 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse7 c_~max3~0) (not (< c_~max1~0 .cse7)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0)))))) (or .cse9 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse10) (< c_~max1~0 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< (+ ~M~0 1) c_~N~0) (not (< c_~max3~0 .cse10))))))) (or (and (or .cse9 .cse5) (or (= c_~max1~0 c_~max3~0) .cse6)) (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< c_~max1~0 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse13)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse14 .cse13) (not (< ~M~0 c_~N~0)) (<= .cse14 c_~max2~0) (< (+ ~M~0 1) c_~N~0) (not (< c_~max3~0 .cse14))))))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse16) (<= .cse16 c_~max2~0) (< (+ ~M~0 1) c_~N~0) (not (< c_~max3~0 .cse16))))) (< c_~max1~0 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-11-20 16:17:55,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:55,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67 [2022-11-20 16:17:55,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:55,857 INFO L350 Elim1Store]: Elim1 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 663 treesize of output 637 [2022-11-20 16:17:55,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:55,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 627 treesize of output 585 [2022-11-20 16:17:55,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 532 treesize of output 436 [2022-11-20 16:17:55,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:55,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 359 treesize of output 343 [2022-11-20 16:17:58,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:58,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 60 [2022-11-20 16:17:58,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:58,390 INFO L350 Elim1Store]: Elim1 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 405 treesize of output 391 [2022-11-20 16:17:58,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 234 [2022-11-20 16:17:58,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:58,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 311 [2022-11-20 16:17:58,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:58,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 175 [2022-11-20 16:17:59,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:59,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-11-20 16:17:59,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:59,851 INFO L350 Elim1Store]: Elim1 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 403 treesize of output 389 [2022-11-20 16:17:59,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:59,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 285 [2022-11-20 16:17:59,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 220 [2022-11-20 16:17:59,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:17:59,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 293 [2022-11-20 16:18:03,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:03,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 60 [2022-11-20 16:18:03,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:03,675 INFO L350 Elim1Store]: Elim1 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 1457 treesize of output 1387 [2022-11-20 16:18:03,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:03,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1377 treesize of output 1275 [2022-11-20 16:18:03,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:03,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 735 treesize of output 689 [2022-11-20 16:18:03,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1014 treesize of output 822 [2022-11-20 16:18:58,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:58,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2022-11-20 16:18:58,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:18:58,610 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 16:18:58,610 INFO L350 Elim1Store]: Elim1 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 558 treesize of output 506 [2022-11-20 16:18:58,639 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 16:18:58,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 426 [2022-11-20 16:18:58,668 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 16:18:58,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 386 [2022-11-20 16:18:58,890 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:18:58,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 1 [2022-11-20 16:18:58,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:18:58,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2022-11-20 16:18:58,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:18:58,930 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 16:18:58,931 INFO L350 Elim1Store]: Elim1 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 259 treesize of output 239 [2022-11-20 16:18:58,954 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 16:18:58,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 207 [2022-11-20 16:18:58,985 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 16:18:58,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 191 [2022-11-20 16:19:02,684 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-20 16:19:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163531749] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:19:02,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:19:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32, 31] total 79 [2022-11-20 16:19:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542422173] [2022-11-20 16:19:02,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:19:02,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-20 16:19:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:19:02,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-20 16:19:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=4453, Unknown=14, NotChecked=1022, Total=6162 [2022-11-20 16:19:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:02,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:19:02,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 4.113924050632911) internal successors, (325), 79 states have internal predecessors, (325), 0 states have call successors, (0), 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-20 16:19:02,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:02,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:19:02,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:19:02,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:19:02,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-20 16:19:02,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-20 16:19:02,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-20 16:19:02,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-20 16:19:02,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:19:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:19:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:19:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:19:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-20 16:19:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:19:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 16:19:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-20 16:19:16,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 16:19:16,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 16:19:16,808 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-20 16:19:16,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:19:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1206971023, now seen corresponding path program 5 times [2022-11-20 16:19:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:19:16,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55336995] [2022-11-20 16:19:16,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:19:16,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:19:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:19:17,127 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-20 16:19:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:19:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55336995] [2022-11-20 16:19:17,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55336995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:19:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116284272] [2022-11-20 16:19:17,128 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 16:19:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:19:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:19:17,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:19:17,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 16:19:17,258 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-20 16:19:17,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:19:17,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 16:19:17,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:19:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:19:17,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:19:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:19:17,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116284272] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:19:17,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:19:17,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-20 16:19:17,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630649423] [2022-11-20 16:19:17,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:19:17,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 16:19:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:19:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 16:19:17,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-11-20 16:19:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:17,863 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:19:17,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 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-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-20 16:19:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-11-20 16:19:17,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-20 16:19:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-20 16:19:22,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 16:19:22,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:19:22,565 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-20 16:19:22,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:19:22,566 INFO L85 PathProgramCache]: Analyzing trace with hash 333021814, now seen corresponding path program 6 times [2022-11-20 16:19:22,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:19:22,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941099380] [2022-11-20 16:19:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:19:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:19:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:19:28,832 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-20 16:19:28,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:19:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941099380] [2022-11-20 16:19:28,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941099380] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:19:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012273705] [2022-11-20 16:19:28,833 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 16:19:28,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:19:28,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:19:28,834 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:19:28,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 16:19:28,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-20 16:19:28,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:19:28,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-20 16:19:28,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:19:32,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:19:32,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:19:32,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:19:32,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:19:32,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:19:32,436 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 84 [2022-11-20 16:19:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 16:19:32,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:19:38,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:19:38,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 621 treesize of output 265 [2022-11-20 16:19:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:19:41,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012273705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:19:41,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:19:41,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 29, 21] total 82 [2022-11-20 16:19:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772299025] [2022-11-20 16:19:41,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:19:41,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-20 16:19:41,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:19:41,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-20 16:19:41,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=6197, Unknown=0, NotChecked=0, Total=6642 [2022-11-20 16:19:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:41,917 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:19:41,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 4.487804878048781) internal successors, (368), 82 states have internal predecessors, (368), 0 states have call successors, (0), 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-20 16:19:41,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:19:41,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:19:41,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:19:41,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:19:41,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:19:41,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:19:41,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:19:41,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-20 16:19:41,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-11-20 16:19:41,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-20 16:19:41,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:20:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:20:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:20:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:20:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:20:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:20:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 16:20:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-20 16:20:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-20 16:20:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-11-20 16:20:30,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 16:20:30,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 16:20:30,485 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-20 16:20:30,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:20:30,485 INFO L85 PathProgramCache]: Analyzing trace with hash 648238083, now seen corresponding path program 7 times [2022-11-20 16:20:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:20:30,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960198711] [2022-11-20 16:20:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:20:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:30,815 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-20 16:20:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:20:30,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960198711] [2022-11-20 16:20:30,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960198711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:20:30,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68555058] [2022-11-20 16:20:30,816 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 16:20:30,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:30,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:20:30,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:20:30,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 16:20:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:30,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 16:20:30,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:20:31,383 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-20 16:20:31,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:20:31,795 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-20 16:20:31,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68555058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:20:31,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:20:31,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-11-20 16:20:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103891428] [2022-11-20 16:20:31,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:20:31,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 16:20:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:20:31,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 16:20:31,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 16:20:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:31,797 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:20:31,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.647058823529412) internal successors, (260), 34 states have internal predecessors, (260), 0 states have call successors, (0), 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-20 16:20:31,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:31,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:20:31,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:20:31,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:20:31,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:20:31,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:20:31,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:20:31,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-20 16:20:31,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-11-20 16:20:31,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-20 16:20:31,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2022-11-20 16:20:31,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:20:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:20:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:20:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:20:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:20:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:20:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:20:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-20 16:20:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-20 16:20:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-11-20 16:20:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:20:38,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 16:20:39,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:39,143 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-20 16:20:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:20:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1304833281, now seen corresponding path program 2 times [2022-11-20 16:20:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:20:39,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880901805] [2022-11-20 16:20:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:20:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:39,460 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-20 16:20:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:20:39,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880901805] [2022-11-20 16:20:39,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880901805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:20:39,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609775429] [2022-11-20 16:20:39,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:20:39,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:39,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:20:39,462 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:20:39,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 16:20:39,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:20:39,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:20:39,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 16:20:39,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:20:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:20:39,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:20:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:20:40,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609775429] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:20:40,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:20:40,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-20 16:20:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285829395] [2022-11-20 16:20:40,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:20:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 16:20:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:20:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 16:20:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-20 16:20:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:40,242 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:20:40,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 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-20 16:20:40,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:40,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 154 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:20:40,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-20 16:20:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-20 16:20:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-20 16:20:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:20:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-20 16:20:47,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 16:20:47,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:47,825 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-20 16:20:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:20:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash 6681437, now seen corresponding path program 1 times [2022-11-20 16:20:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:20:47,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006808614] [2022-11-20 16:20:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:20:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:20:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:20:48,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006808614] [2022-11-20 16:20:48,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006808614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:20:48,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415803160] [2022-11-20 16:20:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:48,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:20:48,050 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:20:48,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 16:20:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:48,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 16:20:48,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:20:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:20:48,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:20:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:20:48,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415803160] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:20:48,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:20:48,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-20 16:20:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437610105] [2022-11-20 16:20:48,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:20:48,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 16:20:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:20:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 16:20:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-20 16:20:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:48,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:20:48,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 0 states have call successors, (0), 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-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-11-20 16:20:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-11-20 16:20:48,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:20:48,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-20 16:20:48,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:20:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:20:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:20:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:20:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:20:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:20:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:20:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:20:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-20 16:20:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:20:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-20 16:20:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:20:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-20 16:20:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:20:49,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 16:20:49,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 16:20:49,696 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-20 16:20:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:20:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1755799160, now seen corresponding path program 2 times [2022-11-20 16:20:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:20:49,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588465206] [2022-11-20 16:20:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:20:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:20:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:20:53,651 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-20 16:20:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:20:53,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588465206] [2022-11-20 16:20:53,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588465206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:20:53,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758157517] [2022-11-20 16:20:53,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:20:53,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:20:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:20:53,654 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:20:53,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 16:20:53,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:20:53,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:20:53,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-20 16:20:53,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:20:54,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 16:20:55,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 16:20:55,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 16:20:55,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 16:20:57,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:20:57,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:20:57,533 INFO L321 Elim1Store]: treesize reduction 24, result has 72.7 percent of original size [2022-11-20 16:20:57,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 143 [2022-11-20 16:21:00,327 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-20 16:21:00,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:22:26,316 WARN L233 SmtUtils]: Spent 1.10m on a formula simplification. DAG size of input: 197 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:23:12,207 WARN L233 SmtUtils]: Spent 33.68s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:23:14,789 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse103 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse12 (+ c_~max2~0 1))) (let ((.cse22 (<= .cse12 c_~max3~0)) (.cse38 (= c_~max1~0 c_~max2~0)) (.cse53 (= c_~max1~0 c_~max3~0)) (.cse30 (<= c_~max3~0 c_~max2~0)) (.cse3 (+ c_thread1Thread1of1ForFork2_~i~0 1)) (.cse5 (+ c_~A~0.offset .cse103 4)) (.cse6 (+ c_~A~0.offset .cse103))) (and (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse0 (select .cse4 .cse6)) (.cse1 (select .cse4 .cse5))) (or (not (< c_~max1~0 .cse0)) (not (< .cse0 .cse1)) (forall ((~M~0 Int)) (let ((.cse2 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse2 .cse1) (not (< 0 ~M~0)) (< .cse3 ~M~0) (<= .cse2 c_~max2~0) (not (< c_~max3~0 .cse2))))) (< c_~max2~0 (select .cse4 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse5)) (.cse8 (select .cse9 c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (not (< c_~max2~0 .cse8)) (< c_~max1~0 (select .cse9 .cse6)) (forall ((~M~0 Int)) (let ((.cse10 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse10 .cse7) (not (< 0 ~M~0)) (< .cse3 ~M~0) (<= .cse10 .cse8) (not (< c_~max3~0 .cse10))))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse5))) (or (not (< c_~max1~0 .cse11)) (forall ((~M~0 Int)) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse12 .cse13) (< .cse3 ~M~0) (not (< c_~max3~0 .cse13))))) (= .cse11 c_~max2~0) (< c_~max1~0 (select .cse14 .cse6)) (< c_~max2~0 (select .cse14 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse15 (select .cse18 .cse5)) (.cse16 (select .cse18 c_~A~0.offset))) (or (= .cse15 .cse16) (not (< c_~max1~0 .cse15)) (forall ((~M~0 Int)) (let ((.cse17 (select .cse18 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse16 1) .cse17) (not (< 0 ~M~0)) (< .cse3 ~M~0) (not (< c_~max3~0 .cse17))))) (not (< c_~max2~0 .cse16)) (< c_~max1~0 (select .cse18 .cse6)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse5))) (or (not (< c_~max1~0 .cse19)) (forall ((~M~0 Int)) (let ((.cse20 (select .cse21 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse20 .cse19) (not (< 0 ~M~0)) (< .cse3 ~M~0) (<= .cse20 c_~max2~0) (not (< c_~max3~0 .cse20))))) (< c_~max1~0 (select .cse21 .cse6)) (< c_~max2~0 (select .cse21 c_~A~0.offset)))))) (or .cse22 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse6)) (.cse24 (select .cse25 .cse5))) (or (not (< 0 ~M~0)) (not (< c_~max1~0 .cse23)) (not (< .cse23 .cse24)) (< .cse3 ~M~0) (= .cse24 c_~max2~0) (< c_~max3~0 (select .cse25 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse25 c_~A~0.offset))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse26 (select .cse28 c_~A~0.offset)) (.cse29 (select .cse28 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse27 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse26 1) .cse27) (not (< 0 ~M~0)) (< .cse3 ~M~0) (not (< c_~max3~0 .cse27))))) (not (< c_~max1~0 .cse29)) (not (< c_~max2~0 .cse26)) (< .cse29 (select .cse28 .cse5)) (= .cse26 .cse29))))) (or .cse30 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse31 (select .cse33 .cse6)) (.cse32 (select .cse33 .cse5))) (or (not (< 0 ~M~0)) (not (< c_~max1~0 .cse31)) (not (< .cse31 .cse32)) (< .cse3 ~M~0) (= .cse32 c_~max3~0) (< c_~max3~0 (select .cse33 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse33 c_~A~0.offset))))))) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse34 (select .cse35 .cse6))) (or (not (< 0 ~M~0)) (not (< c_~max1~0 .cse34)) (< .cse3 ~M~0) (< .cse34 (select .cse35 .cse5)) (= .cse34 c_~max2~0) (< c_~max3~0 (select .cse35 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse35 c_~A~0.offset)))))) .cse22) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse36 (select .cse37 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse12 .cse36) (< .cse3 ~M~0) (< c_~max1~0 (select .cse37 .cse5)) (< c_~max1~0 (select .cse37 .cse6)) (not (< c_~max3~0 .cse36)) (< c_~max2~0 (select .cse37 c_~A~0.offset)))))) .cse38) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse39 (select .cse40 .cse5))) (or (not (< c_~max1~0 .cse39)) (not (< 0 ~M~0)) (< .cse3 ~M~0) (= .cse39 c_~max2~0) (< c_~max1~0 (select .cse40 .cse6)) (< c_~max3~0 (select .cse40 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse40 c_~A~0.offset)))))) .cse22) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse41 (select .cse44 .cse6)) (.cse43 (select .cse44 .cse5)) (.cse42 (select .cse44 c_~A~0.offset))) (or (not (< c_~max1~0 .cse41)) (not (< c_~max2~0 .cse42)) (not (< .cse41 .cse43)) (= .cse43 c_~max3~0) (<= c_~max3~0 .cse42) (< c_~max3~0 (select .cse44 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse45 (select .cse47 .cse5)) (.cse46 (select .cse47 c_~A~0.offset))) (or (= .cse45 .cse46) (not (< c_~max1~0 .cse45)) (not (< c_~max2~0 .cse46)) (<= (+ .cse46 1) c_~max3~0) (< c_~max1~0 (select .cse47 .cse6)) (< c_~max3~0 (select .cse47 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse49 (select .cse50 c_~A~0.offset)) (.cse48 (select .cse50 .cse6))) (or (not (< c_~max1~0 .cse48)) (not (< c_~max2~0 .cse49)) (< .cse48 (select .cse50 .cse5)) (<= c_~max3~0 .cse49) (= .cse48 c_~max3~0) (< c_~max3~0 (select .cse50 (+ c_~A~0.offset (* ~M~0 4)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse6))) (or (not (< 0 ~M~0)) (not (< c_~max1~0 .cse51)) (< .cse3 ~M~0) (< .cse51 (select .cse52 .cse5)) (= .cse51 c_~max3~0) (< c_~max3~0 (select .cse52 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse52 c_~A~0.offset)))))) .cse30) (or (and .cse53 .cse22) (and .cse38 .cse30) (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (< c_~max1~0 (select .cse54 .cse5)) (< c_~max1~0 (select .cse54 .cse6)) (< c_~max3~0 (select .cse54 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse54 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (or (< c_~max1~0 (select .cse55 .cse5)) (< c_~max1~0 (select .cse55 .cse6)) (< c_~max2~0 (select .cse55 c_~A~0.offset)) (forall ((~M~0 Int)) (let ((.cse56 (select .cse55 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (= .cse56 c_~max1~0) (<= .cse56 c_~max2~0) (not (< c_~max3~0 .cse56)))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse59 (select .cse60 .cse6)) (.cse57 (select .cse60 .cse5)) (.cse58 (select .cse60 c_~A~0.offset))) (or (= .cse57 .cse58) (not (< c_~max1~0 .cse59)) (not (< c_~max2~0 .cse58)) (not (< .cse59 .cse57)) (<= (+ .cse58 1) c_~max3~0) (< c_~max3~0 (select .cse60 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse62 (select .cse63 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse61 (select .cse63 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (= .cse61 c_~max1~0) (<= .cse61 .cse62) (not (< c_~max3~0 .cse61))))) (not (< c_~max2~0 .cse62)) (< c_~max1~0 (select .cse63 .cse5)) (< c_~max1~0 (select .cse63 .cse6)))))) (or .cse53 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse64 (select .cse65 c_~A~0.offset))) (or (not (< 0 ~M~0)) (not (< c_~max2~0 .cse64)) (< .cse3 ~M~0) (<= c_~max3~0 .cse64) (< c_~max1~0 (select .cse65 .cse5)) (< c_~max1~0 (select .cse65 .cse6)) (< c_~max3~0 (select .cse65 (+ c_~A~0.offset (* ~M~0 4))))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse68 (select .cse67 .cse6)) (.cse69 (select .cse67 .cse5))) (or (forall ((~M~0 Int)) (let ((.cse66 (select .cse67 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse12 .cse66) (< .cse3 ~M~0) (not (< c_~max3~0 .cse66))))) (not (< c_~max1~0 .cse68)) (not (< .cse68 .cse69)) (= .cse69 c_~max2~0) (< c_~max2~0 (select .cse67 c_~A~0.offset)))))) (or .cse30 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse71 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse70 (select .cse71 .cse5))) (or (not (< c_~max1~0 .cse70)) (not (< 0 ~M~0)) (< .cse3 ~M~0) (= .cse70 c_~max3~0) (< c_~max1~0 (select .cse71 .cse6)) (< c_~max3~0 (select .cse71 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse71 c_~A~0.offset))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse74 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse72 (select .cse74 .cse6))) (or (not (< c_~max1~0 .cse72)) (forall ((~M~0 Int)) (let ((.cse73 (select .cse74 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= .cse73 .cse72) (< .cse3 ~M~0) (<= .cse73 c_~max2~0) (not (< c_~max3~0 .cse73))))) (< .cse72 (select .cse74 .cse5)) (< c_~max2~0 (select .cse74 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse78 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse76 (select .cse78 c_~A~0.offset)) (.cse79 (select .cse78 .cse6)) (.cse75 (select .cse78 .cse5))) (or (= .cse75 .cse76) (forall ((~M~0 Int)) (let ((.cse77 (select .cse78 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse76 1) .cse77) (not (< 0 ~M~0)) (< .cse3 ~M~0) (not (< c_~max3~0 .cse77))))) (not (< c_~max1~0 .cse79)) (not (< c_~max2~0 .cse76)) (not (< .cse79 .cse75)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse82 (select .cse81 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse80 (select .cse81 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse12 .cse80) (< .cse3 ~M~0) (not (< c_~max3~0 .cse80))))) (not (< c_~max1~0 .cse82)) (< .cse82 (select .cse81 .cse5)) (= .cse82 c_~max2~0) (< c_~max2~0 (select .cse81 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse85 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse83 (select .cse85 c_~A~0.offset))) (or (= c_~max1~0 .cse83) (forall ((~M~0 Int)) (let ((.cse84 (select .cse85 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse83 1) .cse84) (not (< 0 ~M~0)) (< .cse3 ~M~0) (not (< c_~max3~0 .cse84))))) (not (< c_~max2~0 .cse83)) (< c_~max1~0 (select .cse85 .cse5)) (< c_~max1~0 (select .cse85 .cse6)))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse87 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse86 (select .cse87 c_~A~0.offset))) (or (= c_~max1~0 .cse86) (not (< c_~max2~0 .cse86)) (< c_~max1~0 (select .cse87 .cse5)) (<= (+ .cse86 1) c_~max3~0) (< c_~max1~0 (select .cse87 .cse6)) (< c_~max3~0 (select .cse87 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse90 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse88 (select .cse90 .cse6)) (.cse89 (select .cse90 c_~A~0.offset))) (or (not (< c_~max1~0 .cse88)) (not (< c_~max2~0 .cse89)) (< .cse88 (select .cse90 .cse5)) (= .cse89 .cse88) (<= (+ .cse89 1) c_~max3~0) (< c_~max3~0 (select .cse90 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< 0 ~M~0)) (< .cse3 ~M~0))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse94 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse93 (select .cse94 c_~A~0.offset)) (.cse92 (select .cse94 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse91 (select .cse94 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= .cse91 .cse92) (< .cse3 ~M~0) (<= .cse91 .cse93) (not (< c_~max3~0 .cse91))))) (not (< c_~max1~0 .cse92)) (not (< c_~max2~0 .cse93)) (< .cse92 (select .cse94 .cse5)))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse97 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse95 (select .cse97 .cse5)) (.cse96 (select .cse97 c_~A~0.offset))) (or (not (< c_~max1~0 .cse95)) (not (< c_~max2~0 .cse96)) (= .cse95 c_~max3~0) (<= c_~max3~0 .cse96) (< c_~max1~0 (select .cse97 .cse6)) (< c_~max3~0 (select .cse97 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse102 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse98 (select .cse102 .cse6)) (.cse100 (select .cse102 .cse5)) (.cse99 (select .cse102 c_~A~0.offset))) (or (not (< c_~max1~0 .cse98)) (not (< c_~max2~0 .cse99)) (not (< .cse98 .cse100)) (forall ((~M~0 Int)) (let ((.cse101 (select .cse102 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse101 .cse100) (not (< 0 ~M~0)) (< .cse3 ~M~0) (<= .cse101 .cse99) (not (< c_~max3~0 .cse101)))))))))))) is different from false [2022-11-20 16:23:20,815 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~max2~0 1))) (let ((.cse3 (= c_~max1~0 c_~max3~0)) (.cse26 (= c_~max1~0 c_~max2~0)) (.cse17 (<= c_~max3~0 c_~max2~0)) (.cse2 (+ c_~A~0.offset 4)) (.cse20 (<= .cse6 c_~max3~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (< c_~max1~0 .cse0) (not (< 0 ~M~0)) (not (< c_~max2~0 .cse0)) (<= c_~max3~0 .cse0) (< c_~max1~0 (select .cse1 .cse2)) (< c_~max3~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) (< 1 ~M~0))))) .cse3) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse5 (select .cse8 .cse2)) (.cse4 (select .cse8 c_~A~0.offset))) (or (< c_~max1~0 .cse4) (= c_~max2~0 .cse5) (not (< c_~max1~0 .cse5)) (forall ((~M~0 Int)) (let ((.cse7 (select .cse8 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse6 .cse7) (not (< c_~max3~0 .cse7)) (< 1 ~M~0)))) (< c_~max2~0 .cse4))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse9 (select .cse11 c_~A~0.offset)) (.cse10 (select .cse11 .cse2))) (or (< c_~max1~0 .cse9) (not (< c_~max2~0 .cse9)) (not (< c_~max1~0 .cse10)) (= c_~max3~0 .cse10) (< c_~max3~0 (select .cse11 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset))) (or (< c_~max1~0 .cse12) (not (< c_~max2~0 .cse12)) (< c_~max1~0 (select .cse13 .cse2)) (forall ((~M~0 Int)) (let ((.cse14 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= .cse14 c_~max1~0) (<= .cse14 .cse12) (not (< c_~max3~0 .cse14)) (< 1 ~M~0)))))))) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (not (< 0 ~M~0)) (< .cse15 (select .cse16 .cse2)) (not (< c_~max1~0 .cse15)) (< c_~max2~0 .cse15) (< 1 ~M~0))))) .cse17) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse18 (select .cse19 c_~A~0.offset))) (or (not (< 0 ~M~0)) (= .cse18 c_~max2~0) (< .cse18 (select .cse19 .cse2)) (not (< c_~max1~0 .cse18)) (< c_~max3~0 (select .cse19 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse18) (< 1 ~M~0))))) .cse20) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse2)) (.cse21 (select .cse23 c_~A~0.offset))) (or (not (< .cse21 .cse22)) (not (< c_~max2~0 .cse21)) (= c_~max3~0 .cse22) (not (< c_~max1~0 .cse21)) (< c_~max3~0 (select .cse23 (+ c_~A~0.offset (* ~M~0 4)))))))) (< 1 ~M~0))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse25 (select .cse24 c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< c_~max3~0 (select .cse24 (+ c_~A~0.offset (* ~M~0 4))))) (< 1 ~M~0))) (= .cse25 c_~max2~0) (< .cse25 (select .cse24 .cse2)) (not (< c_~max1~0 .cse25)) (< c_~max2~0 .cse25))))) (or .cse26 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse28 (select .cse29 (+ c_~A~0.offset (* ~M~0 4)))) (.cse27 (select .cse29 c_~A~0.offset))) (or (< c_~max1~0 .cse27) (not (< 0 ~M~0)) (<= .cse6 .cse28) (< c_~max1~0 (select .cse29 .cse2)) (not (< c_~max3~0 .cse28)) (< c_~max2~0 .cse27) (< 1 ~M~0)))))) (or (and .cse3 .cse20) (and .cse26 .cse17) (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset))) (or (< c_~max1~0 .cse30) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse31 .cse2)) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse30) (< 1 ~M~0)))))) (or .cse17 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse2)) (.cse32 (select .cse34 c_~A~0.offset))) (or (< c_~max1~0 .cse32) (not (< 0 ~M~0)) (not (< c_~max1~0 .cse33)) (= c_~max3~0 .cse33) (< c_~max3~0 (select .cse34 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse32) (< 1 ~M~0)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse36 (select .cse38 .cse2)) (.cse35 (select .cse38 c_~A~0.offset))) (or (not (< .cse35 .cse36)) (= c_~max2~0 .cse36) (not (< c_~max1~0 .cse35)) (forall ((~M~0 Int)) (let ((.cse37 (select .cse38 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse6 .cse37) (not (< c_~max3~0 .cse37)) (< 1 ~M~0)))) (< c_~max2~0 .cse35))))) (or .cse20 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse40 (select .cse41 .cse2)) (.cse39 (select .cse41 c_~A~0.offset))) (or (not (< .cse39 .cse40)) (not (< 0 ~M~0)) (= c_~max2~0 .cse40) (not (< c_~max1~0 .cse39)) (< c_~max3~0 (select .cse41 (+ c_~A~0.offset (* ~M~0 4)))) (< 1 ~M~0)))))) (or .cse17 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse43 (select .cse44 .cse2)) (.cse42 (select .cse44 c_~A~0.offset))) (or (not (< .cse42 .cse43)) (not (< 0 ~M~0)) (= c_~max3~0 .cse43) (not (< c_~max1~0 .cse42)) (< c_~max3~0 (select .cse44 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse42) (< 1 ~M~0)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse45 (select .cse47 c_~A~0.offset))) (or (< c_~max1~0 .cse45) (forall ((~M~0 Int)) (let ((.cse46 (select .cse47 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= .cse46 c_~max1~0) (<= .cse46 c_~max2~0) (not (< c_~max3~0 .cse46)) (< 1 ~M~0)))) (< c_~max1~0 (select .cse47 .cse2)) (< c_~max2~0 .cse45))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse48 (select .cse49 c_~A~0.offset))) (or (<= .cse48 c_~max1~0) (<= c_~max3~0 .cse48) (< .cse48 (select .cse49 .cse2)) (<= .cse48 c_~max2~0))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse51 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse50 (select .cse51 c_~A~0.offset))) (or (= c_~max1~0 .cse50) (< c_~max1~0 .cse50) (not (< c_~max2~0 .cse50)) (< c_~max1~0 (select .cse51 .cse2)) (forall ((~M~0 Int)) (let ((.cse52 (select .cse51 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse50 1) .cse52) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse52)) (< 1 ~M~0)))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse53 (select .cse54 c_~A~0.offset))) (or (= c_~max1~0 .cse53) (< c_~max1~0 .cse53) (not (< c_~max2~0 .cse53)) (<= (+ .cse53 1) c_~max3~0) (< c_~max3~0 (select .cse54 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse56 (select .cse55 .cse2))) (or (< c_~max1~0 (select .cse55 c_~A~0.offset)) (not (< 0 ~M~0)) (= c_~max2~0 .cse56) (not (< c_~max1~0 .cse56)) (< c_~max3~0 (select .cse55 (+ c_~A~0.offset (* ~M~0 4)))) (< 1 ~M~0))))) .cse20)))) is different from false [2022-11-20 16:23:56,450 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:24:05,994 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:24:09,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:24:09,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 114 [2022-11-20 16:24:09,639 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:09,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5484 treesize of output 5248 [2022-11-20 16:24:09,724 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:09,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5244 treesize of output 4672 [2022-11-20 16:24:09,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:24:09,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:24:09,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3358 treesize of output 3214 [2022-11-20 16:24:09,860 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:09,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4524 treesize of output 4240 [2022-11-20 16:24:28,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:24:28,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 102 [2022-11-20 16:24:28,782 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:28,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 629 treesize of output 605 [2022-11-20 16:24:28,818 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:28,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 601 treesize of output 569 [2022-11-20 16:24:28,852 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:28,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 565 treesize of output 497 [2022-11-20 16:24:28,890 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:28,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 305 treesize of output 291 [2022-11-20 16:24:29,609 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:29,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 1 [2022-11-20 16:24:29,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:24:29,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 100 [2022-11-20 16:24:29,673 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:29,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1279 treesize of output 1231 [2022-11-20 16:24:29,725 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:29,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1227 treesize of output 1167 [2022-11-20 16:24:29,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:24:29,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 711 treesize of output 679 [2022-11-20 16:24:29,804 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:29,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1131 treesize of output 1007 [2022-11-20 16:24:32,038 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:32,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 1 [2022-11-20 16:24:32,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:24:32,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 83 [2022-11-20 16:24:32,092 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:32,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1029 treesize of output 989 [2022-11-20 16:24:32,136 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:32,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 985 treesize of output 877 [2022-11-20 16:24:32,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:24:32,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 449 treesize of output 421 [2022-11-20 16:24:32,214 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-20 16:24:32,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 845 treesize of output 793 [2022-11-20 16:24:33,323 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2022-11-20 16:24:33,342 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 1 [2022-11-20 16:24:33,364 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 1 [2022-11-20 16:24:33,380 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 1 [2022-11-20 16:24:33,395 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 1 [2022-11-20 16:24:33,412 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 1 [2022-11-20 16:24:33,433 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-20 16:24:33,449 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 1 [2022-11-20 16:24:33,464 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 1 [2022-11-20 16:24:33,481 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 1 [2022-11-20 16:24:33,497 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 1 [2022-11-20 16:24:33,511 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 1 [2022-11-20 16:24:33,529 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 16:24:33,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2022-11-20 16:24:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 16:24:34,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758157517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:24:34,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:24:34,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 28] total 83 [2022-11-20 16:24:34,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187003572] [2022-11-20 16:24:34,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:24:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-20 16:24:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-20 16:24:34,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=5638, Unknown=85, NotChecked=318, Total=6806 [2022-11-20 16:24:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:34,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:34,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 4.433734939759036) internal successors, (368), 83 states have internal predecessors, (368), 0 states have call successors, (0), 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-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:24:34,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-20 16:24:34,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:24:34,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-11-20 16:24:34,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:24:34,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-20 16:24:34,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:24:34,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-20 16:26:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:26:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-20 16:26:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:26:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-20 16:26:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:26:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-20 16:26:01,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 16:26:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 16:26:01,255 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-20 16:26:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:26:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2017837283, now seen corresponding path program 3 times [2022-11-20 16:26:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:26:01,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028480845] [2022-11-20 16:26:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:26:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:26:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:26:01,713 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-20 16:26:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:26:01,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028480845] [2022-11-20 16:26:01,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028480845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:26:01,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439393086] [2022-11-20 16:26:01,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 16:26:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:26:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:26:01,715 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:26:01,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 16:26:01,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 16:26:01,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:26:01,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 16:26:01,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:26:02,532 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-20 16:26:02,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:26:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 16:26:03,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439393086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:26:03,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:26:03,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 36 [2022-11-20 16:26:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627705596] [2022-11-20 16:26:03,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:26:03,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 16:26:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:26:03,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 16:26:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 16:26:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:26:03,045 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:26:03,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.638888888888889) internal successors, (275), 36 states have internal predecessors, (275), 0 states have call successors, (0), 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-20 16:26:03,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:26:03,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:26:03,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:26:03,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:26:03,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-20 16:26:03,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:26:03,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:26:03,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:26:03,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-20 16:26:03,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-20 16:26:03,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-11-20 16:26:03,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:26:03,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-20 16:26:03,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:26:03,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-11-20 16:26:03,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:28:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:28:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:28:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-20 16:28:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:28:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-11-20 16:28:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-11-20 16:28:02,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-20 16:28:02,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 16:28:02,200 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-20 16:28:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:28:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -281078078, now seen corresponding path program 2 times [2022-11-20 16:28:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:28:02,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932726212] [2022-11-20 16:28:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:02,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:28:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:28:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:28:02,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932726212] [2022-11-20 16:28:02,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932726212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:28:02,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723698704] [2022-11-20 16:28:02,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:28:02,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:02,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:28:02,466 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:28:02,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 16:28:02,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:28:02,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:28:02,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 16:28:02,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:28:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:28:02,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:28:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:28:03,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723698704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:28:03,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:28:03,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2022-11-20 16:28:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923072813] [2022-11-20 16:28:03,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:28:03,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 16:28:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:28:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 16:28:03,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-11-20 16:28:03,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:03,150 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:28:03,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.48) internal successors, (237), 25 states have internal predecessors, (237), 0 states have call successors, (0), 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-20 16:28:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:28:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:28:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:28:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 186 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 146 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 177 states. [2022-11-20 16:28:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:28:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:28:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:28:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-20 16:28:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-20 16:28:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:28:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:28:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-20 16:28:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-20 16:28:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2022-11-20 16:28:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:28:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-20 16:28:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:28:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-11-20 16:28:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-11-20 16:28:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:28:06,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-20 16:28:06,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 16:28:06,695 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-20 16:28:06,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:28:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash 965606947, now seen corresponding path program 8 times [2022-11-20 16:28:06,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:28:06,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388768181] [2022-11-20 16:28:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:06,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:28:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:06,982 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-20 16:28:06,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:28:06,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388768181] [2022-11-20 16:28:06,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388768181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:28:06,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045183067] [2022-11-20 16:28:06,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:28:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:06,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:28:06,984 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:28:07,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 16:28:07,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:28:07,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:28:07,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 16:28:07,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:28:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:28:07,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:28:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 16:28:07,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045183067] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:28:07,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:28:07,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-11-20 16:28:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566184484] [2022-11-20 16:28:07,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:28:07,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 16:28:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:28:07,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 16:28:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2022-11-20 16:28:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:07,730 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:28:07,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 26 states have internal predecessors, (238), 0 states have call successors, (0), 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-20 16:28:07,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:07,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 186 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:28:07,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 146 states. [2022-11-20 16:28:07,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 177 states. [2022-11-20 16:28:07,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:28:07,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:28:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 16:28:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 16:28:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 16:28:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-20 16:28:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-20 16:28:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 16:28:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 16:28:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-20 16:28:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-20 16:28:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2022-11-20 16:28:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 16:28:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-20 16:28:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 16:28:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-11-20 16:28:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-11-20 16:28:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 16:28:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-20 16:28:11,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 16:28:11,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 16:28:11,767 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-20 16:28:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:28:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1541486618, now seen corresponding path program 9 times [2022-11-20 16:28:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:28:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112341375] [2022-11-20 16:28:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:28:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:28:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:28:18,831 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-20 16:28:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:28:18,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112341375] [2022-11-20 16:28:18,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112341375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:28:18,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764394260] [2022-11-20 16:28:18,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 16:28:18,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:28:18,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:28:18,840 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:28:18,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c99bab3-91f8-4b89-a940-6bfd9d567480/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 16:28:19,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 16:28:19,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:28:19,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 16:28:19,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:28:21,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 16:28:22,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 16:28:23,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 16:28:24,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:28:24,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 89 [2022-11-20 16:28:29,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:28:29,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 199 treesize of output 267 [2022-11-20 16:28:34,902 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-20 16:28:34,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:29:00,257 WARN L233 SmtUtils]: Spent 14.02s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:29:14,008 WARN L233 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:29:57,560 WARN L233 SmtUtils]: Spent 28.38s on a formula simplification that was a NOOP. DAG size: 207 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 16:30:09,703 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (< c_~max2~0 c_~max3~0)) (.cse103 (<= c_~max3~0 c_~max2~0)) (.cse25 (= c_~max1~0 c_~max2~0)) (.cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse1 (select .cse6 c_~A~0.base))) (let ((.cse0 (select .cse1 .cse7))) (or (not (< c_~max1~0 .cse0)) (< .cse0 (select .cse1 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) 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 (= .cse0 .cse2) (<= .cse2 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse3)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse3 .cse2))))))))))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse8 (select .cse13 c_~A~0.base))) (or (< c_~max1~0 (select .cse8 .cse7)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse12 (select .cse8 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse11 (* ~M~0 4))) (let ((.cse9 (select .cse10 (+ c_~A~0.offset .cse11)))) (or (< .cse9 (select .cse10 (+ c_~A~0.offset .cse11 4))) (= .cse12 .cse9) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse9)) (< (+ 2 ~M~0) c_~N~0) (<= .cse9 c_~max2~0))))) (not (< c_~max1~0 .cse12)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_73 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse14 (select .cse18 c_~A~0.base))) (let ((.cse15 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse16 (* ~M~0 4)) (.cse17 (select .cse14 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_73 4))))) (or (< c_~max1~0 (select .cse14 .cse7)) (< (+ v_thread1Thread1of1ForFork2_~i~0_73 1) c_~N~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse15 (+ c_~A~0.offset .cse16))) (< c_~max3~0 (select .cse15 (+ c_~A~0.offset .cse16 4))) (= c_~max2~0 .cse17) (not (< c_~max1~0 .cse17)) (not (< v_thread1Thread1of1ForFork2_~i~0_73 c_~N~0))))))) .cse19) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_80 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse23 (* ~M~0 4))) (let ((.cse21 (select .cse24 c_~A~0.base)) (.cse20 (select .cse22 (+ c_~A~0.offset .cse23 4)))) (or (< c_~max2~0 .cse20) (< c_~max1~0 (select .cse21 .cse7)) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max1~0 (select .cse21 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))) (< c_~max3~0 (select .cse22 (+ c_~A~0.offset .cse23))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0) (not (< c_~max3~0 .cse20))))))) .cse25) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse30 (select .cse29 c_~A~0.base))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse28 (* ~M~0 4))) (let ((.cse26 (select .cse27 (+ c_~A~0.offset .cse28 4)))) (or (< c_~max2~0 .cse26) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse27 (+ c_~A~0.offset .cse28))) (not (< c_~max3~0 .cse26)))))) (< c_~max1~0 (select .cse30 .cse7)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse31 (select .cse30 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse31 c_~max2~0) (not (< c_~max1~0 .cse31)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))) (forall ((v_thread1Thread1of1ForFork2_~i~0_80 Int)) (or (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse32 (select .cse36 c_~A~0.base))) (or (< c_~max1~0 (select .cse32 .cse7)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse35 (* ~M~0 4))) (let ((.cse33 (select .cse34 (+ c_~A~0.offset .cse35)))) (or (< .cse33 (select .cse34 (+ c_~A~0.offset .cse35 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse33)) (< (+ 2 ~M~0) c_~N~0) (= c_~max1~0 .cse33) (<= .cse33 c_~max2~0))))) (< c_~max1~0 (select .cse32 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))))))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse37 (select .cse42 c_~A~0.base))) (or (< c_~max1~0 (select .cse37 .cse7)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse38 (select .cse37 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse38)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse40 (select (store .cse42 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse41 (* ~M~0 4))) (let ((.cse39 (select .cse40 (+ c_~A~0.offset .cse41 4)))) (or (= .cse38 .cse39) (<= .cse39 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse40 (+ c_~A~0.offset .cse41))) (not (< c_~max3~0 .cse39))))))))))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_subst_3 Int)) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse48 (select .cse47 c_~A~0.base))) (let ((.cse43 (select .cse48 .cse7)) (.cse44 (select .cse48 (+ c_~A~0.offset (* 4 v_subst_3)))) (.cse45 (select (store .cse47 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse46 (* ~M~0 4))) (or (not (< c_~max1~0 .cse43)) (= .cse44 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< v_subst_3 c_~N~0)) (not (< .cse43 .cse44)) (< c_~max3~0 (select .cse45 (+ c_~A~0.offset .cse46))) (< c_~max3~0 (select .cse45 (+ c_~A~0.offset .cse46 4))) (< (+ v_subst_3 1) c_~N~0)))))) .cse19) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse49 (select .cse53 c_~A~0.base))) (or (< c_~max1~0 (select .cse49 .cse7)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse51 (select (store .cse53 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse52 (* ~M~0 4))) (let ((.cse50 (select .cse51 (+ c_~A~0.offset .cse52)))) (or (< c_~max2~0 .cse50) (< .cse50 (select .cse51 (+ c_~A~0.offset .cse52 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse50)) (< (+ 2 ~M~0) c_~N~0))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse54 (select .cse49 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse54 c_~max2~0) (not (< c_~max1~0 .cse54)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse56 (select .cse60 c_~A~0.base))) (let ((.cse55 (select .cse56 .cse7))) (or (not (< c_~max1~0 .cse55)) (< .cse55 (select .cse56 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse58 (select (store .cse60 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse59 (* ~M~0 4))) (let ((.cse57 (select .cse58 (+ c_~A~0.offset .cse59 4)))) (or (= .cse55 .cse57) (<= .cse57 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse58 (+ c_~A~0.offset .cse59))) (not (< c_~max3~0 .cse57))))))))))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse62 (select .cse67 c_~A~0.base))) (let ((.cse61 (select .cse62 .cse7))) (or (not (< c_~max1~0 .cse61)) (< .cse61 (select .cse62 (+ c_~A~0.offset (* 4 v_subst_1)))) (= .cse61 c_~max2~0) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse65 (select (store .cse67 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse66 (* ~M~0 4))) (let ((.cse64 (select .cse65 (+ c_~A~0.offset .cse66))) (.cse63 (select .cse65 (+ c_~A~0.offset .cse66 4)))) (or (< c_~max2~0 .cse63) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse64)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse64 .cse63))))))))))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse74 (select .cse73 c_~A~0.base))) (or (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse68 (select .cse74 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse71 (select (store .cse73 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse72 (* ~M~0 4))) (let ((.cse70 (select .cse71 (+ c_~A~0.offset .cse72))) (.cse69 (select .cse71 (+ c_~A~0.offset .cse72 4)))) (or (= .cse68 .cse69) (<= .cse69 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse70)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse70 .cse69)))))) (not (< c_~max1~0 .cse68)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))) (< c_~max1~0 (select .cse74 .cse7)))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse82 (select .cse81 c_~A~0.base))) (let ((.cse75 (select .cse82 .cse7))) (or (not (< c_~max1~0 .cse75)) (forall ((v_subst_2 Int)) (let ((.cse78 (select .cse82 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< (+ v_subst_2 1) c_~N~0) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse79 (select (store .cse81 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse80 (* ~M~0 4))) (let ((.cse77 (select .cse79 (+ c_~A~0.offset .cse80))) (.cse76 (select .cse79 (+ c_~A~0.offset .cse80 4)))) (or (<= .cse76 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse77)) (< (+ 2 ~M~0) c_~N~0) (= .cse76 .cse78) (not (< .cse77 .cse76)))))) (not (< v_subst_2 c_~N~0)) (not (< .cse75 .cse78)))))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse86 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse88 (select .cse86 c_~A~0.base))) (let ((.cse87 (select .cse88 .cse7))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse84 (select (store .cse86 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse85 (* ~M~0 4))) (let ((.cse83 (select .cse84 (+ c_~A~0.offset .cse85 4)))) (or (< c_~max2~0 .cse83) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse84 (+ c_~A~0.offset .cse85))) (not (< c_~max3~0 .cse83)))))) (not (< c_~max1~0 .cse87)) (< .cse87 (select .cse88 (+ c_~A~0.offset (* 4 v_subst_1)))) (= .cse87 c_~max2~0)))))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse95 (select .cse94 c_~A~0.base))) (let ((.cse89 (select .cse95 .cse7))) (or (not (< c_~max1~0 .cse89)) (forall ((v_subst_5 Int)) (let ((.cse90 (select .cse95 (+ c_~A~0.offset (* 4 v_subst_5))))) (or (< (+ v_subst_5 1) c_~N~0) (not (< .cse89 .cse90)) (not (< v_subst_5 c_~N~0)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse92 (select (store .cse94 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse93 (* ~M~0 4))) (let ((.cse91 (select .cse92 (+ c_~A~0.offset .cse93)))) (or (< .cse91 (select .cse92 (+ c_~A~0.offset .cse93 4))) (= .cse91 .cse90) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse91)) (< (+ 2 ~M~0) c_~N~0) (<= .cse91 c_~max2~0))))))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse102 (select .cse99 c_~A~0.base))) (let ((.cse100 (select .cse102 .cse7))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse97 (select (store .cse99 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse98 (* ~M~0 4))) (let ((.cse96 (select .cse97 (+ c_~A~0.offset .cse98 4)))) (or (< c_~max2~0 .cse96) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse97 (+ c_~A~0.offset .cse98))) (not (< c_~max3~0 .cse96)))))) (not (< c_~max1~0 .cse100)) (forall ((v_subst_3 Int)) (let ((.cse101 (select .cse102 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (= .cse101 c_~max2~0) (not (< v_subst_3 c_~N~0)) (not (< .cse100 .cse101)) (< (+ v_subst_3 1) c_~N~0))))))))) (or .cse103 (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_subst_1 Int)) (let ((.cse108 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse105 (select .cse108 c_~A~0.base))) (let ((.cse104 (select .cse105 .cse7)) (.cse106 (select (store .cse108 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse107 (* ~M~0 4))) (or (not (< v_subst_1 c_~N~0)) (not (< c_~max1~0 .cse104)) (= .cse104 c_~max3~0) (< .cse104 (select .cse105 (+ c_~A~0.offset (* 4 v_subst_1)))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (< c_~max3~0 (select .cse106 (+ c_~A~0.offset .cse107))) (< c_~max3~0 (select .cse106 (+ c_~A~0.offset .cse107 4))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse111 (select .cse116 c_~A~0.base))) (let ((.cse109 (select .cse111 .cse7))) (or (not (< c_~max1~0 .cse109)) (forall ((v_subst_3 Int)) (let ((.cse110 (select .cse111 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (= .cse110 c_~max2~0) (not (< v_subst_3 c_~N~0)) (not (< .cse109 .cse110)) (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse114 (select (store .cse116 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse115 (* ~M~0 4))) (let ((.cse113 (select .cse114 (+ c_~A~0.offset .cse115))) (.cse112 (select .cse114 (+ c_~A~0.offset .cse115 4)))) (or (< c_~max2~0 .cse112) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse113)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse113 .cse112))))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse123 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse119 (select .cse123 c_~A~0.base))) (let ((.cse117 (select .cse119 .cse7))) (or (not (< c_~max1~0 .cse117)) (forall ((v_subst_3 Int)) (let ((.cse118 (select .cse119 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (= .cse118 c_~max2~0) (not (< v_subst_3 c_~N~0)) (not (< .cse117 .cse118)) (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse121 (select (store .cse123 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse122 (* ~M~0 4))) (let ((.cse120 (select .cse121 (+ c_~A~0.offset .cse122)))) (or (< c_~max2~0 .cse120) (< .cse120 (select .cse121 (+ c_~A~0.offset .cse122 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse120)) (< (+ 2 ~M~0) c_~N~0)))))))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_subst_4 Int)) (let ((.cse129 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse128 (select .cse129 c_~A~0.base))) (let ((.cse124 (select .cse128 .cse7)) (.cse126 (select (store .cse129 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse127 (* ~M~0 4)) (.cse125 (select .cse128 (+ c_~A~0.offset (* 4 v_subst_4))))) (or (not (< c_~max1~0 .cse124)) (< (+ v_subst_4 1) c_~N~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse124 .cse125)) (not (< v_subst_4 c_~N~0)) (< c_~max3~0 (select .cse126 (+ c_~A~0.offset .cse127))) (< c_~max3~0 (select .cse126 (+ c_~A~0.offset .cse127 4))) (= .cse125 c_~max3~0)))))) .cse103) (forall ((v_thread1Thread1of1ForFork2_~i~0_80 Int)) (or (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse133 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse134 (select .cse133 c_~A~0.base))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse131 (select (store .cse133 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse132 (* ~M~0 4))) (let ((.cse130 (select .cse131 (+ c_~A~0.offset .cse132 4)))) (or (<= .cse130 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (= c_~max1~0 .cse130) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse131 (+ c_~A~0.offset .cse132))) (not (< c_~max3~0 .cse130)))))) (< c_~max1~0 (select .cse134 .cse7)) (< c_~max1~0 (select .cse134 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse140 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse141 (select .cse140 c_~A~0.base))) (let ((.cse135 (select .cse141 .cse7))) (or (not (< c_~max1~0 .cse135)) (forall ((v_subst_6 Int)) (let ((.cse137 (select .cse141 (+ c_~A~0.offset (* 4 v_subst_6))))) (or (not (< v_subst_6 c_~N~0)) (< (+ v_subst_6 1) c_~N~0) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse138 (select (store .cse140 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse139 (* ~M~0 4))) (let ((.cse136 (select .cse138 (+ c_~A~0.offset .cse139 4)))) (or (<= .cse136 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse136 .cse137) (< c_~max3~0 (select .cse138 (+ c_~A~0.offset .cse139))) (not (< c_~max3~0 .cse136)))))) (not (< .cse135 .cse137)))))))))) (or .cse25 (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_80 Int)) (let ((.cse146 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse143 (select (store .cse146 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse144 (* ~M~0 4))) (let ((.cse142 (select .cse143 (+ c_~A~0.offset .cse144))) (.cse145 (select .cse146 c_~A~0.base))) (or (< c_~max2~0 .cse142) (< .cse142 (select .cse143 (+ c_~A~0.offset .cse144 4))) (< c_~max1~0 (select .cse145 .cse7)) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse142)) (< (+ 2 ~M~0) c_~N~0) (< c_~max1~0 (select .cse145 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0))))))) (or (and (or .cse25 .cse19) (or (= c_~max1~0 c_~max3~0) .cse103)) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_80 Int)) (let ((.cse150 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse147 (select .cse150 c_~A~0.base)) (.cse148 (select (store .cse150 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse149 (* ~M~0 4))) (or (< c_~max1~0 (select .cse147 .cse7)) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max1~0 (select .cse147 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))) (< c_~max3~0 (select .cse148 (+ c_~A~0.offset .cse149))) (< c_~max3~0 (select .cse148 (+ c_~A~0.offset .cse149 4))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0)))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse156 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse151 (select .cse156 c_~A~0.base))) (or (< c_~max1~0 (select .cse151 .cse7)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse154 (select (store .cse156 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse155 (* ~M~0 4))) (let ((.cse153 (select .cse154 (+ c_~A~0.offset .cse155))) (.cse152 (select .cse154 (+ c_~A~0.offset .cse155 4)))) (or (< c_~max2~0 .cse152) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse153)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse153 .cse152)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse157 (select .cse151 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse157 c_~max2~0) (not (< c_~max1~0 .cse157)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_subst_1 Int)) (let ((.cse162 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse159 (select .cse162 c_~A~0.base))) (let ((.cse158 (select .cse159 .cse7)) (.cse160 (select (store .cse162 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse161 (* ~M~0 4))) (or (not (< v_subst_1 c_~N~0)) (not (< c_~max1~0 .cse158)) (< .cse158 (select .cse159 (+ c_~A~0.offset (* 4 v_subst_1)))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse158 c_~max2~0) (< (+ v_subst_1 1) c_~N~0) (< c_~max3~0 (select .cse160 (+ c_~A~0.offset .cse161))) (< c_~max3~0 (select .cse160 (+ c_~A~0.offset .cse161 4)))))))) .cse19) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse168 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse164 (select .cse168 c_~A~0.base))) (let ((.cse163 (select .cse164 .cse7))) (or (not (< c_~max1~0 .cse163)) (< .cse163 (select .cse164 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse166 (select (store .cse168 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse167 (* ~M~0 4))) (let ((.cse165 (select .cse166 (+ c_~A~0.offset .cse167)))) (or (< .cse165 (select .cse166 (+ c_~A~0.offset .cse167 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse165)) (< (+ 2 ~M~0) c_~N~0) (= .cse163 .cse165) (<= .cse165 c_~max2~0)))))))))))) (or .cse103 (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_72 Int)) (let ((.cse173 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse169 (select .cse173 c_~A~0.base))) (let ((.cse170 (select .cse169 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_72 4)))) (.cse171 (select (store .cse173 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse172 (* ~M~0 4))) (or (< c_~max1~0 (select .cse169 .cse7)) (= c_~max3~0 .cse170) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (+ v_thread1Thread1of1ForFork2_~i~0_72 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_72 c_~N~0)) (< c_~max3~0 (select .cse171 (+ c_~A~0.offset .cse172))) (not (< c_~max1~0 .cse170)) (< c_~max3~0 (select .cse171 (+ c_~A~0.offset .cse172 4))))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse179 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse175 (select .cse179 c_~A~0.base))) (let ((.cse174 (select .cse175 .cse7))) (or (not (< c_~max1~0 .cse174)) (< .cse174 (select .cse175 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse177 (select (store .cse179 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse178 (* ~M~0 4))) (let ((.cse176 (select .cse177 (+ c_~A~0.offset .cse178)))) (or (< c_~max2~0 .cse176) (< .cse176 (select .cse177 (+ c_~A~0.offset .cse178 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse176)) (< (+ 2 ~M~0) c_~N~0))))) (= .cse174 c_~max2~0)))))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_thread1Thread1of1ForFork2_~i~0_80 Int)) (or (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse185 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse180 (select .cse185 c_~A~0.base))) (or (< c_~max1~0 (select .cse180 .cse7)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse183 (select (store .cse185 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse184 (* ~M~0 4))) (let ((.cse182 (select .cse183 (+ c_~A~0.offset .cse184))) (.cse181 (select .cse183 (+ c_~A~0.offset .cse184 4)))) (or (<= .cse181 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (= c_~max1~0 .cse181) (not (< c_~max3~0 .cse182)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse182 .cse181)))))) (< c_~max1~0 (select .cse180 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))))))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0))) (or .cse25 (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_80 Int)) (let ((.cse191 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse189 (select (store .cse191 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse190 (* ~M~0 4))) (let ((.cse187 (select .cse191 c_~A~0.base)) (.cse188 (select .cse189 (+ c_~A~0.offset .cse190))) (.cse186 (select .cse189 (+ c_~A~0.offset .cse190 4)))) (or (< c_~max2~0 .cse186) (< c_~max1~0 (select .cse187 .cse7)) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse188)) (< (+ 2 ~M~0) c_~N~0) (< c_~max1~0 (select .cse187 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))) (not (< .cse188 .cse186)) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0))))))))) is different from false [2022-11-20 16:30:19,343 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_~max1~0 c_~max2~0)) (.cse73 (< c_~max2~0 c_~max3~0)) (.cse12 (<= c_~max3~0 c_~max2~0))) (and (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_80 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse4 (* ~M~0 4))) (let ((.cse0 (select .cse5 c_~A~0.base)) (.cse2 (select .cse3 (+ c_~A~0.offset .cse4))) (.cse1 (select .cse3 (+ c_~A~0.offset .cse4 4)))) (or (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< c_~max2~0 .cse1) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse2)) (< (+ 2 ~M~0) c_~N~0) (< c_~max1~0 (select .cse0 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))) (not (< .cse2 .cse1)) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0)))))) .cse6) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_subst_1 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse8 (select .cse11 c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset)) (.cse9 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse10 (* ~M~0 4))) (or (not (< v_subst_1 c_~N~0)) (not (< c_~max1~0 .cse7)) (= .cse7 c_~max3~0) (< .cse7 (select .cse8 (+ c_~A~0.offset (* 4 v_subst_1)))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (< c_~max3~0 (select .cse9 (+ c_~A~0.offset .cse10))) (< c_~max3~0 (select .cse9 (+ c_~A~0.offset .cse10 4)))))))) .cse12) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse13 (select .cse18 c_~A~0.base))) (or (< c_~max1~0 (select .cse13 c_~A~0.offset)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse16 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse17 (* ~M~0 4))) (let ((.cse15 (select .cse16 (+ c_~A~0.offset .cse17))) (.cse14 (select .cse16 (+ c_~A~0.offset .cse17 4)))) (or (< c_~max2~0 .cse14) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse15)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse15 .cse14)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse19 (select .cse13 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse19 c_~max2~0) (not (< c_~max1~0 .cse19)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse26 (select .cse23 c_~A~0.base))) (let ((.cse25 (select .cse26 c_~A~0.offset))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse21 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse22 (* ~M~0 4))) (let ((.cse20 (select .cse21 (+ c_~A~0.offset .cse22 4)))) (or (< c_~max2~0 .cse20) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse21 (+ c_~A~0.offset .cse22))) (not (< c_~max3~0 .cse20)))))) (forall ((v_subst_3 Int)) (let ((.cse24 (select .cse26 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (= .cse24 c_~max2~0) (not (< .cse25 .cse24)) (not (< v_subst_3 c_~N~0)) (< (+ v_subst_3 1) c_~N~0)))) (not (< c_~max1~0 .cse25))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse32 (select .cse31 c_~A~0.base))) (let ((.cse27 (select .cse32 c_~A~0.offset))) (or (not (< c_~max1~0 .cse27)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse29 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse30 (* ~M~0 4))) (let ((.cse28 (select .cse29 (+ c_~A~0.offset .cse30)))) (or (< c_~max2~0 .cse28) (< .cse28 (select .cse29 (+ c_~A~0.offset .cse30 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse28)) (< (+ 2 ~M~0) c_~N~0))))) (< .cse27 (select .cse32 (+ c_~A~0.offset (* 4 v_subst_1)))) (= .cse27 c_~max2~0)))))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse35 (select .cse40 c_~A~0.base))) (let ((.cse34 (select .cse35 c_~A~0.offset))) (or (forall ((v_subst_3 Int)) (let ((.cse33 (select .cse35 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (= .cse33 c_~max2~0) (not (< .cse34 .cse33)) (not (< v_subst_3 c_~N~0)) (< (+ v_subst_3 1) c_~N~0)))) (not (< c_~max1~0 .cse34)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse38 (select (store .cse40 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse39 (* ~M~0 4))) (let ((.cse37 (select .cse38 (+ c_~A~0.offset .cse39))) (.cse36 (select .cse38 (+ c_~A~0.offset .cse39 4)))) (or (< c_~max2~0 .cse36) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse37)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse37 .cse36))))))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse47 (select .cse46 c_~A~0.base))) (let ((.cse43 (select .cse47 c_~A~0.offset))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse44 (select (store .cse46 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse45 (* ~M~0 4))) (let ((.cse42 (select .cse44 (+ c_~A~0.offset .cse45))) (.cse41 (select .cse44 (+ c_~A~0.offset .cse45 4)))) (or (<= .cse41 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse42)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse42 .cse41)) (= .cse43 .cse41))))) (not (< c_~max1~0 .cse43)) (< .cse43 (select .cse47 (+ c_~A~0.offset (* 4 v_subst_1))))))))) (< (+ v_subst_1 1) c_~N~0))) (forall ((v_thread1Thread1of1ForFork2_~i~0_80 Int)) (or (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse48 (select .cse53 c_~A~0.base))) (or (< c_~max1~0 (select .cse48 c_~A~0.offset)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse51 (select (store .cse53 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse52 (* ~M~0 4))) (let ((.cse50 (select .cse51 (+ c_~A~0.offset .cse52))) (.cse49 (select .cse51 (+ c_~A~0.offset .cse52 4)))) (or (<= .cse49 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (= c_~max1~0 .cse49) (not (< c_~max3~0 .cse50)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse50 .cse49)))))) (< c_~max1~0 (select .cse48 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))))))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse60 (select .cse59 c_~A~0.base))) (let ((.cse54 (select .cse60 c_~A~0.offset))) (or (not (< c_~max1~0 .cse54)) (forall ((v_subst_5 Int)) (let ((.cse55 (select .cse60 (+ c_~A~0.offset (* 4 v_subst_5))))) (or (not (< .cse54 .cse55)) (< (+ v_subst_5 1) c_~N~0) (not (< v_subst_5 c_~N~0)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse57 (select (store .cse59 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse58 (* ~M~0 4))) (let ((.cse56 (select .cse57 (+ c_~A~0.offset .cse58)))) (or (< .cse56 (select .cse57 (+ c_~A~0.offset .cse58 4))) (= .cse56 .cse55) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse56)) (< (+ 2 ~M~0) c_~N~0) (<= .cse56 c_~max2~0))))))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse61 (select .cse65 c_~A~0.base))) (or (< c_~max1~0 (select .cse61 c_~A~0.offset)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse63 (select (store .cse65 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse64 (* ~M~0 4))) (let ((.cse62 (select .cse63 (+ c_~A~0.offset .cse64)))) (or (< c_~max2~0 .cse62) (< .cse62 (select .cse63 (+ c_~A~0.offset .cse64 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse62)) (< (+ 2 ~M~0) c_~N~0))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse66 (select .cse61 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse66 c_~max2~0) (not (< c_~max1~0 .cse66)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse68 (select .cse72 c_~A~0.base))) (let ((.cse67 (select .cse68 c_~A~0.offset))) (or (not (< c_~max1~0 .cse67)) (< .cse67 (select .cse68 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse70 (select (store .cse72 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse71 (* ~M~0 4))) (let ((.cse69 (select .cse70 (+ c_~A~0.offset .cse71)))) (or (< .cse69 (select .cse70 (+ c_~A~0.offset .cse71 4))) (= .cse67 .cse69) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse69)) (< (+ 2 ~M~0) c_~N~0) (<= .cse69 c_~max2~0)))))))))) (< (+ v_subst_1 1) c_~N~0))) (or .cse73 (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_subst_1 Int)) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse75 (select .cse78 c_~A~0.base))) (let ((.cse74 (select .cse75 c_~A~0.offset)) (.cse76 (select (store .cse78 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse77 (* ~M~0 4))) (or (not (< v_subst_1 c_~N~0)) (not (< c_~max1~0 .cse74)) (< .cse74 (select .cse75 (+ c_~A~0.offset (* 4 v_subst_1)))) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (+ v_subst_1 1) c_~N~0) (= .cse74 c_~max2~0) (< c_~max3~0 (select .cse76 (+ c_~A~0.offset .cse77))) (< c_~max3~0 (select .cse76 (+ c_~A~0.offset .cse77 4))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse83 (select .cse82 c_~A~0.base))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse80 (select (store .cse82 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse81 (* ~M~0 4))) (let ((.cse79 (select .cse80 (+ c_~A~0.offset .cse81 4)))) (or (< c_~max2~0 .cse79) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse80 (+ c_~A~0.offset .cse81))) (not (< c_~max3~0 .cse79)))))) (< c_~max1~0 (select .cse83 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse84 (select .cse83 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (= .cse84 c_~max2~0) (not (< c_~max1~0 .cse84)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))) (forall ((v_thread1Thread1of1ForFork2_~i~0_80 Int)) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse85 (select .cse89 c_~A~0.base))) (or (< c_~max1~0 (select .cse85 c_~A~0.offset)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse87 (select (store .cse89 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse88 (* ~M~0 4))) (let ((.cse86 (select .cse87 (+ c_~A~0.offset .cse88)))) (or (< .cse86 (select .cse87 (+ c_~A~0.offset .cse88 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse86)) (< (+ 2 ~M~0) c_~N~0) (= c_~max1~0 .cse86) (<= .cse86 c_~max2~0))))) (< c_~max1~0 (select .cse85 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))))))) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0))) (forall ((v_thread1Thread1of1ForFork2_~i~0_80 Int)) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse90 (select .cse94 c_~A~0.base))) (or (< c_~max1~0 (select .cse90 c_~A~0.offset)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse92 (select (store .cse94 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse93 (* ~M~0 4))) (let ((.cse91 (select .cse92 (+ c_~A~0.offset .cse93 4)))) (or (<= .cse91 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (= c_~max1~0 .cse91) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse92 (+ c_~A~0.offset .cse93))) (not (< c_~max3~0 .cse91)))))) (< c_~max1~0 (select .cse90 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))))))) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse101 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse95 (select .cse101 c_~A~0.base))) (or (< c_~max1~0 (select .cse95 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse96 (select .cse95 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse99 (select (store .cse101 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse100 (* ~M~0 4))) (let ((.cse98 (select .cse99 (+ c_~A~0.offset .cse100))) (.cse97 (select .cse99 (+ c_~A~0.offset .cse100 4)))) (or (= .cse96 .cse97) (<= .cse97 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse98)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse98 .cse97)))))) (not (< c_~max1~0 .cse96)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse108 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse109 (select .cse108 c_~A~0.base))) (let ((.cse102 (select .cse109 c_~A~0.offset))) (or (not (< c_~max1~0 .cse102)) (forall ((v_subst_2 Int)) (let ((.cse103 (select .cse109 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (not (< .cse102 .cse103)) (< (+ v_subst_2 1) c_~N~0) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse106 (select (store .cse108 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse107 (* ~M~0 4))) (let ((.cse105 (select .cse106 (+ c_~A~0.offset .cse107))) (.cse104 (select .cse106 (+ c_~A~0.offset .cse107 4)))) (or (<= .cse104 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse105)) (< (+ 2 ~M~0) c_~N~0) (= .cse104 .cse103) (not (< .cse105 .cse104)))))) (not (< v_subst_2 c_~N~0)))))))))) (or .cse12 (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_subst_4 Int)) (let ((.cse115 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse114 (select .cse115 c_~A~0.base))) (let ((.cse110 (select .cse114 c_~A~0.offset)) (.cse112 (select (store .cse115 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse113 (* ~M~0 4)) (.cse111 (select .cse114 (+ c_~A~0.offset (* 4 v_subst_4))))) (or (< (+ v_subst_4 1) c_~N~0) (not (< c_~max1~0 .cse110)) (not (< .cse110 .cse111)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< v_subst_4 c_~N~0)) (< c_~max3~0 (select .cse112 (+ c_~A~0.offset .cse113))) (< c_~max3~0 (select .cse112 (+ c_~A~0.offset .cse113 4))) (= .cse111 c_~max3~0))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse122 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse118 (select .cse122 c_~A~0.base))) (let ((.cse117 (select .cse118 c_~A~0.offset))) (or (forall ((v_subst_3 Int)) (let ((.cse116 (select .cse118 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (= .cse116 c_~max2~0) (not (< .cse117 .cse116)) (not (< v_subst_3 c_~N~0)) (< (+ v_subst_3 1) c_~N~0)))) (not (< c_~max1~0 .cse117)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse120 (select (store .cse122 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse121 (* ~M~0 4))) (let ((.cse119 (select .cse120 (+ c_~A~0.offset .cse121)))) (or (< c_~max2~0 .cse119) (< .cse119 (select .cse120 (+ c_~A~0.offset .cse121 4))) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse119)) (< (+ 2 ~M~0) c_~N~0)))))))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_80 Int)) (let ((.cse127 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse125 (select (store .cse127 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse126 (* ~M~0 4))) (let ((.cse123 (select .cse127 c_~A~0.base)) (.cse124 (select .cse125 (+ c_~A~0.offset .cse126 4)))) (or (< c_~max1~0 (select .cse123 c_~A~0.offset)) (< c_~max2~0 .cse124) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max1~0 (select .cse123 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))) (< c_~max3~0 (select .cse125 (+ c_~A~0.offset .cse126))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0) (not (< c_~max3~0 .cse124))))))) .cse6) (or (and (or .cse6 .cse73) (or (= c_~max1~0 c_~max3~0) .cse12)) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_80 Int)) (let ((.cse131 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse128 (select .cse131 c_~A~0.base)) (.cse129 (select (store .cse131 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse130 (* ~M~0 4))) (or (< c_~max1~0 (select .cse128 c_~A~0.offset)) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max1~0 (select .cse128 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))) (< c_~max3~0 (select .cse129 (+ c_~A~0.offset .cse130))) (< c_~max3~0 (select .cse129 (+ c_~A~0.offset .cse130 4))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0)))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_73 Int)) (let ((.cse136 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse132 (select .cse136 c_~A~0.base))) (let ((.cse133 (select (store .cse136 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse134 (* ~M~0 4)) (.cse135 (select .cse132 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_73 4))))) (or (< c_~max1~0 (select .cse132 c_~A~0.offset)) (< (+ v_thread1Thread1of1ForFork2_~i~0_73 1) c_~N~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse133 (+ c_~A~0.offset .cse134))) (< c_~max3~0 (select .cse133 (+ c_~A~0.offset .cse134 4))) (= c_~max2~0 .cse135) (not (< c_~max1~0 .cse135)) (not (< v_thread1Thread1of1ForFork2_~i~0_73 c_~N~0))))))) .cse73) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse140 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse142 (select .cse140 c_~A~0.base))) (let ((.cse141 (select .cse142 c_~A~0.offset))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse138 (select (store .cse140 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse139 (* ~M~0 4))) (let ((.cse137 (select .cse138 (+ c_~A~0.offset .cse139 4)))) (or (< c_~max2~0 .cse137) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse138 (+ c_~A~0.offset .cse139))) (not (< c_~max3~0 .cse137)))))) (not (< c_~max1~0 .cse141)) (< .cse141 (select .cse142 (+ c_~A~0.offset (* 4 v_subst_1)))) (= .cse141 c_~max2~0)))))))) (forall ((v_subst_1 Int)) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse149 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse144 (select .cse149 c_~A~0.base))) (let ((.cse143 (select .cse144 c_~A~0.offset))) (or (not (< c_~max1~0 .cse143)) (< .cse143 (select .cse144 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse147 (select (store .cse149 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse148 (* ~M~0 4))) (let ((.cse146 (select .cse147 (+ c_~A~0.offset .cse148))) (.cse145 (select .cse147 (+ c_~A~0.offset .cse148 4)))) (or (< c_~max2~0 .cse145) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse146)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse146 .cse145)))))) (= .cse143 c_~max2~0)))))) (not (< v_subst_1 c_~N~0)) (< (+ v_subst_1 1) c_~N~0))) (or .cse6 (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_80 Int)) (let ((.cse154 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse152 (select (store .cse154 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse153 (* ~M~0 4))) (let ((.cse150 (select .cse152 (+ c_~A~0.offset .cse153))) (.cse151 (select .cse154 c_~A~0.base))) (or (< c_~max2~0 .cse150) (< c_~max1~0 (select .cse151 c_~A~0.offset)) (< .cse150 (select .cse152 (+ c_~A~0.offset .cse153 4))) (not (< v_thread1Thread1of1ForFork2_~i~0_80 c_~N~0)) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse150)) (< (+ 2 ~M~0) c_~N~0) (< c_~max1~0 (select .cse151 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_80 4)))) (< (+ v_thread1Thread1of1ForFork2_~i~0_80 1) c_~N~0))))))) (forall ((v_subst_1 Int)) (or (not (< v_subst_1 c_~N~0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse160 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse156 (select .cse160 c_~A~0.base))) (let ((.cse155 (select .cse156 c_~A~0.offset))) (or (not (< c_~max1~0 .cse155)) (< .cse155 (select .cse156 (+ c_~A~0.offset (* 4 v_subst_1)))) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse158 (select (store .cse160 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse159 (* ~M~0 4))) (let ((.cse157 (select .cse158 (+ c_~A~0.offset .cse159 4)))) (or (<= .cse157 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse158 (+ c_~A~0.offset .cse159))) (= .cse155 .cse157) (not (< c_~max3~0 .cse157))))))))))) (< (+ v_subst_1 1) c_~N~0))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_subst_3 Int)) (let ((.cse165 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse166 (select .cse165 c_~A~0.base))) (let ((.cse162 (select .cse166 c_~A~0.offset)) (.cse161 (select .cse166 (+ c_~A~0.offset (* 4 v_subst_3)))) (.cse163 (select (store .cse165 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse164 (* ~M~0 4))) (or (= .cse161 c_~max2~0) (not (< c_~max1~0 .cse162)) (not (< .cse162 .cse161)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< v_subst_3 c_~N~0)) (< c_~max3~0 (select .cse163 (+ c_~A~0.offset .cse164))) (< c_~max3~0 (select .cse163 (+ c_~A~0.offset .cse164 4))) (< (+ v_subst_3 1) c_~N~0)))))) .cse73) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse172 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse173 (select .cse172 c_~A~0.base))) (let ((.cse167 (select .cse173 c_~A~0.offset))) (or (not (< c_~max1~0 .cse167)) (forall ((v_subst_6 Int)) (let ((.cse169 (select .cse173 (+ c_~A~0.offset (* 4 v_subst_6))))) (or (not (< v_subst_6 c_~N~0)) (< (+ v_subst_6 1) c_~N~0) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse170 (select (store .cse172 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse171 (* ~M~0 4))) (let ((.cse168 (select .cse170 (+ c_~A~0.offset .cse171 4)))) (or (<= .cse168 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse168 .cse169) (< c_~max3~0 (select .cse170 (+ c_~A~0.offset .cse171))) (not (< c_~max3~0 .cse168)))))) (not (< .cse167 .cse169)))))))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (~M~0 Int) (v_thread1Thread1of1ForFork2_~i~0_72 Int)) (let ((.cse178 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse174 (select .cse178 c_~A~0.base))) (let ((.cse175 (select .cse174 (+ c_~A~0.offset (* v_thread1Thread1of1ForFork2_~i~0_72 4)))) (.cse176 (select (store .cse178 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse177 (* ~M~0 4))) (or (< c_~max1~0 (select .cse174 c_~A~0.offset)) (= c_~max3~0 .cse175) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (+ v_thread1Thread1of1ForFork2_~i~0_72 1) c_~N~0) (not (< v_thread1Thread1of1ForFork2_~i~0_72 c_~N~0)) (< c_~max3~0 (select .cse176 (+ c_~A~0.offset .cse177))) (not (< c_~max1~0 .cse175)) (< c_~max3~0 (select .cse176 (+ c_~A~0.offset .cse177 4)))))))) .cse12) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse184 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse179 (select .cse184 c_~A~0.base))) (or (< c_~max1~0 (select .cse179 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse180 (select .cse179 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse180)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0)) (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse182 (select (store .cse184 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse183 (* ~M~0 4))) (let ((.cse181 (select .cse182 (+ c_~A~0.offset .cse183 4)))) (or (= .cse180 .cse181) (<= .cse181 c_~max2~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< c_~max3~0 (select .cse182 (+ c_~A~0.offset .cse183))) (not (< c_~max3~0 .cse181))))))))))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse190 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626))) (let ((.cse185 (select .cse190 c_~A~0.base))) (or (< c_~max1~0 (select .cse185 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse189 (select .cse185 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (forall ((v_ArrVal_627 (Array Int Int)) (~M~0 Int)) (let ((.cse187 (select (store .cse190 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~A~0.base)) (.cse188 (* ~M~0 4))) (let ((.cse186 (select .cse187 (+ c_~A~0.offset .cse188)))) (or (< .cse186 (select .cse187 (+ c_~A~0.offset .cse188 4))) (= .cse189 .cse186) (not (< (+ ~M~0 1) c_~N~0)) (not (< c_~max3~0 .cse186)) (< (+ 2 ~M~0) c_~N~0) (<= .cse186 c_~max2~0))))) (not (< c_~max1~0 .cse189)) (< (+ thread1Thread1of1ForFork2_~i~0 1) c_~N~0) (not (< thread1Thread1of1ForFork2_~i~0 c_~N~0))))))))))) is different from false