./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/running_example.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/running_example.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f --- 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-8393723 [2022-11-18 19:55:22,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:55:22,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:55:22,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:55:22,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:55:22,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:55:22,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:55:22,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:55:22,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:55:22,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:55:22,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:55:22,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:55:22,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:55:22,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:55:22,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:55:22,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:55:22,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:55:22,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:55:22,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:55:22,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:55:22,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:55:22,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:55:22,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:55:22,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:55:22,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:55:22,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:55:22,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:55:22,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:55:22,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:55:22,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:55:22,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:55:22,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:55:22,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:55:22,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:55:22,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:55:22,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:55:22,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:55:22,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:55:22,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:55:22,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:55:22,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:55:22,323 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:55:22,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:55:22,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:55:22,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:55:22,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:55:22,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:55:22,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:55:22,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:55:22,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:55:22,347 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:55:22,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:55:22,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:55:22,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:55:22,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:55:22,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:55:22,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:55:22,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:55:22,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:55:22,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:55:22,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:55:22,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:55:22,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:55:22,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:55:22,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:55:22,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:55:22,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:22,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:55:22,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:55:22,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:55:22,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:55:22,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:55:22,352 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:55:22,353 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:55:22,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:55:22,353 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_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/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_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f [2022-11-18 19:55:22,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:55:22,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:55:22,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:55:22,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:55:22,631 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:55:22,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/heap-data/running_example.i [2022-11-18 19:55:22,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/data/cdb7a2381/e5cc0b216f87425482409b310ed9adc4/FLAG11f529ba0 [2022-11-18 19:55:23,336 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:55:23,336 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/sv-benchmarks/c/heap-data/running_example.i [2022-11-18 19:55:23,347 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/data/cdb7a2381/e5cc0b216f87425482409b310ed9adc4/FLAG11f529ba0 [2022-11-18 19:55:23,609 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/data/cdb7a2381/e5cc0b216f87425482409b310ed9adc4 [2022-11-18 19:55:23,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:55:23,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:55:23,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:23,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:55:23,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:55:23,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:23" (1/1) ... [2022-11-18 19:55:23,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e817cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:23, skipping insertion in model container [2022-11-18 19:55:23,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:23" (1/1) ... [2022-11-18 19:55:23,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:55:23,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:55:24,040 WARN L234 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_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/sv-benchmarks/c/heap-data/running_example.i[23610,23623] [2022-11-18 19:55:24,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:24,054 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:55:24,090 WARN L234 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_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/sv-benchmarks/c/heap-data/running_example.i[23610,23623] [2022-11-18 19:55:24,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:24,115 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:55:24,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24 WrapperNode [2022-11-18 19:55:24,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:24,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:24,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:55:24,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:55:24,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,169 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2022-11-18 19:55:24,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:24,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:55:24,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:55:24,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:55:24,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,214 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:55:24,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:55:24,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:55:24,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:55:24,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (1/1) ... [2022-11-18 19:55:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:24,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:24,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:55:24,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:55:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:55:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:55:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:55:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:55:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:55:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:55:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:55:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:55:24,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:55:24,473 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:55:24,476 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:55:24,755 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:55:24,767 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:55:24,767 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 19:55:24,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:24 BoogieIcfgContainer [2022-11-18 19:55:24,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:55:24,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:55:24,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:55:24,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:55:24,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:55:23" (1/3) ... [2022-11-18 19:55:24,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223e1548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:55:24, skipping insertion in model container [2022-11-18 19:55:24,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:24" (2/3) ... [2022-11-18 19:55:24,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223e1548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:55:24, skipping insertion in model container [2022-11-18 19:55:24,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:24" (3/3) ... [2022-11-18 19:55:24,782 INFO L112 eAbstractionObserver]: Analyzing ICFG running_example.i [2022-11-18 19:55:24,802 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:55:24,802 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:55:24,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:55:24,889 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17164f96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:55:24,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:55:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 19:55:24,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:24,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:24,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash 538476752, now seen corresponding path program 1 times [2022-11-18 19:55:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:24,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308875282] [2022-11-18 19:55:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:25,147 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-18 19:55:25,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:25,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308875282] [2022-11-18 19:55:25,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308875282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:25,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:25,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693550371] [2022-11-18 19:55:25,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:55:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:25,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:55:25,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:55:25,198 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-18 19:55:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:25,216 INFO L93 Difference]: Finished difference Result 27 states and 43 transitions. [2022-11-18 19:55:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:55:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 19:55:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:25,227 INFO L225 Difference]: With dead ends: 27 [2022-11-18 19:55:25,228 INFO L226 Difference]: Without dead ends: 15 [2022-11-18 19:55:25,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:55:25,235 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:25,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:55:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-18 19:55:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-18 19:55:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-11-18 19:55:25,295 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 8 [2022-11-18 19:55:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:25,295 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-11-18 19:55:25,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-18 19:55:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-11-18 19:55:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:55:25,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:25,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:25,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:55:25,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1314112902, now seen corresponding path program 1 times [2022-11-18 19:55:25,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:25,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975123909] [2022-11-18 19:55:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:25,625 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-18 19:55:25,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:25,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975123909] [2022-11-18 19:55:25,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975123909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:25,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:25,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:55:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594822601] [2022-11-18 19:55:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:25,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:55:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:55:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:55:25,630 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:25,776 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-11-18 19:55:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:55:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 19:55:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:25,779 INFO L225 Difference]: With dead ends: 37 [2022-11-18 19:55:25,779 INFO L226 Difference]: Without dead ends: 28 [2022-11-18 19:55:25,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:55:25,781 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:25,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 60 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-18 19:55:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-11-18 19:55:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-11-18 19:55:25,789 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2022-11-18 19:55:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:25,790 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-11-18 19:55:25,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-11-18 19:55:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:55:25,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:25,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:25,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:55:25,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1215852288, now seen corresponding path program 1 times [2022-11-18 19:55:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:25,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235062166] [2022-11-18 19:55:25,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:25,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:26,494 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-18 19:55:26,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:26,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235062166] [2022-11-18 19:55:26,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235062166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:26,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202871819] [2022-11-18 19:55:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:26,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:26,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:26,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:55:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:26,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 19:55:26,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:26,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:55:26,702 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 11 treesize of output 7 [2022-11-18 19:55:26,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:26,833 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-18 19:55:26,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:26,858 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 14 treesize of output 16 [2022-11-18 19:55:26,877 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:55:26,878 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 11 treesize of output 11 [2022-11-18 19:55:26,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:26,999 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-18 19:55:26,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:27,185 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-18 19:55:27,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202871819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:27,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:27,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-18 19:55:27,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072938716] [2022-11-18 19:55:27,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:27,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:55:27,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:27,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:55:27,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:55:27,192 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-18 19:55:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:27,486 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-11-18 19:55:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:55:27,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 19:55:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:27,488 INFO L225 Difference]: With dead ends: 69 [2022-11-18 19:55:27,488 INFO L226 Difference]: Without dead ends: 67 [2022-11-18 19:55:27,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:55:27,490 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 86 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:27,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 88 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2022-11-18 19:55:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-18 19:55:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 36. [2022-11-18 19:55:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-11-18 19:55:27,501 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 14 [2022-11-18 19:55:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:27,501 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-11-18 19:55:27,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-18 19:55:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-11-18 19:55:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:55:27,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:27,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:27,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:27,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-18 19:55:27,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1215850366, now seen corresponding path program 1 times [2022-11-18 19:55:27,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:27,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159304344] [2022-11-18 19:55:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:27,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:27,974 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-18 19:55:27,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:27,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159304344] [2022-11-18 19:55:27,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159304344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:27,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896280418] [2022-11-18 19:55:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:27,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:27,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:28,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:55:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:28,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 19:55:28,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:28,103 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 11 treesize of output 7 [2022-11-18 19:55:28,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:55:28,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:28,188 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-18 19:55:28,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:28,195 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 14 treesize of output 16 [2022-11-18 19:55:28,207 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:55:28,207 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 11 treesize of output 11 [2022-11-18 19:55:28,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:28,265 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-18 19:55:28,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:28,424 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-18 19:55:28,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896280418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:28,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:28,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-18 19:55:28,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617917094] [2022-11-18 19:55:28,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:28,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:55:28,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:28,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:55:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:55:28,426 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:28,810 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2022-11-18 19:55:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:55:28,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 19:55:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:28,812 INFO L225 Difference]: With dead ends: 135 [2022-11-18 19:55:28,813 INFO L226 Difference]: Without dead ends: 116 [2022-11-18 19:55:28,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:55:28,814 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 97 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:28,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 158 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 157 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-11-18 19:55:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-18 19:55:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 67. [2022-11-18 19:55:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.5) internal successors, (99), 66 states have internal predecessors, (99), 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-18 19:55:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2022-11-18 19:55:28,828 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 14 [2022-11-18 19:55:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:28,829 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2022-11-18 19:55:28,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2022-11-18 19:55:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:55:28,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:28,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:28,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:29,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:29,036 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:29,038 INFO L85 PathProgramCache]: Analyzing trace with hash 658296035, now seen corresponding path program 1 times [2022-11-18 19:55:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:29,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231196252] [2022-11-18 19:55:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:29,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:29,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:29,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231196252] [2022-11-18 19:55:29,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231196252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:29,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126403279] [2022-11-18 19:55:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:29,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:29,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:29,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:29,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:55:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:29,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 19:55:29,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:29,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:29,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:55:29,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:29,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:55:29,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:29,518 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 21 treesize of output 20 [2022-11-18 19:55:29,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:29,539 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 21 treesize of output 20 [2022-11-18 19:55:29,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:29,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:29,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:29,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126403279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:29,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:29,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-18 19:55:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561645479] [2022-11-18 19:55:29,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:29,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:55:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:55:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:55:29,619 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:29,789 INFO L93 Difference]: Finished difference Result 165 states and 241 transitions. [2022-11-18 19:55:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:55:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 19:55:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:29,791 INFO L225 Difference]: With dead ends: 165 [2022-11-18 19:55:29,791 INFO L226 Difference]: Without dead ends: 124 [2022-11-18 19:55:29,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:55:29,793 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:29,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 67 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-18 19:55:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2022-11-18 19:55:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 113 states have internal predecessors, (164), 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-18 19:55:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2022-11-18 19:55:29,833 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 16 [2022-11-18 19:55:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:29,834 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2022-11-18 19:55:29,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2022-11-18 19:55:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 19:55:29,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:29,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:29,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:30,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:30,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 385260059, now seen corresponding path program 1 times [2022-11-18 19:55:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:30,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853428085] [2022-11-18 19:55:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:55:30,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:30,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853428085] [2022-11-18 19:55:30,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853428085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:30,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:30,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:55:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994683759] [2022-11-18 19:55:30,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:55:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:55:30,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:55:30,184 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:30,267 INFO L93 Difference]: Finished difference Result 133 states and 189 transitions. [2022-11-18 19:55:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:55:30,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 19:55:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:30,272 INFO L225 Difference]: With dead ends: 133 [2022-11-18 19:55:30,272 INFO L226 Difference]: Without dead ends: 107 [2022-11-18 19:55:30,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:55:30,276 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:30,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:55:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-18 19:55:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-11-18 19:55:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 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-18 19:55:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2022-11-18 19:55:30,316 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 18 [2022-11-18 19:55:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:30,316 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2022-11-18 19:55:30,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2022-11-18 19:55:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 19:55:30,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:30,319 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:30,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:55:30,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 455619718, now seen corresponding path program 2 times [2022-11-18 19:55:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:30,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094022660] [2022-11-18 19:55:30,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:30,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:30,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094022660] [2022-11-18 19:55:30,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094022660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:30,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833493913] [2022-11-18 19:55:30,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:55:30,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:30,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:30,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:30,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:55:30,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:55:30,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:55:30,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 19:55:30,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:30,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:55:30,948 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 11 treesize of output 7 [2022-11-18 19:55:31,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:31,033 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-18 19:55:31,049 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:55:31,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-18 19:55:31,054 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 5 treesize of output 3 [2022-11-18 19:55:31,074 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:55:31,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:55:31,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:31,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:31,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:55:31,185 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 19:55:31,185 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:55:31,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:31,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:31,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833493913] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:31,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:31,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-11-18 19:55:31,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960953678] [2022-11-18 19:55:31,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:31,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 19:55:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:31,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 19:55:31,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:55:31,526 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:32,094 INFO L93 Difference]: Finished difference Result 155 states and 217 transitions. [2022-11-18 19:55:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:55:32,094 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 19:55:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:32,095 INFO L225 Difference]: With dead ends: 155 [2022-11-18 19:55:32,095 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 19:55:32,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2022-11-18 19:55:32,097 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 148 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:32,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 140 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 187 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2022-11-18 19:55:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 19:55:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 109. [2022-11-18 19:55:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 108 states have internal predecessors, (156), 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-18 19:55:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2022-11-18 19:55:32,114 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 18 [2022-11-18 19:55:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:32,114 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2022-11-18 19:55:32,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2022-11-18 19:55:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 19:55:32,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:32,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:32,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:32,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 19:55:32,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash 625125097, now seen corresponding path program 1 times [2022-11-18 19:55:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:32,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933108299] [2022-11-18 19:55:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:33,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:33,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933108299] [2022-11-18 19:55:33,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933108299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:33,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805843076] [2022-11-18 19:55:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:33,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:33,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:33,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:33,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:55:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:33,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-18 19:55:33,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:33,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:33,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:55:33,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:55:33,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:33,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:55:33,316 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 19:55:33,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 19:55:33,341 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-18 19:55:33,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 19:55:33,361 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:55:33,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2022-11-18 19:55:33,374 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 23 treesize of output 13 [2022-11-18 19:55:33,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:33,383 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 31 treesize of output 31 [2022-11-18 19:55:33,398 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-18 19:55:33,398 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 17 treesize of output 17 [2022-11-18 19:55:33,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:33,801 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-18 19:55:33,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 69 [2022-11-18 19:55:33,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:33,828 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-18 19:55:33,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 84 [2022-11-18 19:55:33,864 INFO L321 Elim1Store]: treesize reduction 46, result has 40.3 percent of original size [2022-11-18 19:55:33,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 75 [2022-11-18 19:55:34,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2022-11-18 19:55:34,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:34,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:34,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:34,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:34,612 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 56 treesize of output 57 [2022-11-18 19:55:34,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:34,637 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 124 treesize of output 127 [2022-11-18 19:55:34,645 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 47 treesize of output 26 [2022-11-18 19:55:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:35,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805843076] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:35,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:35,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-18 19:55:35,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722063284] [2022-11-18 19:55:35,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:35,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:55:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:55:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:55:35,213 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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-18 19:55:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:35,763 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2022-11-18 19:55:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:55:35,766 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 19:55:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:35,767 INFO L225 Difference]: With dead ends: 134 [2022-11-18 19:55:35,767 INFO L226 Difference]: Without dead ends: 132 [2022-11-18 19:55:35,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2022-11-18 19:55:35,768 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 79 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:35,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 191 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-11-18 19:55:35,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-18 19:55:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2022-11-18 19:55:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 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-18 19:55:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 169 transitions. [2022-11-18 19:55:35,789 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 169 transitions. Word has length 20 [2022-11-18 19:55:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:35,789 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 169 transitions. [2022-11-18 19:55:35,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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-18 19:55:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2022-11-18 19:55:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 19:55:35,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:35,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:35,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-18 19:55:35,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:35,998 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:35,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash 625127019, now seen corresponding path program 1 times [2022-11-18 19:55:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:35,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752396736] [2022-11-18 19:55:35,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:35,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:36,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:36,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752396736] [2022-11-18 19:55:36,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752396736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:36,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340600947] [2022-11-18 19:55:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:36,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:36,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:36,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:55:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:36,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-18 19:55:36,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:36,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:36,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:55:36,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:55:36,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:36,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:55:36,916 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 19:55:36,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 19:55:36,939 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-18 19:55:36,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 19:55:36,956 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:55:36,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2022-11-18 19:55:36,968 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 23 treesize of output 13 [2022-11-18 19:55:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:36,984 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 31 treesize of output 31 [2022-11-18 19:55:36,997 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-18 19:55:36,997 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 17 treesize of output 17 [2022-11-18 19:55:37,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:37,427 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-18 19:55:37,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 69 [2022-11-18 19:55:37,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:37,452 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-18 19:55:37,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 84 [2022-11-18 19:55:37,489 INFO L321 Elim1Store]: treesize reduction 46, result has 40.3 percent of original size [2022-11-18 19:55:37,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 75 [2022-11-18 19:55:37,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:37,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2022-11-18 19:55:37,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:37,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:37,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:38,000 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 56 treesize of output 57 [2022-11-18 19:55:38,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:38,023 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 124 treesize of output 127 [2022-11-18 19:55:38,039 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 47 treesize of output 26 [2022-11-18 19:55:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:38,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340600947] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:38,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:38,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-18 19:55:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447801211] [2022-11-18 19:55:38,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:38,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 19:55:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 19:55:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-11-18 19:55:38,478 INFO L87 Difference]: Start difference. First operand 118 states and 169 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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-18 19:55:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:38,796 INFO L93 Difference]: Finished difference Result 169 states and 241 transitions. [2022-11-18 19:55:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:55:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 19:55:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:38,798 INFO L225 Difference]: With dead ends: 169 [2022-11-18 19:55:38,798 INFO L226 Difference]: Without dead ends: 138 [2022-11-18 19:55:38,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-11-18 19:55:38,801 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:38,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 154 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-11-18 19:55:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-18 19:55:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2022-11-18 19:55:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.434782608695652) internal successors, (165), 115 states have internal predecessors, (165), 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-18 19:55:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2022-11-18 19:55:38,819 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 20 [2022-11-18 19:55:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:38,819 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2022-11-18 19:55:38,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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-18 19:55:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2022-11-18 19:55:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 19:55:38,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:38,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:38,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:39,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:39,030 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:39,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash 682383399, now seen corresponding path program 1 times [2022-11-18 19:55:39,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:39,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504999597] [2022-11-18 19:55:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:39,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:39,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:39,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504999597] [2022-11-18 19:55:39,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504999597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:39,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724188420] [2022-11-18 19:55:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:39,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:39,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:39,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:39,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:55:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:39,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-18 19:55:39,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:39,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:55:39,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:55:39,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:55:39,541 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 19:55:39,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 19:55:39,566 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-18 19:55:39,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 19:55:39,582 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:55:39,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2022-11-18 19:55:39,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,591 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 31 treesize of output 31 [2022-11-18 19:55:39,598 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 23 treesize of output 13 [2022-11-18 19:55:39,613 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-18 19:55:39,613 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 17 treesize of output 17 [2022-11-18 19:55:39,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,952 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-18 19:55:39,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 69 [2022-11-18 19:55:39,997 INFO L321 Elim1Store]: treesize reduction 46, result has 40.3 percent of original size [2022-11-18 19:55:39,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 81 [2022-11-18 19:55:40,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:40,020 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-18 19:55:40,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-11-18 19:55:40,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2022-11-18 19:55:40,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:40,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:40,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:40,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:40,650 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 56 treesize of output 57 [2022-11-18 19:55:40,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:40,670 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 124 treesize of output 127 [2022-11-18 19:55:40,678 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 47 treesize of output 26 [2022-11-18 19:55:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:41,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724188420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:41,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:41,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 20 [2022-11-18 19:55:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232026238] [2022-11-18 19:55:41,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:41,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:55:41,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:41,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:55:41,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:55:41,136 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:41,468 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_#t~mem11#1| 10) (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (or (and (= .cse0 0) (= .cse1 0)) (forall ((v_ArrVal_666 (Array Int Int))) (< 9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_666) .cse0) .cse1))))))) is different from false [2022-11-18 19:55:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:41,744 INFO L93 Difference]: Finished difference Result 154 states and 219 transitions. [2022-11-18 19:55:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:55:41,745 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 19:55:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:41,748 INFO L225 Difference]: With dead ends: 154 [2022-11-18 19:55:41,749 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 19:55:41,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=767, Unknown=1, NotChecked=58, Total=992 [2022-11-18 19:55:41,750 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:41,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 171 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-11-18 19:55:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 19:55:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2022-11-18 19:55:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 115 states have internal predecessors, (164), 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-18 19:55:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2022-11-18 19:55:41,775 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 20 [2022-11-18 19:55:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:41,775 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2022-11-18 19:55:41,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2022-11-18 19:55:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 19:55:41,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:41,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:41,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:41,993 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1256524893, now seen corresponding path program 1 times [2022-11-18 19:55:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:41,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533342180] [2022-11-18 19:55:41,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:41,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 19:55:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:42,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533342180] [2022-11-18 19:55:42,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533342180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:42,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:42,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:55:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663089622] [2022-11-18 19:55:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:42,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:55:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:55:42,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:55:42,052 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:42,104 INFO L93 Difference]: Finished difference Result 213 states and 301 transitions. [2022-11-18 19:55:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:55:42,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 19:55:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:42,107 INFO L225 Difference]: With dead ends: 213 [2022-11-18 19:55:42,107 INFO L226 Difference]: Without dead ends: 118 [2022-11-18 19:55:42,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:55:42,111 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:42,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:55:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-18 19:55:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2022-11-18 19:55:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 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-18 19:55:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2022-11-18 19:55:42,135 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 22 [2022-11-18 19:55:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:42,135 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2022-11-18 19:55:42,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2022-11-18 19:55:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:55:42,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:42,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:42,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:55:42,137 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:42,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1725952529, now seen corresponding path program 2 times [2022-11-18 19:55:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:42,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124890849] [2022-11-18 19:55:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:42,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:42,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124890849] [2022-11-18 19:55:42,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124890849] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:42,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151048173] [2022-11-18 19:55:42,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:55:42,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:42,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:42,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:42,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 19:55:43,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:55:43,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:55:43,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-18 19:55:43,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:43,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:55:43,176 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:55:43,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:55:43,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:55:43,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-18 19:55:43,195 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 16 treesize of output 18 [2022-11-18 19:55:43,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-18 19:55:43,209 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 16 treesize of output 18 [2022-11-18 19:55:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:43,344 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-18 19:55:43,344 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 86 [2022-11-18 19:55:43,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:43,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:43,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-11-18 19:55:43,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-18 19:55:43,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:43,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 19:55:43,382 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-18 19:55:43,383 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-18 19:55:43,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:43,517 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 28 [2022-11-18 19:55:43,523 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 20 treesize of output 22 [2022-11-18 19:55:43,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:43,530 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 21 treesize of output 20 [2022-11-18 19:55:43,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-18 19:55:43,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:43,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:55:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:43,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:43,611 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_857 (Array Int Int))) (<= 10 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_857) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-11-18 19:55:43,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:43,803 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 68 treesize of output 69 [2022-11-18 19:55:43,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:43,823 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 343 treesize of output 252 [2022-11-18 19:55:43,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:43,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 198 [2022-11-18 19:55:43,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:43,851 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 182 treesize of output 152 [2022-11-18 19:55:43,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:43,873 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 976 treesize of output 933 [2022-11-18 19:55:44,554 INFO L321 Elim1Store]: treesize reduction 390, result has 49.9 percent of original size [2022-11-18 19:55:44,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 4797 treesize of output 4684 [2022-11-18 19:55:44,687 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 2380 treesize of output 2152 [2022-11-18 19:55:44,811 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 4235 treesize of output 4055 [2022-11-18 19:55:44,902 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 4079 treesize of output 3755 [2022-11-18 19:55:44,993 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 3787 treesize of output 2855 [2022-11-18 19:55:45,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:45,131 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 2774 treesize of output 2606 [2022-11-18 19:55:45,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:45,270 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 2582 treesize of output 2510 [2022-11-18 19:57:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-18 19:57:26,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151048173] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:57:26,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:57:26,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-11-18 19:57:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83314850] [2022-11-18 19:57:26,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:57:26,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:57:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:57:26,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:57:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=222, Unknown=2, NotChecked=30, Total=306 [2022-11-18 19:57:26,685 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 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-18 19:57:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:57:27,181 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2022-11-18 19:57:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:57:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 19:57:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:57:27,182 INFO L225 Difference]: With dead ends: 137 [2022-11-18 19:57:27,182 INFO L226 Difference]: Without dead ends: 135 [2022-11-18 19:57:27,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=367, Unknown=2, NotChecked=40, Total=506 [2022-11-18 19:57:27,183 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 73 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:57:27,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 187 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 129 Unchecked, 0.2s Time] [2022-11-18 19:57:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-18 19:57:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2022-11-18 19:57:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 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-18 19:57:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2022-11-18 19:57:27,202 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 24 [2022-11-18 19:57:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:57:27,202 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2022-11-18 19:57:27,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 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-18 19:57:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2022-11-18 19:57:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:57:27,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:57:27,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:57:27,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 19:57:27,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 19:57:27,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:57:27,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1725950607, now seen corresponding path program 2 times [2022-11-18 19:57:27,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:57:27,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406406373] [2022-11-18 19:57:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:27,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:57:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:57:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:57:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406406373] [2022-11-18 19:57:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406406373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:57:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249256102] [2022-11-18 19:57:28,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:57:28,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:57:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:57:28,479 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:57:28,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 19:57:28,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:57:28,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:57:28,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-18 19:57:28,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:57:28,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:57:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:28,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:57:28,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:28,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-18 19:57:28,761 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 19:57:28,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 19:57:28,779 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-18 19:57:28,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 19:57:28,798 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:57:28,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-11-18 19:57:28,816 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:57:28,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-11-18 19:57:28,836 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:57:28,836 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 15 treesize of output 7 [2022-11-18 19:57:28,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:28,850 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 19 treesize of output 19 [2022-11-18 19:57:28,887 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 11 treesize of output 7 [2022-11-18 19:57:28,912 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:57:28,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:57:29,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:29,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-18 19:57:29,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:29,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:29,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2022-11-18 19:57:29,163 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:57:29,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 73 [2022-11-18 19:57:29,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:29,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:29,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2022-11-18 19:57:29,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:29,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:57:29,203 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 19:57:29,205 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:57:29,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:29,789 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-18 19:57:29,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 111 [2022-11-18 19:57:29,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:29,892 INFO L321 Elim1Store]: treesize reduction 124, result has 43.6 percent of original size [2022-11-18 19:57:29,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 179 [2022-11-18 19:57:29,934 INFO L321 Elim1Store]: treesize reduction 46, result has 40.3 percent of original size [2022-11-18 19:57:29,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 105 [2022-11-18 19:57:32,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 70 [2022-11-18 19:57:32,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:32,413 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 74 treesize of output 86 [2022-11-18 19:57:32,555 INFO L321 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2022-11-18 19:57:32,556 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 34 treesize of output 33 [2022-11-18 19:57:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:57:32,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:57:33,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:57:33,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:33,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 226 treesize of output 246 [2022-11-18 19:57:33,146 INFO L321 Elim1Store]: treesize reduction 56, result has 60.6 percent of original size [2022-11-18 19:57:33,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 480 treesize of output 528 [2022-11-18 19:57:33,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:33,213 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 1112 treesize of output 1150 [2022-11-18 19:57:33,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:33,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 998 treesize of output 942 [2022-11-18 19:57:33,254 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 933 treesize of output 885 [2022-11-18 19:57:33,276 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 885 treesize of output 861 [2022-11-18 19:57:33,306 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 861 treesize of output 765 [2022-11-18 19:57:33,325 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 765 treesize of output 717 [2022-11-18 19:57:33,618 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 14 treesize of output 10 [2022-11-18 19:57:33,699 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 27 treesize of output 3 [2022-11-18 19:57:34,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:34,478 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 205 treesize of output 207 [2022-11-18 19:57:34,492 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 42 treesize of output 38 [2022-11-18 19:57:34,657 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 46 treesize of output 42 [2022-11-18 19:57:34,667 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 42 treesize of output 38 [2022-11-18 19:57:34,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:34,712 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 322 treesize of output 324 [2022-11-18 19:57:34,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:34,734 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 294 treesize of output 296 [2022-11-18 19:57:35,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:35,838 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 460 treesize of output 522 [2022-11-18 19:57:38,159 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 46 treesize of output 42 [2022-11-18 19:57:38,168 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 42 treesize of output 38 [2022-11-18 19:57:38,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:38,209 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 205 treesize of output 207 [2022-11-18 19:57:38,224 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 42 treesize of output 38 [2022-11-18 19:57:38,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:38,491 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 333 treesize of output 395 [2022-11-18 19:57:39,957 INFO L321 Elim1Store]: treesize reduction 5, result has 83.3 percent of original size [2022-11-18 19:57:39,958 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 74 treesize of output 71 [2022-11-18 19:57:39,970 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 42 treesize of output 38 [2022-11-18 19:57:40,022 INFO L321 Elim1Store]: treesize reduction 5, result has 83.3 percent of original size [2022-11-18 19:57:40,023 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 127 treesize of output 124 [2022-11-18 19:57:40,038 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 42 treesize of output 38 [2022-11-18 19:57:40,092 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 46 treesize of output 42 [2022-11-18 19:57:40,104 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 42 treesize of output 38 [2022-11-18 19:57:40,534 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 8 treesize of output 4 [2022-11-18 19:57:40,575 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 8 treesize of output 4 [2022-11-18 19:57:40,925 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 8 treesize of output 4 [2022-11-18 19:57:41,106 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 8 treesize of output 4 [2022-11-18 19:57:41,124 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 8 treesize of output 4 [2022-11-18 19:57:41,355 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 8 treesize of output 4 [2022-11-18 19:57:41,529 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 8 treesize of output 4 [2022-11-18 19:57:41,684 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 8 treesize of output 4 [2022-11-18 19:57:41,753 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 8 treesize of output 4 [2022-11-18 19:57:41,893 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 8 treesize of output 4 [2022-11-18 19:57:41,969 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 8 treesize of output 4 [2022-11-18 19:57:48,712 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base|))) (and (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse3 v_ArrVal_991)))) (= (select (select (store (store .cse0 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (select (select (store (store .cse0 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse3 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse6 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse7 (select (select (store .cse8 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse6 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse5 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse5))))) (= .cse7 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= .cse7 (select (select (store .cse8 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse10 v_ArrVal_991)))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store .cse9 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_446 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse10 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_446) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= v_ArrVal_991 (select (select (store (store .cse9 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse14 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse14 v_ArrVal_991))) (.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse14 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse12 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse11 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse11))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse12 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse13 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (= (select (select (store .cse13 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse18 v_ArrVal_991)))) (let ((.cse15 (select (select (store (store .cse17 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= v_ArrVal_991 .cse15) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse16 (select (select (store (store .cse17 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse15 .cse16) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse16))))) (forall ((v_prenex_529 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse18 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_529) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse22 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse22 v_ArrVal_991)))) (or (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse22 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse19 (select (select (store .cse21 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse19 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store .cse20 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_446 (Array Int Int))) (= (select (select (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_446) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1005 (Array Int Int))) (= .cse19 (select (select (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))))) (= v_ArrVal_991 (select (select (store (store .cse20 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_372 Int) (v_ArrVal_1012 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse24 (select (select (store (store .cse23 v_ArrVal_991 v_prenex_373) v_prenex_372 v_prenex_371) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= v_ArrVal_991 (select (select (store (store .cse23 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= .cse24 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_372) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse24)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse27 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse25 (select (select (store .cse27 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (let ((.cse26 (select (select (store .cse27 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse25 .cse26) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= .cse26 0)))) (= .cse25 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse28 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse28 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_555 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse28 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_555) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse29 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse29 v_ArrVal_991)))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse29 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= v_ArrVal_991 (select (select (store (store .cse30 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_372 Int)) (let ((.cse31 (select (select (store (store .cse30 v_ArrVal_991 v_prenex_373) v_prenex_372 v_prenex_371) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse31 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_372) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse31))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (let ((.cse32 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse32 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse33 (select (select (store .cse34 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse32 v_ArrVal_991)) v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= .cse33 0) (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (= (select (select (store .cse34 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse33))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int) (v_prenex_556 (Array Int Int))) (let ((.cse38 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse35 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse38 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse36 (select (select (store .cse35 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store .cse35 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse36) (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse37 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse38 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse37 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse37))))) (= .cse36 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse40 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse39 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse40 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (= (select (select (store .cse39 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse40 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= (select (select (store .cse39 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse42 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse41 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse42 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse41 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse41))))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse42 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_454 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse43 (select (select (store (store .cse44 v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse43) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse43)) (= v_ArrVal_991 (select (select (store (store .cse44 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= 0 .cse43))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse46 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse45 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse46 v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse45)) (= .cse45 0)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse46 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse50 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse50 v_ArrVal_991)))) (or (forall ((v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (= v_ArrVal_991 (select (select (store (store .cse47 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= v_ArrVal_991 (select (select (store (store .cse47 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_1005 (Array Int Int)) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse50 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse48 (select (select (store .cse49 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse48 0) (= (select (select (store .cse49 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse48))))))))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (let ((.cse52 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse52 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse53 (select (select (store .cse54 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse51 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse52 v_ArrVal_991)) v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse51) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse51)) (= 0 .cse51)))) (= .cse53 0) (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (= (select (select (store .cse54 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse53))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse57 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse57 v_ArrVal_991)))) (let ((.cse56 (select (select (store (store .cse55 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store (store .cse55 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse56) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse56)) (forall ((v_prenex_351 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse57 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse58 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse58 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse58 v_ArrVal_991)) v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= (select (select (store .cse59 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (= (select (select (store .cse59 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= (select (select (store .cse60 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (= (select (select (store .cse60 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_451 Int) (v_prenex_450 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_prenex_452 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse62 (select (select (store (store .cse61 v_ArrVal_991 v_prenex_452) v_prenex_451 v_prenex_450) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_451) 0)) (= v_ArrVal_991 (select (select (store (store .cse61 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse62 0) (= v_ArrVal_991 .cse62))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse64 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse64 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse65 (select (select (store .cse66 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse63 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse64 v_ArrVal_991)) v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse63) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse63)) (= 0 .cse63)))) (= .cse65 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= .cse65 (select (select (store .cse66 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse68 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse70 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse68 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse69 (select (select (store .cse70 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_451) 0)) (forall ((v_prenex_450 (Array Int Int)) (v_prenex_452 (Array Int Int))) (let ((.cse67 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse68 v_ArrVal_991)) v_ArrVal_991 v_prenex_452) v_prenex_451 v_prenex_450) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse67 0) (= v_ArrVal_991 .cse67)))) (= .cse69 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= .cse69 (select (select (store .cse70 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse71 (select (select (store (store .cse72 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse71 (select (select (store (store .cse72 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse71 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (= v_ArrVal_991 .cse71))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse74 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse74 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse73 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse74 v_ArrVal_991)) v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse73) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse73)) (= 0 .cse73)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse75 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store .cse75 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse79 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse77 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse79 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse76 (select (select (store .cse77 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (= .cse76 (select (select (store .cse77 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse78 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse79 v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse78)) (= .cse78 0)))) (= .cse76 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int) (v_prenex_556 (Array Int Int))) (let ((.cse83 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse83 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse81 (select (select (store .cse80 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store .cse80 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse81) (= .cse81 0) (forall ((v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse82 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse83 v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse82)) (= .cse82 0))))))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse84 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse84 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse85 (select (select (store .cse86 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_559 (Array Int Int)) (v_prenex_557 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse84 v_ArrVal_991)) v_ArrVal_991 v_prenex_559) v_prenex_558 v_prenex_557) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_558) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (= .cse85 (select (select (store .cse86 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= .cse85 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse89 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse88 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse89 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse87 (select (select (store .cse88 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (or (= .cse87 (select (select (store .cse88 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse88 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse89 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (= .cse87 0)))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse91 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse90 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse91 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse90 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse91 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (= (select (select (store .cse90 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse94 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse92 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse94 v_ArrVal_991))) (.cse93 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse94 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse92 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse93 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (forall ((v_prenex_370 (Array Int Int)) (v_prenex_368 (Array Int Int))) (= (select (select (store (store .cse92 v_ArrVal_991 v_prenex_370) v_prenex_369 v_prenex_368) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store .cse93 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_369) 0)))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse96 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse98 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse96 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse97 (select (select (store .cse98 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse95 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse96 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse95 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse95))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (= .cse97 (select (select (store .cse98 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= .cse97 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse102 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse101 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse102 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse99 (select (select (store .cse101 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse99 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (forall ((v_ArrVal_1005 (Array Int Int))) (let ((.cse100 (select (select (store .cse101 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse100 0) (= .cse99 .cse100)))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)))))))) (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse102 v_ArrVal_991)) v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse105 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse104 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse105 v_ArrVal_991)))) (let ((.cse103 (select (select (store (store .cse104 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= .cse103 (select (select (store (store .cse104 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= v_ArrVal_991 .cse103) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse105 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse108 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse107 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse108 v_ArrVal_991)))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse106 (select (select (store (store .cse107 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse106 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse106))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse107 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse108 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse110 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse110 v_ArrVal_991)))) (or (forall ((v_prenex_370 (Array Int Int)) (v_prenex_368 (Array Int Int))) (= (select (select (store (store .cse109 v_ArrVal_991 v_prenex_370) v_prenex_369 v_prenex_368) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse110 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= v_ArrVal_991 (select (select (store (store .cse109 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_369) 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse111 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse111 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse111))))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (let ((.cse113 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse115 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse113 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse114 (select (select (store .cse115 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse112 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse113 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse112 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse112))))) (= .cse114 0) (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (= (select (select (store .cse115 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse114))))))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse117 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse116 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse117 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= v_ArrVal_991 .cse116)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse116)) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_prenex_367 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse117 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_367) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse120 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse119 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse120 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse118 (select (select (store .cse119 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (or (= .cse118 (select (select (store .cse119 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse120 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_555 (Array Int Int))) (= (select (select (store .cse119 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_555) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) (= .cse118 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse125 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse123 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse125 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse121 (select (select (store .cse123 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (let ((.cse122 (select (select (store .cse123 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse121 .cse122) (= .cse122 0)))) (forall ((v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse124 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse125 v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse124)) (= .cse124 0)))) (= .cse121 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse126 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse129 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse126 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse127 (select (select (store .cse129 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_559 (Array Int Int)) (v_prenex_557 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse126 v_ArrVal_991)) v_ArrVal_991 v_prenex_559) v_prenex_558 v_prenex_557) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (let ((.cse128 (select (select (store .cse129 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse127 .cse128) (= .cse128 0)))) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_558) 0)) (= .cse127 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse130 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (not (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse130 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse130 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse133 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse132 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse133 v_ArrVal_991)))) (let ((.cse131 (select (select (store (store .cse132 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse131 (select (select (store (store .cse132 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse131 0) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse133 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_30 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse134 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse134)) (= .cse134 0)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse136 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse139 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse136 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse137 (select (select (store .cse139 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse135 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse136 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse135 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse135))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (let ((.cse138 (select (select (store .cse139 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse137 .cse138) (= .cse138 0)))) (= .cse137 0)))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse141 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse140 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse141 v_ArrVal_991)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse140 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse141 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (forall ((v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_372 Int)) (let ((.cse142 (select (select (store (store .cse140 v_ArrVal_991 v_prenex_373) v_prenex_372 v_prenex_371) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse142 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_372) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse142))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse143 (select (select (store (store .cse144 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse143 (select (select (store (store .cse144 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse143 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse143)) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse149 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse147 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse149 v_ArrVal_991)))) (or (forall ((v_ArrVal_1005 (Array Int Int))) (let ((.cse148 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse149 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse145 (select (select (store .cse148 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse145 0) (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_451) 0)) (forall ((v_prenex_450 (Array Int Int)) (v_prenex_452 (Array Int Int))) (let ((.cse146 (select (select (store (store .cse147 v_ArrVal_991 v_prenex_452) v_prenex_451 v_prenex_450) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse146 0) (= v_ArrVal_991 .cse146)))) (= (select (select (store .cse148 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse145))))))) (= v_ArrVal_991 (select (select (store (store .cse147 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse150 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse151 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse150 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse150 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_555 (Array Int Int))) (= (select (select (store .cse151 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_555) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) (= (select (select (store .cse151 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse153 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse152 (select (select (store (store .cse153 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse152 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse152)) (= v_ArrVal_991 (select (select (store (store .cse153 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse155 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse156 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse155 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse154 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse155 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse154 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse154))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse156 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store .cse156 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse160 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse158 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse160 0)) v_ArrVal_991 v_arrayElimArr_25)) (.cse157 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse160 v_ArrVal_991)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse157 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse158 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (= (select (select (store .cse158 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_372 Int)) (let ((.cse159 (select (select (store (store .cse157 v_ArrVal_991 v_prenex_373) v_prenex_372 v_prenex_371) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse159 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_372) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse159))))))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int) (v_prenex_556 (Array Int Int))) (let ((.cse161 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse162 (select (select (store .cse161 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store .cse161 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse162) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= .cse162 0))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse167 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse167 v_ArrVal_991)))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse163 (select (select (store (store .cse164 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse163 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse163))))) (= v_ArrVal_991 (select (select (store (store .cse164 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_1005 (Array Int Int)) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse166 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse167 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse165 (select (select (store .cse166 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse165 0) (= (select (select (store .cse166 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse165))))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse171 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse171 v_ArrVal_991)))) (let ((.cse168 (select (select (store (store .cse170 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse169 (select (select (store (store .cse170 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse168 .cse169) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| .cse169))))) (= v_ArrVal_991 .cse168) (forall ((v_prenex_530 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse171 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_530) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse172 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse173 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse172 v_ArrVal_991)))) (or (forall ((v_prenex_445 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse172 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_445) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= v_ArrVal_991 (select (select (store (store .cse173 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store .cse173 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse174 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse175 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse174 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_559 (Array Int Int)) (v_prenex_557 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse174 v_ArrVal_991)) v_ArrVal_991 v_prenex_559) v_prenex_558 v_prenex_557) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (= (select (select (store .cse175 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_558) 0)) (= (select (select (store .cse175 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse178 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse178 v_ArrVal_991)))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse176 (select (select (store (store .cse177 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse176 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse176))))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse178 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= v_ArrVal_991 (select (select (store (store .cse177 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse179 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse180 (select (select (store (store .cse179 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= v_ArrVal_991 (select (select (store (store .cse179 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= .cse180 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse180)))))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse183 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse181 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse183 v_ArrVal_991)))) (let ((.cse182 (select (select (store (store .cse181 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store (store .cse181 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse182) (forall ((v_prenex_352 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse183 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| .cse182))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse184 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse184 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse184 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse187 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse186 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse187 v_ArrVal_991)))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse185 (select (select (store (store .cse186 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse185)) (= v_ArrVal_991 .cse185)))) (forall ((v_prenex_445 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse187 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_445) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= v_ArrVal_991 (select (select (store (store .cse186 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse190 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse188 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse190 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (= (select (select (store .cse188 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse189 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse190 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= v_ArrVal_991 .cse189)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse189)) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_prenex_367 (Array Int Int))) (= 0 (select (select (store .cse188 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_367) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse192 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse191 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse192 v_ArrVal_991)))) (or (not (= v_ArrVal_991 (select (select (store (store .cse191 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= v_ArrVal_991 (select (select (store (store .cse191 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse192 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse194 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse195 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse194 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_451) 0)) (forall ((v_prenex_450 (Array Int Int)) (v_prenex_452 (Array Int Int))) (let ((.cse193 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse194 v_ArrVal_991)) v_ArrVal_991 v_prenex_452) v_prenex_451 v_prenex_450) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse193 0) (= v_ArrVal_991 .cse193)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse195 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store .cse195 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse197 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse196 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse197 v_ArrVal_991)))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= v_ArrVal_991 (select (select (store (store .cse196 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse197 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= v_ArrVal_991 (select (select (store (store .cse196 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse198 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)) v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse198) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse198)) (= 0 .cse198)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse200 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse199 (select (select (store (store .cse200 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse199 (select (select (store (store .cse200 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse199 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse199)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse204 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse203 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse204 v_ArrVal_991)))) (or (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse201 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse204 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse202 (select (select (store .cse201 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_prenex_445 (Array Int Int))) (= (select (select (store .cse201 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_445) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1005 (Array Int Int))) (= .cse202 (select (select (store .cse201 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store .cse203 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (= .cse202 0))))) (= v_ArrVal_991 (select (select (store (store .cse203 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse209 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse206 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse209 v_ArrVal_991)))) (or (forall ((v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse205 (select (select (store (store .cse206 v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse205) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse205)) (= 0 .cse205)))) (= v_ArrVal_991 (select (select (store (store .cse206 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_1005 (Array Int Int)) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse208 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse209 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse207 (select (select (store .cse208 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse207 0) (= (select (select (store .cse208 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse207))))))))))))))))) is different from true [2022-11-18 19:58:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-18 19:58:05,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249256102] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:58:05,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:58:05,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-18 19:58:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133107978] [2022-11-18 19:58:05,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:58:05,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:58:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:58:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:58:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=281, Unknown=1, NotChecked=34, Total=380 [2022-11-18 19:58:05,779 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 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-18 19:58:08,075 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base|))) (and (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse3 v_ArrVal_991)))) (= (select (select (store (store .cse0 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (select (select (store (store .cse0 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse3 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse6 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse7 (select (select (store .cse8 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse6 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse5 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse5))))) (= .cse7 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= .cse7 (select (select (store .cse8 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse10 v_ArrVal_991)))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store .cse9 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_446 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse10 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_446) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= v_ArrVal_991 (select (select (store (store .cse9 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse14 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse14 v_ArrVal_991))) (.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse14 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse12 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse11 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse11))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse12 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse13 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (= (select (select (store .cse13 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse18 v_ArrVal_991)))) (let ((.cse15 (select (select (store (store .cse17 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= v_ArrVal_991 .cse15) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse16 (select (select (store (store .cse17 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse15 .cse16) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse16))))) (forall ((v_prenex_529 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse18 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_529) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse22 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse22 v_ArrVal_991)))) (or (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse22 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse19 (select (select (store .cse21 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse19 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store .cse20 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_446 (Array Int Int))) (= (select (select (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_446) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1005 (Array Int Int))) (= .cse19 (select (select (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))))) (= v_ArrVal_991 (select (select (store (store .cse20 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_372 Int) (v_ArrVal_1012 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse24 (select (select (store (store .cse23 v_ArrVal_991 v_prenex_373) v_prenex_372 v_prenex_371) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= v_ArrVal_991 (select (select (store (store .cse23 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= .cse24 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_372) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse24)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse27 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse25 (select (select (store .cse27 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (let ((.cse26 (select (select (store .cse27 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse25 .cse26) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= .cse26 0)))) (= .cse25 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse28 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse28 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_555 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse28 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_555) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse29 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse29 v_ArrVal_991)))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse29 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= v_ArrVal_991 (select (select (store (store .cse30 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_372 Int)) (let ((.cse31 (select (select (store (store .cse30 v_ArrVal_991 v_prenex_373) v_prenex_372 v_prenex_371) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse31 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_372) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse31))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (let ((.cse32 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse32 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse33 (select (select (store .cse34 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse32 v_ArrVal_991)) v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= .cse33 0) (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (= (select (select (store .cse34 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse33))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int) (v_prenex_556 (Array Int Int))) (let ((.cse38 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse35 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse38 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse36 (select (select (store .cse35 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store .cse35 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse36) (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse37 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse38 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse37 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse37))))) (= .cse36 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse40 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse39 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse40 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (= (select (select (store .cse39 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse40 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= (select (select (store .cse39 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse42 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse41 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse42 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse41 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse41))))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse42 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_454 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse43 (select (select (store (store .cse44 v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse43) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse43)) (= v_ArrVal_991 (select (select (store (store .cse44 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= 0 .cse43))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse46 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse45 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse46 v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse45)) (= .cse45 0)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse46 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse50 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse50 v_ArrVal_991)))) (or (forall ((v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (= v_ArrVal_991 (select (select (store (store .cse47 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= v_ArrVal_991 (select (select (store (store .cse47 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_1005 (Array Int Int)) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse50 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse48 (select (select (store .cse49 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse48 0) (= (select (select (store .cse49 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse48))))))))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (let ((.cse52 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse52 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse53 (select (select (store .cse54 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse51 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse52 v_ArrVal_991)) v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse51) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse51)) (= 0 .cse51)))) (= .cse53 0) (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (= (select (select (store .cse54 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse53))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse57 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse57 v_ArrVal_991)))) (let ((.cse56 (select (select (store (store .cse55 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store (store .cse55 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse56) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse56)) (forall ((v_prenex_351 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse57 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse58 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse58 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse58 v_ArrVal_991)) v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= (select (select (store .cse59 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (= (select (select (store .cse59 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= (select (select (store .cse60 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (= (select (select (store .cse60 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_451 Int) (v_prenex_450 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_prenex_452 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse62 (select (select (store (store .cse61 v_ArrVal_991 v_prenex_452) v_prenex_451 v_prenex_450) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_451) 0)) (= v_ArrVal_991 (select (select (store (store .cse61 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse62 0) (= v_ArrVal_991 .cse62))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse64 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse64 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse65 (select (select (store .cse66 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse63 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse64 v_ArrVal_991)) v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse63) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse63)) (= 0 .cse63)))) (= .cse65 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= .cse65 (select (select (store .cse66 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse68 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse70 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse68 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse69 (select (select (store .cse70 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_451) 0)) (forall ((v_prenex_450 (Array Int Int)) (v_prenex_452 (Array Int Int))) (let ((.cse67 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse68 v_ArrVal_991)) v_ArrVal_991 v_prenex_452) v_prenex_451 v_prenex_450) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse67 0) (= v_ArrVal_991 .cse67)))) (= .cse69 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= .cse69 (select (select (store .cse70 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (or (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (and (= (select .cse4 .cse1) 0) (= (select .cse2 .cse1) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.offset| (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse71 (select (select (store (store .cse72 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse71 (select (select (store (store .cse72 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse71 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (= v_ArrVal_991 .cse71))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse74 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse74 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse73 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse74 v_ArrVal_991)) v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse73) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse73)) (= 0 .cse73)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse75 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store .cse75 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse79 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse77 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse79 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse76 (select (select (store .cse77 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (= .cse76 (select (select (store .cse77 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse78 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse79 v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse78)) (= .cse78 0)))) (= .cse76 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int) (v_prenex_556 (Array Int Int))) (let ((.cse83 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse83 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse81 (select (select (store .cse80 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store .cse80 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse81) (= .cse81 0) (forall ((v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse82 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse83 v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse82)) (= .cse82 0))))))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse84 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse84 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse85 (select (select (store .cse86 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_559 (Array Int Int)) (v_prenex_557 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse84 v_ArrVal_991)) v_ArrVal_991 v_prenex_559) v_prenex_558 v_prenex_557) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_558) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (= .cse85 (select (select (store .cse86 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= .cse85 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse89 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse88 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse89 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse87 (select (select (store .cse88 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (or (= .cse87 (select (select (store .cse88 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse88 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse89 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (= .cse87 0)))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse91 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse90 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse91 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse90 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse91 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (= (select (select (store .cse90 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse94 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse92 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse94 v_ArrVal_991))) (.cse93 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse94 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse92 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse93 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (forall ((v_prenex_370 (Array Int Int)) (v_prenex_368 (Array Int Int))) (= (select (select (store (store .cse92 v_ArrVal_991 v_prenex_370) v_prenex_369 v_prenex_368) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store .cse93 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_369) 0)))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse96 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse98 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse96 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse97 (select (select (store .cse98 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse95 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse96 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse95 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse95))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (= .cse97 (select (select (store .cse98 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= .cse97 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse102 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse101 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse102 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse99 (select (select (store .cse101 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse99 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (forall ((v_ArrVal_1005 (Array Int Int))) (let ((.cse100 (select (select (store .cse101 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse100 0) (= .cse99 .cse100)))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)))))))) (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse102 v_ArrVal_991)) v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse105 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse104 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse105 v_ArrVal_991)))) (let ((.cse103 (select (select (store (store .cse104 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= .cse103 (select (select (store (store .cse104 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= v_ArrVal_991 .cse103) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse105 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse108 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse107 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse108 v_ArrVal_991)))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse106 (select (select (store (store .cse107 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse106 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse106))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse107 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse108 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse110 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse110 v_ArrVal_991)))) (or (forall ((v_prenex_370 (Array Int Int)) (v_prenex_368 (Array Int Int))) (= (select (select (store (store .cse109 v_ArrVal_991 v_prenex_370) v_prenex_369 v_prenex_368) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse110 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= v_ArrVal_991 (select (select (store (store .cse109 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_369) 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse111 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse111 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse111))))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (let ((.cse113 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse115 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse113 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse114 (select (select (store .cse115 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse112 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse113 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse112 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse112))))) (= .cse114 0) (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (= (select (select (store .cse115 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse114))))))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse117 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse116 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse117 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= v_ArrVal_991 .cse116)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse116)) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_prenex_367 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse117 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_367) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse120 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse119 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse120 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse118 (select (select (store .cse119 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (or (= .cse118 (select (select (store .cse119 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse120 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_555 (Array Int Int))) (= (select (select (store .cse119 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_555) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) (= .cse118 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse125 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse123 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse125 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse121 (select (select (store .cse123 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (let ((.cse122 (select (select (store .cse123 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse121 .cse122) (= .cse122 0)))) (forall ((v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse124 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse125 v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse124)) (= .cse124 0)))) (= .cse121 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse126 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse129 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse126 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse127 (select (select (store .cse129 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_559 (Array Int Int)) (v_prenex_557 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse126 v_ArrVal_991)) v_ArrVal_991 v_prenex_559) v_prenex_558 v_prenex_557) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (let ((.cse128 (select (select (store .cse129 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse127 .cse128) (= .cse128 0)))) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_558) 0)) (= .cse127 0)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse130 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (not (= v_ArrVal_991 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse130 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse130 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse133 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse132 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse133 v_ArrVal_991)))) (let ((.cse131 (select (select (store (store .cse132 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse131 (select (select (store (store .cse132 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse131 0) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse133 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_30 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_561 Int) (v_prenex_560 (Array Int Int)) (v_prenex_562 (Array Int Int))) (let ((.cse134 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)) v_ArrVal_991 v_prenex_562) v_prenex_561 v_prenex_560) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_561) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse134)) (= .cse134 0)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse136 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse139 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse136 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse137 (select (select (store .cse139 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse135 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse136 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse135 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse135))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (let ((.cse138 (select (select (store .cse139 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse137 .cse138) (= .cse138 0)))) (= .cse137 0)))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse141 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse140 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse141 v_ArrVal_991)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse140 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse141 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (forall ((v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_372 Int)) (let ((.cse142 (select (select (store (store .cse140 v_ArrVal_991 v_prenex_373) v_prenex_372 v_prenex_371) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse142 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_372) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse142))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse143 (select (select (store (store .cse144 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse143 (select (select (store (store .cse144 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse143 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse143)) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)))))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse149 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse147 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse149 v_ArrVal_991)))) (or (forall ((v_ArrVal_1005 (Array Int Int))) (let ((.cse148 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse149 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse145 (select (select (store .cse148 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse145 0) (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_451) 0)) (forall ((v_prenex_450 (Array Int Int)) (v_prenex_452 (Array Int Int))) (let ((.cse146 (select (select (store (store .cse147 v_ArrVal_991 v_prenex_452) v_prenex_451 v_prenex_450) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse146 0) (= v_ArrVal_991 .cse146)))) (= (select (select (store .cse148 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse145))))))) (= v_ArrVal_991 (select (select (store (store .cse147 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse150 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse151 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse150 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse150 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_prenex_555 (Array Int Int))) (= (select (select (store .cse151 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_555) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)))) (= (select (select (store .cse151 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse153 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse152 (select (select (store (store .cse153 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse152 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse152)) (= v_ArrVal_991 (select (select (store (store .cse153 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse155 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse156 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse155 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse154 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse155 v_ArrVal_991)) v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse154 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse154))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse156 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store .cse156 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse160 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse158 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse160 0)) v_ArrVal_991 v_arrayElimArr_25)) (.cse157 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse160 v_ArrVal_991)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_991 (select (select (store (store .cse157 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse158 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))) (= (select (select (store .cse158 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_372 Int)) (let ((.cse159 (select (select (store (store .cse157 v_ArrVal_991 v_prenex_373) v_prenex_372 v_prenex_371) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse159 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_372) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse159))))))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int) (v_prenex_556 (Array Int Int))) (let ((.cse161 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse162 (select (select (store .cse161 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store .cse161 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse162) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= .cse162 0))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse167 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse167 v_ArrVal_991)))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse163 (select (select (store (store .cse164 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse163 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse163))))) (= v_ArrVal_991 (select (select (store (store .cse164 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_1005 (Array Int Int)) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse166 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse167 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse165 (select (select (store .cse166 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse165 0) (= (select (select (store .cse166 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse165))))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))))))) (= 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse171 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse171 v_ArrVal_991)))) (let ((.cse168 (select (select (store (store .cse170 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse169 (select (select (store (store .cse170 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse168 .cse169) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| .cse169))))) (= v_ArrVal_991 .cse168) (forall ((v_prenex_530 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse171 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_530) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse172 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse173 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse172 v_ArrVal_991)))) (or (forall ((v_prenex_445 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse172 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_445) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= v_ArrVal_991 (select (select (store (store .cse173 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store .cse173 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int)) (v_prenex_558 Int)) (let ((.cse174 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse175 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse174 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (forall ((v_prenex_559 (Array Int Int)) (v_prenex_557 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse174 v_ArrVal_991)) v_ArrVal_991 v_prenex_559) v_prenex_558 v_prenex_557) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_prenex_556 (Array Int Int))) (= (select (select (store .cse175 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_556) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_558) 0)) (= (select (select (store .cse175 v_prenex_558 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse178 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse178 v_ArrVal_991)))) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_prenex_34 (Array Int Int))) (let ((.cse176 (select (select (store (store .cse177 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse176 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse176))))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse178 0)) v_ArrVal_991 v_arrayElimArr_25) v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= v_ArrVal_991 (select (select (store (store .cse177 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse179 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse180 (select (select (store (store .cse179 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= v_ArrVal_991 (select (select (store (store .cse179 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= .cse180 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse180)))))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse183 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse181 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse183 v_ArrVal_991)))) (let ((.cse182 (select (select (store (store .cse181 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select (select (store (store .cse181 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse182) (forall ((v_prenex_352 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse183 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (not (= |v_ULTIMATE.start_main_~p~0#1.base_51| .cse182))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse184 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse184 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse184 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)))))))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse187 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse186 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse187 v_ArrVal_991)))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse185 (select (select (store (store .cse186 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse185)) (= v_ArrVal_991 .cse185)))) (forall ((v_prenex_445 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse187 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_445) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= v_ArrVal_991 (select (select (store (store .cse186 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((v_prenex_369 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_33 (Array Int Int))) (let ((.cse190 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse188 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse190 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (= (select (select (store .cse188 v_prenex_369 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse189 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse190 v_ArrVal_991)) v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= v_ArrVal_991 .cse189)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse189)) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_prenex_367 (Array Int Int))) (= 0 (select (select (store .cse188 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_367) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse192 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse191 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse192 v_ArrVal_991)))) (or (not (= v_ArrVal_991 (select (select (store (store .cse191 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (= v_ArrVal_991 (select (select (store (store .cse191 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse192 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse194 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse195 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse194 0)) v_ArrVal_991 v_arrayElimArr_25))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_451) 0)) (forall ((v_prenex_450 (Array Int Int)) (v_prenex_452 (Array Int Int))) (let ((.cse193 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse194 v_ArrVal_991)) v_ArrVal_991 v_prenex_452) v_prenex_451 v_prenex_450) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse193 0) (= v_ArrVal_991 .cse193)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1005 (Array Int Int))) (= (select (select (store .cse195 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= (select (select (store .cse195 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0))))) (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))))) (forall ((v_ArrVal_991 Int)) (or (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse197 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse196 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse197 v_ArrVal_991)))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= v_ArrVal_991 (select (select (store (store .cse196 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse197 0)) v_ArrVal_991 v_arrayElimArr_25) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (= v_ArrVal_991 (select (select (store (store .cse196 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))) (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse198 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)) v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse198) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse198)) (= 0 .cse198)))) (not (= (select |c_#valid| v_ArrVal_991) 0)))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1012 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse200 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_991)))) (let ((.cse199 (select (select (store (store .cse200 v_ArrVal_991 v_prenex_34) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse199 (select (select (store (store .cse200 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= .cse199 0) (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_30) 0)) (not (= v_prenex_30 .cse199)))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_449 (Array Int Int)) (v_prenex_448 Int) (v_prenex_447 (Array Int Int))) (let ((.cse204 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse203 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse204 v_ArrVal_991)))) (or (forall ((v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse201 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse204 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse202 (select (select (store .cse201 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_51| Int)) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) |v_ULTIMATE.start_main_~p~0#1.base_51|) 0)) (forall ((v_prenex_445 (Array Int Int))) (= (select (select (store .cse201 |v_ULTIMATE.start_main_~p~0#1.base_51| v_prenex_445) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1005 (Array Int Int))) (= .cse202 (select (select (store .cse201 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store (store .cse203 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (= .cse202 0))))) (= v_ArrVal_991 (select (select (store (store .cse203 v_ArrVal_991 v_prenex_449) v_prenex_448 v_prenex_447) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))))))) (forall ((v_ArrVal_991 Int)) (or (not (= (select |c_#valid| v_ArrVal_991) 0)) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_25| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 (+ 4 |v_ULTIMATE.start_main_~tail~0#1.offset_25|)) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse209 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse206 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse2 .cse209 v_ArrVal_991)))) (or (forall ((v_prenex_454 Int) (v_prenex_453 (Array Int Int)) (v_prenex_455 (Array Int Int))) (let ((.cse205 (select (select (store (store .cse206 v_ArrVal_991 v_prenex_455) v_prenex_454 v_prenex_453) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (not (= (select (store |c_#valid| v_ArrVal_991 1) v_prenex_454) 0)) (= v_ArrVal_991 .cse205) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse205)) (= 0 .cse205)))) (= v_ArrVal_991 (select (select (store (store .cse206 v_ArrVal_991 v_ArrVal_1012) |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1006) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_ArrVal_1005 (Array Int Int)) (v_prenex_451 Int) (v_prenex_33 (Array Int Int))) (let ((.cse208 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse209 0)) v_ArrVal_991 v_arrayElimArr_25))) (let ((.cse207 (select (select (store .cse208 |v_ULTIMATE.start_main_~p~0#1.base_51| v_ArrVal_1005) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse207 0) (= (select (select (store .cse208 v_prenex_451 v_prenex_33) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) .cse207))))))))))))))))) is different from true [2022-11-18 19:58:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:58:08,507 INFO L93 Difference]: Finished difference Result 173 states and 228 transitions. [2022-11-18 19:58:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 19:58:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 19:58:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:58:08,510 INFO L225 Difference]: With dead ends: 173 [2022-11-18 19:58:08,510 INFO L226 Difference]: Without dead ends: 153 [2022-11-18 19:58:08,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=76, Invalid=350, Unknown=2, NotChecked=78, Total=506 [2022-11-18 19:58:08,511 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:58:08,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 200 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 218 Unchecked, 0.3s Time] [2022-11-18 19:58:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-18 19:58:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2022-11-18 19:58:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.330827067669173) internal successors, (177), 133 states have internal predecessors, (177), 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-18 19:58:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 177 transitions. [2022-11-18 19:58:08,558 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 177 transitions. Word has length 24 [2022-11-18 19:58:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:58:08,558 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 177 transitions. [2022-11-18 19:58:08,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 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-18 19:58:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 177 transitions. [2022-11-18 19:58:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:58:08,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:58:08,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:58:08,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-18 19:58:08,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:58:08,765 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:58:08,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:58:08,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1668692305, now seen corresponding path program 1 times [2022-11-18 19:58:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:58:08,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269811180] [2022-11-18 19:58:08,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:08,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:58:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:58:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:58:09,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269811180] [2022-11-18 19:58:09,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269811180] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:58:09,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128135834] [2022-11-18 19:58:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:09,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:58:09,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:58:09,266 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:58:09,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 19:58:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:09,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-18 19:58:09,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:58:09,461 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 11 treesize of output 7 [2022-11-18 19:58:09,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:58:09,694 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:58:09,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:58:09,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:09,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-18 19:58:09,729 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 14 treesize of output 16 [2022-11-18 19:58:09,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:09,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:09,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:58:09,961 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 19:58:09,961 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:58:10,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:58:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:58:10,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:58:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:58:10,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128135834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:58:10,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:58:10,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-18 19:58:10,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708362218] [2022-11-18 19:58:10,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:58:10,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 19:58:10,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:58:10,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 19:58:10,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-18 19:58:10,605 INFO L87 Difference]: Start difference. First operand 134 states and 177 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:58:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:58:11,490 INFO L93 Difference]: Finished difference Result 148 states and 195 transitions. [2022-11-18 19:58:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:58:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 19:58:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:58:11,492 INFO L225 Difference]: With dead ends: 148 [2022-11-18 19:58:11,492 INFO L226 Difference]: Without dead ends: 134 [2022-11-18 19:58:11,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=483, Unknown=2, NotChecked=0, Total=650 [2022-11-18 19:58:11,493 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:58:11,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 136 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 46 Unchecked, 0.3s Time] [2022-11-18 19:58:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-18 19:58:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-18 19:58:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.300751879699248) internal successors, (173), 133 states have internal predecessors, (173), 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-18 19:58:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2022-11-18 19:58:11,541 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 24 [2022-11-18 19:58:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:58:11,541 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2022-11-18 19:58:11,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:58:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2022-11-18 19:58:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 19:58:11,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:58:11,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:58:11,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 19:58:11,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 19:58:11,747 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:58:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:58:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468414, now seen corresponding path program 1 times [2022-11-18 19:58:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:58:11,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234884464] [2022-11-18 19:58:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:58:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:58:12,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:58:12,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234884464] [2022-11-18 19:58:12,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234884464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:58:12,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4942853] [2022-11-18 19:58:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:12,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:58:12,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:58:12,275 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:58:12,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 19:58:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:12,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 19:58:12,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:58:12,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 19:58:12,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:58:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:58:12,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:58:13,086 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 19:58:13,086 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 45 treesize of output 33 [2022-11-18 19:58:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:58:13,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4942853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:58:13,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:58:13,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2022-11-18 19:58:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352213790] [2022-11-18 19:58:13,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:58:13,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:58:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:58:13,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:58:13,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:58:13,181 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:58:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:58:14,869 INFO L93 Difference]: Finished difference Result 289 states and 384 transitions. [2022-11-18 19:58:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 19:58:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 19:58:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:58:14,871 INFO L225 Difference]: With dead ends: 289 [2022-11-18 19:58:14,871 INFO L226 Difference]: Without dead ends: 252 [2022-11-18 19:58:14,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=389, Invalid=943, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 19:58:14,873 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 175 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:58:14,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 233 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 209 Invalid, 0 Unknown, 32 Unchecked, 0.6s Time] [2022-11-18 19:58:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-18 19:58:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 141. [2022-11-18 19:58:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 140 states have internal predecessors, (192), 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-18 19:58:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2022-11-18 19:58:14,926 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 26 [2022-11-18 19:58:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:58:14,927 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2022-11-18 19:58:14,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:58:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2022-11-18 19:58:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 19:58:14,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:58:14,928 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:58:14,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 19:58:15,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 19:58:15,130 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:58:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:58:15,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1935150334, now seen corresponding path program 1 times [2022-11-18 19:58:15,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:58:15,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67631234] [2022-11-18 19:58:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:58:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:58:15,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:58:15,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67631234] [2022-11-18 19:58:15,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67631234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:58:15,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624048179] [2022-11-18 19:58:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:15,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:58:15,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:58:15,474 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:58:15,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 19:58:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:15,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 19:58:15,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:58:15,624 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 11 treesize of output 7 [2022-11-18 19:58:15,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 19:58:15,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:58:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:58:16,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:58:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:58:16,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624048179] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:58:16,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:58:16,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2022-11-18 19:58:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561846546] [2022-11-18 19:58:16,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:58:16,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:58:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:58:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:58:16,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:58:16,297 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 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-18 19:58:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:58:16,911 INFO L93 Difference]: Finished difference Result 167 states and 221 transitions. [2022-11-18 19:58:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 19:58:16,912 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 19:58:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:58:16,913 INFO L225 Difference]: With dead ends: 167 [2022-11-18 19:58:16,913 INFO L226 Difference]: Without dead ends: 157 [2022-11-18 19:58:16,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2022-11-18 19:58:16,915 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:58:16,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-11-18 19:58:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-18 19:58:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-18 19:58:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 156 states have internal predecessors, (208), 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-18 19:58:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 208 transitions. [2022-11-18 19:58:16,958 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 208 transitions. Word has length 26 [2022-11-18 19:58:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:58:16,958 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 208 transitions. [2022-11-18 19:58:16,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 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-18 19:58:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2022-11-18 19:58:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 19:58:16,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:58:16,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:58:16,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 19:58:17,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 19:58:17,165 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:58:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:58:17,165 INFO L85 PathProgramCache]: Analyzing trace with hash 589687314, now seen corresponding path program 3 times [2022-11-18 19:58:17,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:58:17,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083038208] [2022-11-18 19:58:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:17,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:58:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:58:18,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:58:18,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083038208] [2022-11-18 19:58:18,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083038208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:58:18,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066213019] [2022-11-18 19:58:18,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:58:18,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:58:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:58:18,439 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:58:18,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3dbe29-ded1-435e-8f56-6a6a78d81ded/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 19:58:18,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 19:58:18,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:58:18,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-18 19:58:18,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:58:18,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:58:18,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:18,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:18,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-11-18 19:58:18,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:18,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:18,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-11-18 19:58:18,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-18 19:58:18,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:58:18,851 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 19:58:18,852 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 46 [2022-11-18 19:58:18,928 INFO L321 Elim1Store]: treesize reduction 22, result has 57.7 percent of original size [2022-11-18 19:58:18,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 55 [2022-11-18 19:58:18,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:58:18,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-11-18 19:58:18,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:58:18,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2022-11-18 19:58:19,036 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-18 19:58:19,037 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 17 treesize of output 17 [2022-11-18 19:58:19,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:19,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-18 19:58:19,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:19,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:58:19,449 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:58:19,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2022-11-18 19:58:19,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:19,717 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:58:19,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2022-11-18 19:58:19,755 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-18 19:58:19,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-18 19:58:19,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:58:19,878 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-18 19:58:19,879 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-11-18 19:58:19,908 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 19:58:19,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-18 19:58:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:58:19,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:58:20,630 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-11-18 19:58:20,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 489 treesize of output 432 [2022-11-18 19:58:20,893 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-11-18 19:58:20,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 757 treesize of output 612 [2022-11-18 19:58:21,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:21,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2996 treesize of output 2956 [2022-11-18 19:58:21,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:21,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 6776 treesize of output 6640 [2022-11-18 19:58:22,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:22,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 14730 treesize of output 14270 [2022-11-18 19:58:23,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:23,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 53718 treesize of output 43174 [2022-11-18 19:58:29,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:29,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 102 [2022-11-18 19:58:30,309 WARN L207 Elim1Store]: Array PQE input equivalent to true