./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:37:30,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:37:30,181 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 12:37:30,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:37:30,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:37:30,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:37:30,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:37:30,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:37:30,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:37:30,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:37:30,214 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:37:30,215 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:37:30,215 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:37:30,216 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:37:30,216 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:37:30,217 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:37:30,217 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:37:30,218 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:37:30,218 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:37:30,219 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:37:30,219 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:37:30,220 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:37:30,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:37:30,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:37:30,222 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:37:30,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:37:30,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:37:30,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:37:30,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:37:30,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:37:30,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:37:30,224 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:37:30,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:37:30,225 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:37:30,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:37:30,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:37:30,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:37:30,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:37:30,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:37:30,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:37:30,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:37:30,227 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:37:30,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:37:30,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:37:30,227 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:37:30,228 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:37:30,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:37:30,228 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/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_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 [2023-12-02 12:37:30,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:37:30,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:37:30,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:37:30,465 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:37:30,465 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:37:30,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2023-12-02 12:37:33,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:37:33,398 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:37:33,399 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2023-12-02 12:37:33,413 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/data/28f85f92a/65a6d269257945a880a5f9aed1cfac31/FLAGa7a3f4099 [2023-12-02 12:37:33,425 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/data/28f85f92a/65a6d269257945a880a5f9aed1cfac31 [2023-12-02 12:37:33,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:37:33,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:37:33,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:37:33,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:37:33,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:37:33,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f595aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33, skipping insertion in model container [2023-12-02 12:37:33,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,483 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:37:33,722 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2023-12-02 12:37:33,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:37:33,737 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:37:33,779 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2023-12-02 12:37:33,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:37:33,806 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:37:33,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33 WrapperNode [2023-12-02 12:37:33,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:37:33,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:37:33,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:37:33,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:37:33,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,850 INFO L138 Inliner]: procedures = 126, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2023-12-02 12:37:33,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:37:33,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:37:33,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:37:33,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:37:33,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:37:33,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:37:33,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:37:33,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:37:33,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (1/1) ... [2023-12-02 12:37:33,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:37:33,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:37:33,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:37:33,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:37:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-02 12:37:33,957 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-02 12:37:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 12:37:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 12:37:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:37:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:37:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:37:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:37:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:37:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:37:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:37:33,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:37:34,078 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:37:34,080 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:37:34,125 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-02 12:37:34,345 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:37:34,419 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:37:34,420 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 12:37:34,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:34 BoogieIcfgContainer [2023-12-02 12:37:34,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:37:34,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:37:34,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:37:34,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:37:34,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:37:33" (1/3) ... [2023-12-02 12:37:34,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c75c247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:37:34, skipping insertion in model container [2023-12-02 12:37:34,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:33" (2/3) ... [2023-12-02 12:37:34,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c75c247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:37:34, skipping insertion in model container [2023-12-02 12:37:34,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:34" (3/3) ... [2023-12-02 12:37:34,431 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2023-12-02 12:37:34,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:37:34,450 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 12:37:34,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:37:34,499 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@683095b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:37:34,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 12:37:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 12:37:34,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:37:34,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:37:34,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:37:34,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:37:34,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1520544426, now seen corresponding path program 1 times [2023-12-02 12:37:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:37:34,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033524727] [2023-12-02 12:37:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:34,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:37:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:34,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:37:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033524727] [2023-12-02 12:37:34,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033524727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:37:34,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:37:34,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:37:34,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590488288] [2023-12-02 12:37:34,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:37:34,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 12:37:34,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:37:34,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 12:37:34,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 12:37:34,701 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 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) [2023-12-02 12:37:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:37:34,756 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2023-12-02 12:37:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 12:37:34,759 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 [2023-12-02 12:37:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:37:34,766 INFO L225 Difference]: With dead ends: 49 [2023-12-02 12:37:34,766 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 12:37:34,769 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 [2023-12-02 12:37:34,773 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:37:34,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:37:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 12:37:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-02 12:37:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-02 12:37:34,802 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-12-02 12:37:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:37:34,803 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-02 12:37:34,803 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) [2023-12-02 12:37:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-02 12:37:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 12:37:34,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:37:34,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:37:34,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:37:34,805 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:37:34,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:37:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash -334874522, now seen corresponding path program 1 times [2023-12-02 12:37:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:37:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114011325] [2023-12-02 12:37:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:37:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:35,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:37:35,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114011325] [2023-12-02 12:37:35,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114011325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:37:35,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:37:35,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:37:35,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531377737] [2023-12-02 12:37:35,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:37:35,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:37:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:37:35,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:37:35,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:37:35,029 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:37:35,098 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-12-02 12:37:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:37:35,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2023-12-02 12:37:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:37:35,099 INFO L225 Difference]: With dead ends: 28 [2023-12-02 12:37:35,100 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 12:37:35,100 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 [2023-12-02 12:37:35,101 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:37:35,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:37:35,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 12:37:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2023-12-02 12:37:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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) [2023-12-02 12:37:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-02 12:37:35,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2023-12-02 12:37:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:37:35,108 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-02 12:37:35,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-02 12:37:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 12:37:35,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:37:35,109 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:37:35,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 12:37:35,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:37:35,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:37:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 966956042, now seen corresponding path program 1 times [2023-12-02 12:37:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:37:35,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607426649] [2023-12-02 12:37:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:37:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:35,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:37:35,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607426649] [2023-12-02 12:37:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607426649] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:37:35,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994911128] [2023-12-02 12:37:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:35,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:37:35,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:37:35,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:37:35,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:37:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:35,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 12:37:35,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:37:35,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:37:35,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:37:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:35,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:37:35,657 INFO L378 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 21 [2023-12-02 12:37:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:37:35,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:37:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994911128] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:37:35,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [167459537] [2023-12-02 12:37:35,709 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-12-02 12:37:35,709 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:37:35,712 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:37:35,716 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:37:35,716 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:37:36,293 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:37:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [167459537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:37:37,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:37:37,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 14 [2023-12-02 12:37:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737502631] [2023-12-02 12:37:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:37:37,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 12:37:37,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:37:37,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 12:37:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=123, Unknown=2, NotChecked=0, Total=182 [2023-12-02 12:37:37,290 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:37:37,674 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-12-02 12:37:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 12:37:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 12:37:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:37:37,676 INFO L225 Difference]: With dead ends: 23 [2023-12-02 12:37:37,676 INFO L226 Difference]: Without dead ends: 15 [2023-12-02 12:37:37,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=123, Unknown=2, NotChecked=0, Total=182 [2023-12-02 12:37:37,678 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:37:37,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 12:37:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-02 12:37:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-02 12:37:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-12-02 12:37:37,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2023-12-02 12:37:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:37:37,683 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-12-02 12:37:37,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-12-02 12:37:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 12:37:37,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:37:37,684 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:37:37,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:37:37,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:37:37,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:37:37,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:37:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash -932787123, now seen corresponding path program 1 times [2023-12-02 12:37:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:37:37,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462730006] [2023-12-02 12:37:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:37:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:38,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:37:38,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462730006] [2023-12-02 12:37:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462730006] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:37:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693447894] [2023-12-02 12:37:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:38,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:37:38,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:37:38,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:37:38,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 12:37:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:38,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 12:37:38,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:37:38,265 INFO L378 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 [2023-12-02 12:37:38,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:37:38,336 INFO L378 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 [2023-12-02 12:37:38,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:37:38,395 INFO L378 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 23 treesize of output 11 [2023-12-02 12:37:38,434 INFO L378 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 11 [2023-12-02 12:37:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:38,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:37:38,466 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_115) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-12-02 12:37:38,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_112 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_115) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_112 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_112 .cse0))))))) is different from false [2023-12-02 12:37:38,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:37:38,530 INFO L378 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 70 treesize of output 74 [2023-12-02 12:37:38,546 INFO L378 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 50 treesize of output 46 [2023-12-02 12:37:38,605 INFO L378 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 143 treesize of output 137 [2023-12-02 12:37:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:37:38,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693447894] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:37:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [405206551] [2023-12-02 12:37:38,726 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-12-02 12:37:38,726 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:37:38,726 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:37:38,726 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:37:38,727 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:37:43,430 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:37:51,816 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '392#(and (exists ((|v_#memory_$Pointer$.base_11| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_37| Int) (|v_#memory_$Pointer$.offset_11| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (not (= |ULTIMATE.start_main_~t~0#1.base| 0)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (store |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37| (select (select |v_#memory_$Pointer$.offset_11| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37|))) |v_#memory_$Pointer$.offset_11|) (= (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37| (select (select |v_#memory_$Pointer$.base_11| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37|))) |v_#memory_$Pointer$.base_11|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_11| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.offset_11| |v_ULTIMATE.start_main_~p~0#1.base_39|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_37| 4) 0))) (= (store |v_#memory_$Pointer$.base_11| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.base_11| |v_ULTIMATE.start_main_~p~0#1.base_39|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_37| 4) 0)) |#memory_$Pointer$.base|) (exists ((|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_38| Int) (|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_38| (store (select |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4 |ULTIMATE.start_main_~t~0#1.base|)) |v_#memory_$Pointer$.base_72|) (= (store |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_main_~p~0#1.base_38| (store (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4 0)) |v_#memory_$Pointer$.offset_71|) (= |v_ULTIMATE.start_main_~p~0#1.offset_37| (select (select |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4)) (= (select (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4) |v_ULTIMATE.start_main_~p~0#1.base_39|) (= |v_#memory_int_98| (store |v_#memory_int_97| |v_ULTIMATE.start_main_~p~0#1.base_38| (store (select |v_#memory_int_97| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4 (select (select |v_#memory_int_98| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4)))))) (= |#memory_int| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37| 1) (+ |v_ULTIMATE.start_main_~p~0#1.offset_37| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_39|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_37| 4))))) (= |ULTIMATE.start_main_~t~0#1.offset| 0))) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|)))' at error location [2023-12-02 12:37:51,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:37:51,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:37:51,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-12-02 12:37:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552235267] [2023-12-02 12:37:51,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:37:51,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 12:37:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:37:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 12:37:51,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=435, Unknown=5, NotChecked=86, Total=600 [2023-12-02 12:37:51,818 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 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) [2023-12-02 12:37:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:37:52,039 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-02 12:37:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:37:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 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 13 [2023-12-02 12:37:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:37:52,040 INFO L225 Difference]: With dead ends: 32 [2023-12-02 12:37:52,040 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 12:37:52,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=135, Invalid=680, Unknown=5, NotChecked=110, Total=930 [2023-12-02 12:37:52,042 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:37:52,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 64 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2023-12-02 12:37:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 12:37:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2023-12-02 12:37:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-12-02 12:37:52,047 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2023-12-02 12:37:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:37:52,048 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-12-02 12:37:52,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 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) [2023-12-02 12:37:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-12-02 12:37:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 12:37:52,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:37:52,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:37:52,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 12:37:52,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:37:52,250 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:37:52,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:37:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash -217963837, now seen corresponding path program 1 times [2023-12-02 12:37:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:37:52,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190068058] [2023-12-02 12:37:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:37:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:52,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:37:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190068058] [2023-12-02 12:37:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190068058] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:37:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530790296] [2023-12-02 12:37:52,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:37:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:37:52,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:37:52,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 12:37:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:52,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 12:37:52,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:37:52,795 INFO L378 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 [2023-12-02 12:37:52,835 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:37:52,835 INFO L378 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 [2023-12-02 12:37:52,863 INFO L378 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 15 treesize of output 1 [2023-12-02 12:37:52,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:37:52,932 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 12:37:52,933 INFO L378 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 71 treesize of output 62 [2023-12-02 12:37:52,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-02 12:37:52,943 INFO L378 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 24 treesize of output 11 [2023-12-02 12:37:53,000 INFO L378 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 [2023-12-02 12:37:53,007 INFO L378 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 7 treesize of output 3 [2023-12-02 12:37:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:53,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:37:53,056 INFO L378 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 199 treesize of output 177 [2023-12-02 12:37:53,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:37:53,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 12:37:53,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:37:53,147 INFO L378 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 36 treesize of output 35 [2023-12-02 12:37:53,160 INFO L378 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 7 treesize of output 3 [2023-12-02 12:37:53,166 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:37:53,167 INFO L378 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 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-02 12:37:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:53,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530790296] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:37:53,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1474361737] [2023-12-02 12:37:53,265 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 12:37:53,265 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:37:53,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:37:53,265 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:37:53,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:37:57,777 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:37:58,991 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '477#true' at error location [2023-12-02 12:37:58,991 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:37:58,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:37:58,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-12-02 12:37:58,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973735631] [2023-12-02 12:37:58,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:37:58,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 12:37:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:37:58,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 12:37:58,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=403, Unknown=2, NotChecked=0, Total=462 [2023-12-02 12:37:58,993 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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) [2023-12-02 12:37:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:37:59,250 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-12-02 12:37:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:37:59,250 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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 16 [2023-12-02 12:37:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:37:59,251 INFO L225 Difference]: With dead ends: 35 [2023-12-02 12:37:59,251 INFO L226 Difference]: Without dead ends: 33 [2023-12-02 12:37:59,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=640, Unknown=3, NotChecked=0, Total=756 [2023-12-02 12:37:59,252 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 81 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:37:59,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 55 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:37:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-02 12:37:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-02 12:37:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:37:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-02 12:37:59,256 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2023-12-02 12:37:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:37:59,256 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-02 12:37:59,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 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) [2023-12-02 12:37:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-02 12:37:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 12:37:59,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:37:59,257 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:37:59,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 12:37:59,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:37:59,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:37:59,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:37:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash 989402292, now seen corresponding path program 2 times [2023-12-02 12:37:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:37:59,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183292274] [2023-12-02 12:37:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:37:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:37:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:37:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:37:59,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:37:59,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183292274] [2023-12-02 12:37:59,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183292274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:37:59,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373381848] [2023-12-02 12:37:59,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:37:59,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:37:59,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:37:59,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:37:59,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 12:38:00,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 12:38:00,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:38:00,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 12:38:00,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:38:00,011 INFO L378 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 [2023-12-02 12:38:00,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:38:00,054 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 12:38:00,054 INFO L378 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 19 treesize of output 16 [2023-12-02 12:38:00,096 INFO L378 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 23 treesize of output 11 [2023-12-02 12:38:00,125 INFO L378 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 11 [2023-12-02 12:38:00,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:38:00,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 12:38:00,169 INFO L378 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 16 treesize of output 11 [2023-12-02 12:38:00,188 INFO L378 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 11 [2023-12-02 12:38:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:38:00,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:38:00,212 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_274 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_274) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-12-02 12:38:00,294 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_271 (Array Int Int)) (v_ArrVal_274 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_25| Int) (v_ArrVal_269 (Array Int Int))) (or (not (= v_ArrVal_269 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_269 .cse0))))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_271) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_274) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_25|) 0)))) is different from false [2023-12-02 12:38:00,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:00,321 INFO L378 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 252 treesize of output 254 [2023-12-02 12:38:00,330 INFO L378 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 110 treesize of output 102 [2023-12-02 12:38:00,344 INFO L378 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 50 treesize of output 46 [2023-12-02 12:38:00,397 INFO L378 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 [2023-12-02 12:38:00,415 INFO L378 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 89 treesize of output 85 [2023-12-02 12:38:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 12:38:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373381848] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:38:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [291341964] [2023-12-02 12:38:00,668 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-12-02 12:38:00,668 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:38:00,668 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:38:00,668 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:38:00,668 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:38:05,060 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:38:13,537 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '790#(and (exists ((|v_#memory_$Pointer$.base_11| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_59| Int) (|v_ULTIMATE.start_main_~p~0#1.base_64| Int) (|v_#memory_$Pointer$.offset_11| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_63| Int) (|v_#memory_$Pointer$.base_102| (Array Int (Array Int Int)))) (and (= |v_ULTIMATE.start_main_~p~0#1.base_64| (select (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_main_~p~0#1.base_63|) 4)) (= (select (select |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_main_~p~0#1.base_63|) 4) |v_ULTIMATE.start_main_~p~0#1.offset_59|) (= (store |v_#memory_int_125| |v_ULTIMATE.start_main_~p~0#1.base_63| (store (select |v_#memory_int_125| |v_ULTIMATE.start_main_~p~0#1.base_63|) 4 (select (select |v_#memory_int_126| |v_ULTIMATE.start_main_~p~0#1.base_63|) 4))) |v_#memory_int_126|) (= (store |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~p~0#1.base_63| (store (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~p~0#1.base_63|) 4 |ULTIMATE.start_main_~t~0#1.base|)) |v_#memory_$Pointer$.base_103|) (= (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_main_~p~0#1.base_63| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_main_~p~0#1.base_63|) 4 0)) |v_#memory_$Pointer$.offset_100|))) (not (= |ULTIMATE.start_main_~t~0#1.base| 0)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_11| |v_ULTIMATE.start_main_~p~0#1.base_64| (store (select |v_#memory_$Pointer$.offset_11| |v_ULTIMATE.start_main_~p~0#1.base_64|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_59| 4) 0))) (= |#memory_int| (store |v_#memory_int_126| |v_ULTIMATE.start_main_~p~0#1.base_64| (store (store (select |v_#memory_int_126| |v_ULTIMATE.start_main_~p~0#1.base_64|) |v_ULTIMATE.start_main_~p~0#1.offset_59| 1) (+ |v_ULTIMATE.start_main_~p~0#1.offset_59| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_64|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_59| 4))))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_11| |v_ULTIMATE.start_main_~p~0#1.base_64| (store (select |v_#memory_$Pointer$.base_11| |v_ULTIMATE.start_main_~p~0#1.base_64|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_59| 4) 0))) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_main_~p~0#1.base_64| (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_main_~p~0#1.base_64|) |v_ULTIMATE.start_main_~p~0#1.offset_59| (select (select |v_#memory_$Pointer$.base_11| |v_ULTIMATE.start_main_~p~0#1.base_64|) |v_ULTIMATE.start_main_~p~0#1.offset_59|))) |v_#memory_$Pointer$.base_11|) (= (store |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_main_~p~0#1.base_64| (store (select |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_main_~p~0#1.base_64|) |v_ULTIMATE.start_main_~p~0#1.offset_59| (select (select |v_#memory_$Pointer$.offset_11| |v_ULTIMATE.start_main_~p~0#1.base_64|) |v_ULTIMATE.start_main_~p~0#1.offset_59|))) |v_#memory_$Pointer$.offset_11|) (= |ULTIMATE.start_main_~t~0#1.offset| 0))) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|)))' at error location [2023-12-02 12:38:13,537 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:38:13,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:38:13,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-12-02 12:38:13,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012983751] [2023-12-02 12:38:13,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:38:13,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 12:38:13,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:38:13,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 12:38:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=555, Unknown=9, NotChecked=98, Total=756 [2023-12-02 12:38:13,539 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:38:13,768 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-12-02 12:38:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:38:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 17 [2023-12-02 12:38:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:38:13,769 INFO L225 Difference]: With dead ends: 30 [2023-12-02 12:38:13,769 INFO L226 Difference]: Without dead ends: 28 [2023-12-02 12:38:13,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=142, Invalid=727, Unknown=9, NotChecked=114, Total=992 [2023-12-02 12:38:13,770 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:38:13,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2023-12-02 12:38:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-02 12:38:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-12-02 12:38:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-02 12:38:13,776 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2023-12-02 12:38:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:38:13,776 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-02 12:38:13,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-02 12:38:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 12:38:13,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:38:13,777 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:38:13,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 12:38:13,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:38:13,978 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:38:13,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:38:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash 634695821, now seen corresponding path program 2 times [2023-12-02 12:38:13,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:38:13,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115162452] [2023-12-02 12:38:13,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:38:13,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:38:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:38:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:38:14,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:38:14,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115162452] [2023-12-02 12:38:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115162452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:38:14,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827650003] [2023-12-02 12:38:14,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:38:14,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:38:14,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:38:14,376 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:38:14,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 12:38:14,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 12:38:14,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:38:14,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 12:38:14,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:38:14,478 INFO L378 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 [2023-12-02 12:38:14,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:38:14,507 INFO L378 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 [2023-12-02 12:38:14,531 INFO L378 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 15 treesize of output 1 [2023-12-02 12:38:14,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:38:14,582 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-02 12:38:14,583 INFO L378 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 35 treesize of output 36 [2023-12-02 12:38:14,586 INFO L378 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 23 [2023-12-02 12:38:14,589 INFO L378 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 12 treesize of output 11 [2023-12-02 12:38:14,597 INFO L378 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 12 treesize of output 11 [2023-12-02 12:38:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:38:14,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:38:14,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:14,763 INFO L378 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 45 treesize of output 49 [2023-12-02 12:38:14,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:14,770 INFO L378 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 40 treesize of output 39 [2023-12-02 12:38:14,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:14,785 INFO L378 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 45 treesize of output 44 [2023-12-02 12:38:14,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:14,790 INFO L378 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 35 treesize of output 39 [2023-12-02 12:38:14,803 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) 0))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) 0) (not (= (select v_arrayElimArr_5 .cse0) 0)))))) is different from false [2023-12-02 12:38:14,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:14,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 12:38:14,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:14,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 12:38:14,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:14,877 INFO L378 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 72 treesize of output 71 [2023-12-02 12:38:14,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:14,901 INFO L378 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 38 treesize of output 38 [2023-12-02 12:38:15,136 INFO L349 Elim1Store]: treesize reduction 34, result has 83.2 percent of original size [2023-12-02 12:38:15,137 INFO L378 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 184 treesize of output 295 [2023-12-02 12:38:15,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:15,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 166 [2023-12-02 12:38:20,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:20,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 12:38:20,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:20,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 12:38:20,242 INFO L349 Elim1Store]: treesize reduction 84, result has 25.0 percent of original size [2023-12-02 12:38:20,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 111 [2023-12-02 12:38:20,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:38:20,257 INFO L378 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 43 treesize of output 37 [2023-12-02 12:38:20,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:38:20,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:38:20,267 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2023-12-02 12:38:20,272 INFO L378 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 [2023-12-02 12:38:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:38:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827650003] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:38:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1926787342] [2023-12-02 12:38:20,483 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 12:38:20,483 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:38:20,483 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:38:20,483 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:38:20,483 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:38:24,986 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:38:25,867 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '875#true' at error location [2023-12-02 12:38:25,868 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:38:25,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:38:25,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-12-02 12:38:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122223817] [2023-12-02 12:38:25,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:38:25,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 12:38:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:38:25,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 12:38:25,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=404, Unknown=1, NotChecked=40, Total=506 [2023-12-02 12:38:25,870 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:38:26,151 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-12-02 12:38:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:38:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 12:38:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:38:26,152 INFO L225 Difference]: With dead ends: 37 [2023-12-02 12:38:26,152 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 12:38:26,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=606, Unknown=1, NotChecked=50, Total=756 [2023-12-02 12:38:26,153 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:38:26,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 76 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2023-12-02 12:38:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 12:38:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-12-02 12:38:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-12-02 12:38:26,156 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-12-02 12:38:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:38:26,157 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-12-02 12:38:26,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-12-02 12:38:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 12:38:26,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:38:26,157 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:38:26,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 12:38:26,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:38:26,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:38:26,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:38:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1072059140, now seen corresponding path program 3 times [2023-12-02 12:38:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:38:26,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760018510] [2023-12-02 12:38:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:38:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:38:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:38:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:38:27,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:38:27,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760018510] [2023-12-02 12:38:27,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760018510] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:38:27,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484812129] [2023-12-02 12:38:27,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 12:38:27,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:38:27,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:38:27,060 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:38:27,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 12:38:27,248 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 12:38:27,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:38:27,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 12:38:27,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:38:27,259 INFO L378 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 [2023-12-02 12:38:27,310 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 12:38:27,311 INFO L378 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 [2023-12-02 12:38:27,358 INFO L378 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 15 treesize of output 1 [2023-12-02 12:38:27,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:38:27,412 INFO L378 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 11 [2023-12-02 12:38:27,430 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 12:38:27,430 INFO L378 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 [2023-12-02 12:38:27,438 INFO L378 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 16 treesize of output 11 [2023-12-02 12:38:27,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:38:27,495 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-02 12:38:27,495 INFO L378 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 129 treesize of output 79 [2023-12-02 12:38:27,500 INFO L378 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 39 treesize of output 15 [2023-12-02 12:38:27,507 INFO L378 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 24 treesize of output 11 [2023-12-02 12:38:27,601 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 12:38:27,602 INFO L378 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2023-12-02 12:38:27,607 INFO L378 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 32 treesize of output 11 [2023-12-02 12:38:27,614 INFO L378 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 36 treesize of output 15 [2023-12-02 12:38:27,683 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:38:27,683 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2023-12-02 12:38:27,688 INFO L378 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 7 treesize of output 3 [2023-12-02 12:38:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:38:27,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:38:27,745 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2023-12-02 12:38:27,768 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_432 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_432 .cse0)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_432) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_436) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)))) is different from false [2023-12-02 12:38:27,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:27,792 INFO L378 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 42 treesize of output 46 [2023-12-02 12:38:27,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:27,804 INFO L378 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 262 treesize of output 266 [2023-12-02 12:38:27,812 INFO L378 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 226 treesize of output 190 [2023-12-02 12:38:27,865 INFO L378 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 527 treesize of output 473 [2023-12-02 12:38:27,951 INFO L378 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 33 treesize of output 25 [2023-12-02 12:38:27,964 INFO L378 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 30 treesize of output 22 [2023-12-02 12:38:28,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 12:38:28,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,076 INFO L378 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 107 treesize of output 106 [2023-12-02 12:38:28,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,087 INFO L378 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 101 treesize of output 69 [2023-12-02 12:38:28,092 INFO L378 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 54 treesize of output 46 [2023-12-02 12:38:28,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 12:38:28,180 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:38:28,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,188 INFO L378 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 36 treesize of output 35 [2023-12-02 12:38:28,199 INFO L378 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 7 treesize of output 3 [2023-12-02 12:38:28,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:38:28,212 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:38:28,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,223 INFO L378 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 36 treesize of output 35 [2023-12-02 12:38:28,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,242 INFO L378 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 22 treesize of output 22 [2023-12-02 12:38:28,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-12-02 12:38:28,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:38:28,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:28,268 INFO L378 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 43 treesize of output 42 [2023-12-02 12:38:28,276 INFO L378 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 26 treesize of output 22 [2023-12-02 12:38:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 12:38:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484812129] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:38:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [984387634] [2023-12-02 12:38:28,799 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 12:38:28,799 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:38:28,800 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:38:28,800 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:38:28,800 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:38:33,217 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:38:34,367 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1089#true' at error location [2023-12-02 12:38:34,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:38:34,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:38:34,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2023-12-02 12:38:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636796043] [2023-12-02 12:38:34,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:38:34,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 12:38:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:38:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 12:38:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=526, Unknown=3, NotChecked=94, Total=702 [2023-12-02 12:38:34,370 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:38:34,922 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-12-02 12:38:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 12:38:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 12:38:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:38:34,923 INFO L225 Difference]: With dead ends: 37 [2023-12-02 12:38:34,923 INFO L226 Difference]: Without dead ends: 35 [2023-12-02 12:38:34,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=912, Unknown=4, NotChecked=126, Total=1190 [2023-12-02 12:38:34,924 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:38:34,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 81 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 171 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2023-12-02 12:38:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-02 12:38:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-12-02 12:38:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-12-02 12:38:34,930 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2023-12-02 12:38:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:38:34,930 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-12-02 12:38:34,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:38:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-12-02 12:38:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 12:38:34,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:38:34,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:38:34,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 12:38:35,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:38:35,132 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:38:35,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:38:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -332214348, now seen corresponding path program 4 times [2023-12-02 12:38:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:38:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109461638] [2023-12-02 12:38:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:38:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:38:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:38:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:38:35,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:38:35,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109461638] [2023-12-02 12:38:35,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109461638] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:38:35,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941426229] [2023-12-02 12:38:35,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 12:38:35,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:38:35,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:38:35,970 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:38:35,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 12:38:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:38:36,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 12:38:36,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:38:36,077 INFO L378 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 [2023-12-02 12:38:36,124 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 12:38:36,124 INFO L378 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 [2023-12-02 12:38:36,164 INFO L378 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 15 treesize of output 1 [2023-12-02 12:38:36,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:38:36,208 INFO L378 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 11 [2023-12-02 12:38:36,215 INFO L378 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 11 [2023-12-02 12:38:36,234 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 12:38:36,235 INFO L378 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 [2023-12-02 12:38:36,288 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-02 12:38:36,288 INFO L378 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 105 treesize of output 67 [2023-12-02 12:38:36,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:38:36,299 INFO L378 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 27 treesize of output 22 [2023-12-02 12:38:36,377 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 12:38:36,377 INFO L378 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 89 [2023-12-02 12:38:36,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:38:36,382 INFO L378 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 43 treesize of output 25 [2023-12-02 12:38:36,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-12-02 12:38:36,578 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:38:36,578 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2023-12-02 12:38:36,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-12-02 12:38:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:38:36,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:38:36,665 INFO L378 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 451 treesize of output 393 [2023-12-02 12:38:36,682 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_534))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_537))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))) is different from false [2023-12-02 12:38:36,712 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_534))) (select (select .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_537))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))))) is different from false [2023-12-02 12:38:36,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:36,732 INFO L378 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 109 treesize of output 103 [2023-12-02 12:38:36,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:36,741 INFO L378 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 122 treesize of output 116 [2023-12-02 12:38:36,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:36,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2023-12-02 12:38:36,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:36,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2023-12-02 12:38:36,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:36,925 INFO L378 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 452 treesize of output 445 [2023-12-02 12:38:37,735 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2023-12-02 12:38:37,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 6216 treesize of output 5991 [2023-12-02 12:38:37,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:37,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 658 treesize of output 562 [2023-12-02 12:38:38,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:38,020 INFO L378 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 366 treesize of output 298 [2023-12-02 12:38:38,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:38:38,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 464 treesize of output 380 [2023-12-02 12:38:38,230 INFO L378 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 247 treesize of output 171 [2023-12-02 12:43:33,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 12:43:33,744 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 12:43:33,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2023-12-02 12:43:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [132984836] [2023-12-02 12:43:33,747 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 12:43:33,747 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:43:33,747 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:43:33,747 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:43:33,748 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:43:33,752 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:332) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:223) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2023-12-02 12:43:33,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:43:33,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-12-02 12:43:33,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857914500] [2023-12-02 12:43:33,756 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 12:43:33,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 12:43:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:43:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 12:43:33,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=263, Unknown=2, NotChecked=66, Total=380 [2023-12-02 12:43:33,758 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:33,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=263, Unknown=2, NotChecked=66, Total=380 [2023-12-02 12:43:33,759 INFO L413 NwaCegarLoop]: 0 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, 0 SdHoareTripleChecker+Invalid, 1 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 [2023-12-02 12:43:33,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:43:33,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 12:43:33,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:43:33,961 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-12-02 12:43:33,964 INFO L158 Benchmark]: Toolchain (without parser) took 360536.67ms. Allocated memory was 142.6MB in the beginning and 356.5MB in the end (delta: 213.9MB). Free memory was 94.4MB in the beginning and 261.3MB in the end (delta: -166.9MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2023-12-02 12:43:33,965 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 102.8MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:43:33,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.17ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 76.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 12:43:33,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.25ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 73.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:43:33,966 INFO L158 Benchmark]: Boogie Preprocessor took 35.49ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:43:33,966 INFO L158 Benchmark]: RCFGBuilder took 534.06ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 71.8MB in the beginning and 151.3MB in the end (delta: -79.5MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2023-12-02 12:43:33,967 INFO L158 Benchmark]: TraceAbstraction took 359539.32ms. Allocated memory was 203.4MB in the beginning and 356.5MB in the end (delta: 153.1MB). Free memory was 150.4MB in the beginning and 261.3MB in the end (delta: -110.9MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2023-12-02 12:43:33,969 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 102.8MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.17ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 76.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.25ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 73.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.49ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 534.06ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 71.8MB in the beginning and 151.3MB in the end (delta: -79.5MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * TraceAbstraction took 359539.32ms. Allocated memory was 203.4MB in the beginning and 356.5MB in the end (delta: 153.1MB). Free memory was 150.4MB in the beginning and 261.3MB in the end (delta: -110.9MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:43:35,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:43:35,905 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 12:43:35,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:43:35,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:43:35,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:43:35,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:43:35,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:43:35,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:43:35,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:43:35,946 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:43:35,947 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:43:35,948 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:43:35,948 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:43:35,949 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:43:35,949 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:43:35,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:43:35,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:43:35,952 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:43:35,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:43:35,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:43:35,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:43:35,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:43:35,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:43:35,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:43:35,955 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 12:43:35,956 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 12:43:35,956 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:43:35,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:43:35,957 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:43:35,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:43:35,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 12:43:35,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:43:35,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:43:35,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:43:35,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:43:35,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:43:35,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:43:35,960 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 12:43:35,960 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 12:43:35,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:43:35,960 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:43:35,961 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:43:35,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:43:35,961 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/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_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 [2023-12-02 12:43:36,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:43:36,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:43:36,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:43:36,270 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:43:36,270 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:43:36,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2023-12-02 12:43:39,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:43:39,391 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:43:39,392 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2023-12-02 12:43:39,409 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/data/5de5a0ad5/964ed219f0144a9f819d205b799b70fc/FLAG3f8a9d682 [2023-12-02 12:43:39,422 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/data/5de5a0ad5/964ed219f0144a9f819d205b799b70fc [2023-12-02 12:43:39,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:43:39,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:43:39,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:43:39,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:43:39,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:43:39,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec2eb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39, skipping insertion in model container [2023-12-02 12:43:39,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,479 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:43:39,750 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2023-12-02 12:43:39,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:43:39,771 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:43:39,818 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2023-12-02 12:43:39,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:43:39,852 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:43:39,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39 WrapperNode [2023-12-02 12:43:39,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:43:39,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:43:39,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:43:39,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:43:39,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,924 INFO L138 Inliner]: procedures = 129, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2023-12-02 12:43:39,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:43:39,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:43:39,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:43:39,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:43:39,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:43:39,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:43:39,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:43:39,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:43:39,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (1/1) ... [2023-12-02 12:43:39,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:43:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:43:40,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:43:40,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:43:40,065 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-02 12:43:40,066 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-02 12:43:40,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 12:43:40,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:43:40,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:43:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:43:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:43:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 12:43:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:43:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 12:43:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:43:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:43:40,189 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:43:40,191 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:43:40,244 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-02 12:43:40,791 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:43:40,835 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:43:40,836 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 12:43:40,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:43:40 BoogieIcfgContainer [2023-12-02 12:43:40,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:43:40,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:43:40,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:43:40,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:43:40,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:43:39" (1/3) ... [2023-12-02 12:43:40,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527e7830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:43:40, skipping insertion in model container [2023-12-02 12:43:40,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:43:39" (2/3) ... [2023-12-02 12:43:40,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527e7830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:43:40, skipping insertion in model container [2023-12-02 12:43:40,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:43:40" (3/3) ... [2023-12-02 12:43:40,846 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2023-12-02 12:43:40,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:43:40,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 12:43:40,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:43:40,911 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48058b68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:43:40,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 12:43:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 33 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 12:43:40,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:43:40,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:43:40,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:43:40,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:43:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1520544426, now seen corresponding path program 1 times [2023-12-02 12:43:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:43:40,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693321937] [2023-12-02 12:43:40,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:40,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:40,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:43:40,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:43:40,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 12:43:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:41,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 12:43:41,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:41,094 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:43:41,095 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:43:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693321937] [2023-12-02 12:43:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693321937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:43:41,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:43:41,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:43:41,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059813110] [2023-12-02 12:43:41,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:43:41,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 12:43:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:43:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 12:43:41,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 12:43:41,130 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 33 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 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) [2023-12-02 12:43:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:43:41,597 INFO L93 Difference]: Finished difference Result 59 states and 89 transitions. [2023-12-02 12:43:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 12:43:41,599 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 [2023-12-02 12:43:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:43:41,606 INFO L225 Difference]: With dead ends: 59 [2023-12-02 12:43:41,606 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 12:43:41,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 12:43:41,614 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:43:41,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 12:43:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 12:43:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-02 12:43:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-02 12:43:41,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-12-02 12:43:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:43:41,648 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-02 12:43:41,648 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) [2023-12-02 12:43:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-02 12:43:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 12:43:41,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:43:41,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:43:41,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:43:41,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:41,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:43:41,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:43:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash -334874522, now seen corresponding path program 1 times [2023-12-02 12:43:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:43:41,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513606987] [2023-12-02 12:43:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:41,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:41,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:43:41,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:43:41,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 12:43:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:41,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 12:43:41,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:42,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-12-02 12:43:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:42,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:43:42,084 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:43:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513606987] [2023-12-02 12:43:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513606987] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:43:42,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:43:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:43:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835772865] [2023-12-02 12:43:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:43:42,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:43:42,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:43:42,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:43:42,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:43:42,089 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:43:42,269 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-12-02 12:43:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:43:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2023-12-02 12:43:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:43:42,271 INFO L225 Difference]: With dead ends: 28 [2023-12-02 12:43:42,271 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 12:43:42,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:43:42,272 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:43:42,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:43:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 12:43:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2023-12-02 12:43:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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) [2023-12-02 12:43:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-02 12:43:42,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2023-12-02 12:43:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:43:42,279 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-02 12:43:42,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-02 12:43:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 12:43:42,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:43:42,280 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:43:42,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 12:43:42,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:42,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:43:42,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:43:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash 966956042, now seen corresponding path program 1 times [2023-12-02 12:43:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:43:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616631908] [2023-12-02 12:43:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:42,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:42,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:43:42,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:43:42,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 12:43:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:42,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 12:43:42,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:42,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 12:43:42,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 12:43:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:42,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:42,769 INFO L378 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 21 [2023-12-02 12:43:42,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:42,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:42,803 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:43:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616631908] [2023-12-02 12:43:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616631908] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1021377059] [2023-12-02 12:43:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:43:42,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:43:42,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:43:42,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-02 12:43:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:42,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 12:43:42,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:43,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:43,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:43,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:43,168 INFO L378 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 21 [2023-12-02 12:43:43,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:43,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1021377059] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:43,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349618673] [2023-12-02 12:43:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:43,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:43:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:43:43,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:43:43,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 12:43:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:43,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 12:43:43,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:43,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:43,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:43,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:43,448 INFO L378 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 21 [2023-12-02 12:43:43,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:43,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349618673] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:43,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 12:43:43,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 12:43:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225821711] [2023-12-02 12:43:43,479 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 12:43:43,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 12:43:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:43:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 12:43:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:43:43,482 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:43:43,720 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-02 12:43:43,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:43:43,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 12 [2023-12-02 12:43:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:43:43,721 INFO L225 Difference]: With dead ends: 32 [2023-12-02 12:43:43,722 INFO L226 Difference]: Without dead ends: 22 [2023-12-02 12:43:43,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-02 12:43:43,724 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:43:43,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 30 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:43:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-02 12:43:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2023-12-02 12:43:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-12-02 12:43:43,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2023-12-02 12:43:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:43:43,730 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-12-02 12:43:43,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-12-02 12:43:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 12:43:43,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:43:43,731 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:43:43,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-02 12:43:43,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 12:43:44,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-02 12:43:44,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:44,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:43:44,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:43:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash -932787123, now seen corresponding path program 1 times [2023-12-02 12:43:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:43:44,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717445210] [2023-12-02 12:43:44,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:44,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:44,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:43:44,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:43:44,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 12:43:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:44,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 12:43:44,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:44,453 INFO L378 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 7 [2023-12-02 12:43:44,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:44,561 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:43:44,562 INFO L378 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 13 treesize of output 13 [2023-12-02 12:43:44,645 INFO L378 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 27 treesize of output 11 [2023-12-02 12:43:44,707 INFO L378 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 11 [2023-12-02 12:43:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:44,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:44,766 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2023-12-02 12:43:44,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:44,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-02 12:43:44,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:44,939 INFO L378 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 30 treesize of output 33 [2023-12-02 12:43:44,950 INFO L378 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 9 treesize of output 7 [2023-12-02 12:43:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:43:47,086 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:43:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717445210] [2023-12-02 12:43:47,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717445210] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1173585291] [2023-12-02 12:43:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:43:47,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:43:47,088 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:43:47,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-02 12:43:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:47,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 12:43:47,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:47,263 INFO L378 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 7 [2023-12-02 12:43:47,419 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:43:47,419 INFO L378 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 13 treesize of output 13 [2023-12-02 12:43:47,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:47,532 INFO L378 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 23 treesize of output 11 [2023-12-02 12:43:47,617 INFO L378 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 11 [2023-12-02 12:43:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:47,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:47,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:47,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-02 12:43:47,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:47,973 INFO L378 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 30 treesize of output 33 [2023-12-02 12:43:47,984 INFO L378 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 9 treesize of output 7 [2023-12-02 12:43:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:50,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1173585291] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:50,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014638056] [2023-12-02 12:43:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:50,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:43:50,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:43:50,099 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:43:50,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 12:43:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:50,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 12:43:50,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:50,207 INFO L378 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 7 [2023-12-02 12:43:50,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:50,289 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:43:50,289 INFO L378 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 13 treesize of output 13 [2023-12-02 12:43:50,334 INFO L378 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 27 treesize of output 11 [2023-12-02 12:43:50,372 INFO L378 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 11 [2023-12-02 12:43:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:50,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:50,402 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2023-12-02 12:43:50,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:50,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-02 12:43:50,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:50,625 INFO L378 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 30 treesize of output 33 [2023-12-02 12:43:50,634 INFO L378 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 9 treesize of output 7 [2023-12-02 12:43:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:43:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014638056] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:52,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 12:43:52,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 19 [2023-12-02 12:43:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50467504] [2023-12-02 12:43:52,740 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 12:43:52,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 12:43:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:43:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 12:43:52,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=226, Unknown=27, NotChecked=66, Total=380 [2023-12-02 12:43:52,743 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:43:53,571 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-12-02 12:43:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 12:43:53,572 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 12:43:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:43:53,572 INFO L225 Difference]: With dead ends: 22 [2023-12-02 12:43:53,573 INFO L226 Difference]: Without dead ends: 20 [2023-12-02 12:43:53,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=113, Invalid=330, Unknown=27, NotChecked=82, Total=552 [2023-12-02 12:43:53,575 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:43:53,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 37 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 72 Invalid, 0 Unknown, 34 Unchecked, 0.6s Time] [2023-12-02 12:43:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-02 12:43:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-12-02 12:43:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) [2023-12-02 12:43:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-02 12:43:53,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2023-12-02 12:43:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:43:53,583 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-02 12:43:53,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-02 12:43:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 12:43:53,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:43:53,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:43:53,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-02 12:43:53,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-02 12:43:53,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 12:43:54,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:43:54,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:43:54,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:43:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash -217963837, now seen corresponding path program 1 times [2023-12-02 12:43:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:43:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097290376] [2023-12-02 12:43:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:54,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:54,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:43:54,189 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:43:54,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 12:43:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:54,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 12:43:54,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:54,299 INFO L378 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 7 [2023-12-02 12:43:54,360 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:43:54,360 INFO L378 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 13 treesize of output 13 [2023-12-02 12:43:54,427 INFO L378 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 19 treesize of output 1 [2023-12-02 12:43:54,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 12:43:54,564 INFO L378 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 109 treesize of output 100 [2023-12-02 12:43:54,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 19 [2023-12-02 12:43:54,581 INFO L378 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 40 treesize of output 23 [2023-12-02 12:43:54,662 INFO L378 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 39 treesize of output 21 [2023-12-02 12:43:54,672 INFO L378 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 23 treesize of output 11 [2023-12-02 12:43:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:54,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:54,797 INFO L378 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 199 treesize of output 177 [2023-12-02 12:43:54,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:54,971 INFO L378 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 38 treesize of output 31 [2023-12-02 12:43:54,978 INFO L378 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 11 treesize of output 7 [2023-12-02 12:43:55,011 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:43:55,012 INFO L378 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 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-02 12:43:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:57,129 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:43:57,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097290376] [2023-12-02 12:43:57,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097290376] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:57,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1171934833] [2023-12-02 12:43:57,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:57,129 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:43:57,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:43:57,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:43:57,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-02 12:43:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:57,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 12:43:57,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:57,303 INFO L378 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 7 [2023-12-02 12:43:57,413 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:43:57,413 INFO L378 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 13 treesize of output 13 [2023-12-02 12:43:57,497 INFO L378 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 15 treesize of output 1 [2023-12-02 12:43:57,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:57,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 12:43:57,626 INFO L378 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 71 treesize of output 62 [2023-12-02 12:43:57,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-02 12:43:57,644 INFO L378 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 24 treesize of output 11 [2023-12-02 12:43:57,758 INFO L378 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 [2023-12-02 12:43:57,767 INFO L378 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 7 treesize of output 3 [2023-12-02 12:43:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:57,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:57,835 INFO L378 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 199 treesize of output 177 [2023-12-02 12:43:57,854 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-12-02 12:43:57,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:57,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 12:43:57,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:57,908 INFO L378 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 36 treesize of output 35 [2023-12-02 12:43:57,914 INFO L378 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 7 treesize of output 3 [2023-12-02 12:43:57,933 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:43:57,933 INFO L378 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 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-02 12:43:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:43:58,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1171934833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357910525] [2023-12-02 12:43:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:58,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:43:58,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:43:58,024 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:43:58,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 12:43:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:58,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 12:43:58,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:58,120 INFO L378 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 7 [2023-12-02 12:43:58,185 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:43:58,185 INFO L378 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 13 treesize of output 13 [2023-12-02 12:43:58,219 INFO L378 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 15 treesize of output 1 [2023-12-02 12:43:58,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:43:58,312 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 12:43:58,312 INFO L378 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 71 treesize of output 62 [2023-12-02 12:43:58,317 INFO L378 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 24 treesize of output 11 [2023-12-02 12:43:58,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-02 12:43:58,372 INFO L378 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 [2023-12-02 12:43:58,386 INFO L378 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 7 treesize of output 3 [2023-12-02 12:43:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:58,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:58,428 INFO L378 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 199 treesize of output 177 [2023-12-02 12:43:58,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:58,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 12:43:58,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:58,566 INFO L378 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 36 treesize of output 35 [2023-12-02 12:43:58,571 INFO L378 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 7 treesize of output 3 [2023-12-02 12:43:58,588 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:43:58,588 INFO L378 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 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-02 12:43:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:58,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357910525] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:43:58,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 12:43:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 18 [2023-12-02 12:43:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022069850] [2023-12-02 12:43:58,671 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 12:43:58,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 12:43:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:43:58,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 12:43:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=252, Unknown=7, NotChecked=32, Total=342 [2023-12-02 12:43:58,673 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:43:59,298 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2023-12-02 12:43:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:43:59,299 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 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 [2023-12-02 12:43:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:43:59,300 INFO L225 Difference]: With dead ends: 33 [2023-12-02 12:43:59,300 INFO L226 Difference]: Without dead ends: 31 [2023-12-02 12:43:59,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=109, Invalid=440, Unknown=7, NotChecked=44, Total=600 [2023-12-02 12:43:59,301 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:43:59,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 73 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 144 Invalid, 0 Unknown, 30 Unchecked, 0.4s Time] [2023-12-02 12:43:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-02 12:43:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2023-12-02 12:43:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-02 12:43:59,307 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2023-12-02 12:43:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:43:59,307 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-02 12:43:59,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-02 12:43:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 12:43:59,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:43:59,308 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:43:59,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-02 12:43:59,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-02 12:43:59,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-02 12:43:59,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:59,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:43:59,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:43:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash 634695821, now seen corresponding path program 2 times [2023-12-02 12:43:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:43:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499360394] [2023-12-02 12:43:59,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:43:59,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:43:59,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:43:59,911 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:43:59,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 12:43:59,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 12:43:59,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:43:59,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 12:43:59,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:44:00,001 INFO L378 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 7 [2023-12-02 12:44:00,064 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:44:00,064 INFO L378 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 13 treesize of output 13 [2023-12-02 12:44:00,123 INFO L378 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 15 treesize of output 1 [2023-12-02 12:44:00,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:44:00,224 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-02 12:44:00,224 INFO L378 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 35 treesize of output 36 [2023-12-02 12:44:00,230 INFO L378 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 12 treesize of output 11 [2023-12-02 12:44:00,240 INFO L378 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 23 [2023-12-02 12:44:00,249 INFO L378 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 12 treesize of output 11 [2023-12-02 12:44:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:44:00,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:44:00,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:00,672 INFO L378 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 45 treesize of output 49 [2023-12-02 12:44:00,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:00,685 INFO L378 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 40 treesize of output 39 [2023-12-02 12:44:00,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:00,720 INFO L378 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 45 treesize of output 44 [2023-12-02 12:44:00,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:00,734 INFO L378 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 35 treesize of output 39 [2023-12-02 12:44:00,778 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_11 .cse0) (_ bv0 32))) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (_ bv0 32)) (not (= (select v_arrayElimArr_12 .cse0) (_ bv0 32))))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_10 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_9 .cse0) (_ bv0 32))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (_ bv0 32)))))) is different from false [2023-12-02 12:44:00,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:00,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 12:44:00,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:00,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 12:44:01,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:01,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 195 [2023-12-02 12:44:01,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:01,215 INFO L378 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 210 treesize of output 185 [2023-12-02 12:44:01,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:01,295 INFO L378 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 178 treesize of output 162 [2023-12-02 12:44:01,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:01,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 176 [2023-12-02 12:44:08,613 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:44:08,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 1 [2023-12-02 12:44:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:44:09,029 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:44:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499360394] [2023-12-02 12:44:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499360394] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:44:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [647975921] [2023-12-02 12:44:09,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:44:09,030 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:44:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:44:09,031 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:44:09,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-02 12:44:09,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 12:44:09,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:44:09,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 12:44:09,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:44:09,231 INFO L378 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 7 [2023-12-02 12:44:09,289 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:44:09,289 INFO L378 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 13 treesize of output 13 [2023-12-02 12:44:09,340 INFO L378 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 15 treesize of output 1 [2023-12-02 12:44:09,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:44:09,450 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-02 12:44:09,451 INFO L378 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 35 treesize of output 36 [2023-12-02 12:44:09,460 INFO L378 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 23 [2023-12-02 12:44:09,471 INFO L378 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 12 treesize of output 11 [2023-12-02 12:44:09,483 INFO L378 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 12 treesize of output 11 [2023-12-02 12:44:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:44:09,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:44:09,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:09,744 INFO L378 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 45 treesize of output 44 [2023-12-02 12:44:09,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:09,757 INFO L378 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 35 treesize of output 39 [2023-12-02 12:44:09,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:09,793 INFO L378 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 45 treesize of output 49 [2023-12-02 12:44:09,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:09,806 INFO L378 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 40 treesize of output 39 [2023-12-02 12:44:09,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_17 .cse0) (_ bv0 32))) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_16))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (_ bv0 32)) (not (= (select v_arrayElimArr_16 .cse0) (_ bv0 32))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_19 .cse0) (_ bv0 32))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_19))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv4 32)))) (_ bv0 32)) (not (= (select v_arrayElimArr_18 .cse0) (_ bv0 32))))))) is different from false [2023-12-02 12:44:10,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:10,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 12:44:10,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:10,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 12:44:10,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:10,060 INFO L378 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 72 treesize of output 71 [2023-12-02 12:44:10,920 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-12-02 12:44:10,920 INFO L378 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 208 treesize of output 335 [2023-12-02 12:44:11,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:11,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 182 [2023-12-02 12:44:11,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:11,275 INFO L378 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 125 treesize of output 97 [2023-12-02 12:44:28,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:28,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 12:44:29,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:44:29,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 12:45:09,733 WARN L293 SmtUtils]: Spent 40.49s on a formula simplification. DAG size of input: 47 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 12:45:09,733 INFO L349 Elim1Store]: treesize reduction 59, result has 47.3 percent of original size [2023-12-02 12:45:09,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 136 [2023-12-02 12:45:10,345 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2023-12-02 12:45:10,345 INFO L378 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 104 treesize of output 89 [2023-12-02 12:45:10,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:45:10,366 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2023-12-02 12:45:10,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:45:10,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:45:10,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:10,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 112 [2023-12-02 12:45:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:45:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [647975921] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:45:10,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273167607] [2023-12-02 12:45:10,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:45:10,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:45:10,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:45:10,700 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:45:10,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 12:45:10,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 12:45:10,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:45:10,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 12:45:10,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:45:10,813 INFO L378 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 7 [2023-12-02 12:45:10,863 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:45:10,863 INFO L378 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 13 treesize of output 13 [2023-12-02 12:45:10,895 INFO L378 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 15 treesize of output 1 [2023-12-02 12:45:10,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:45:10,976 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-02 12:45:10,976 INFO L378 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 35 treesize of output 36 [2023-12-02 12:45:10,982 INFO L378 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 23 [2023-12-02 12:45:10,986 INFO L378 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 12 treesize of output 11 [2023-12-02 12:45:10,999 INFO L378 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 12 treesize of output 11 [2023-12-02 12:45:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:45:11,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:45:11,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:11,196 INFO L378 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 45 treesize of output 44 [2023-12-02 12:45:11,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:11,206 INFO L378 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 35 treesize of output 39 [2023-12-02 12:45:11,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:11,233 INFO L378 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 45 treesize of output 49 [2023-12-02 12:45:11,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:11,244 INFO L378 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 40 treesize of output 39 [2023-12-02 12:45:11,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 .cse0) (_ bv0 32))) (= (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (bvadd (_ bv4 32) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (_ bv0 32)) (not (= (select v_arrayElimArr_26 .cse0) (_ bv0 32))))) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_24 .cse0) (_ bv0 32))) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (_ bv0 32)))))) is different from false [2023-12-02 12:45:11,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:11,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 12:45:11,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:11,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 12:45:11,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:11,426 INFO L378 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 72 treesize of output 71 [2023-12-02 12:45:12,159 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-12-02 12:45:12,159 INFO L378 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 208 treesize of output 335 [2023-12-02 12:45:12,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:12,210 INFO L378 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 137 treesize of output 109 [2023-12-02 12:45:12,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:12,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 166 [2023-12-02 12:45:22,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:22,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 12:45:24,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:45:24,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 12:45:59,107 WARN L293 SmtUtils]: Spent 34.55s on a formula simplification. DAG size of input: 47 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 12:45:59,107 INFO L349 Elim1Store]: treesize reduction 59, result has 47.3 percent of original size [2023-12-02 12:45:59,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 136 [2023-12-02 12:46:00,634 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2023-12-02 12:46:00,634 INFO L378 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 104 treesize of output 89 [2023-12-02 12:46:00,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:46:00,652 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2023-12-02 12:46:00,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:46:00,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:46:00,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:00,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 112 [2023-12-02 12:46:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:46:01,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273167607] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:46:01,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 12:46:01,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 16 [2023-12-02 12:46:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521228763] [2023-12-02 12:46:01,063 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 12:46:01,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 12:46:01,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:46:01,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 12:46:01,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=152, Unknown=3, NotChecked=78, Total=272 [2023-12-02 12:46:01,066 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:46:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:46:02,160 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-12-02 12:46:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:46:02,161 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 12:46:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:46:02,162 INFO L225 Difference]: With dead ends: 37 [2023-12-02 12:46:02,162 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 12:46:02,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=278, Unknown=3, NotChecked=108, Total=462 [2023-12-02 12:46:02,164 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:46:02,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 56 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 92 Invalid, 0 Unknown, 90 Unchecked, 0.5s Time] [2023-12-02 12:46:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 12:46:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-12-02 12:46:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:46:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-12-02 12:46:02,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-12-02 12:46:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:46:02,171 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-12-02 12:46:02,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:46:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-12-02 12:46:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 12:46:02,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:46:02,173 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:46:02,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 12:46:02,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-02 12:46:02,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-12-02 12:46:02,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 12:46:02,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:46:02,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:46:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1072059140, now seen corresponding path program 3 times [2023-12-02 12:46:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:46:02,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433496264] [2023-12-02 12:46:02,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:46:02,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:46:02,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:46:02,777 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 12:46:02,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 12:46:02,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 12:46:02,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:46:02,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 12:46:02,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:46:02,956 INFO L378 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 7 [2023-12-02 12:46:03,047 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 12:46:03,047 INFO L378 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 19 treesize of output 27 [2023-12-02 12:46:03,144 INFO L378 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 15 treesize of output 1 [2023-12-02 12:46:03,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 12:46:03,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:46:03,279 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:46:03,279 INFO L378 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 16 treesize of output 15 [2023-12-02 12:46:03,293 INFO L378 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 [2023-12-02 12:46:03,324 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 12:46:03,324 INFO L378 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 35 treesize of output 26 [2023-12-02 12:46:03,370 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 12:46:03,370 INFO L378 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 24 treesize of output 26 [2023-12-02 12:46:03,564 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-12-02 12:46:03,564 INFO L378 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 201 treesize of output 147 [2023-12-02 12:46:03,574 INFO L378 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 154 treesize of output 124 [2023-12-02 12:46:03,601 INFO L378 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 55 treesize of output 19 [2023-12-02 12:46:03,890 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-12-02 12:46:03,890 INFO L378 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 136 [2023-12-02 12:46:03,940 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2023-12-02 12:46:03,941 INFO L378 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 2 case distinctions, treesize of input 154 treesize of output 148 [2023-12-02 12:46:03,954 INFO L378 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 22 treesize of output 21 [2023-12-02 12:46:03,972 INFO L378 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 52 treesize of output 19 [2023-12-02 12:46:04,008 INFO L378 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 22 treesize of output 21 [2023-12-02 12:46:04,248 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-12-02 12:46:04,249 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 56 [2023-12-02 12:46:04,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2023-12-02 12:46:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:46:04,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:46:04,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:04,493 INFO L378 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 74 treesize of output 72 [2023-12-02 12:46:04,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:04,505 INFO L378 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 64 treesize of output 62 [2023-12-02 12:46:05,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |c_ULTIMATE.start_main_~t~0#1.offset|))) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_442 (_ BitVec 32)) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_32 .cse0))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse1 .cse2 v_ArrVal_442)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_449) (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) .cse5) (_ bv1 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_33 .cse0))) (= .cse5 (_ bv0 32))))) (forall ((v_ArrVal_442 (_ BitVec 32)) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_33 .cse0))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_32 .cse0))) (= .cse7 (_ bv0 32)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse1 .cse2 v_ArrVal_442)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_449) .cse7) (select (select (store .cse6 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (_ bv1 32)))))))))) is different from false [2023-12-02 12:46:05,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:05,601 INFO L378 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 181 treesize of output 175 [2023-12-02 12:46:05,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:05,963 INFO L378 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 198 treesize of output 218 [2023-12-02 12:46:06,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:06,323 INFO L378 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 759 treesize of output 813 [2023-12-02 12:46:06,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:06,365 INFO L378 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 544 treesize of output 507 [2023-12-02 12:46:06,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:06,477 INFO L378 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 344 treesize of output 348 [2023-12-02 12:46:06,513 INFO L378 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 319 treesize of output 283 [2023-12-02 12:46:06,545 INFO L378 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 283 treesize of output 265 [2023-12-02 12:46:10,234 INFO L378 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 216 treesize of output 214 [2023-12-02 12:46:13,701 INFO L378 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 [2023-12-02 12:46:13,818 INFO L378 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 [2023-12-02 12:46:14,178 INFO L378 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 [2023-12-02 12:46:14,201 INFO L378 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 [2023-12-02 12:46:14,576 INFO L378 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 [2023-12-02 12:46:14,761 INFO L378 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 68 treesize of output 52 [2023-12-02 12:46:15,350 INFO L378 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 84 treesize of output 64 [2023-12-02 12:46:16,750 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse2 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse1 (_ bv0 32)) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse2))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (= (select (select (store .cse4 .cse2 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse4 .cse2 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse5))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse5 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store .cse6 .cse5 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse6 .cse5 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse7))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse8 (select (select (store .cse9 .cse7 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse8 (select (select (store .cse9 .cse7 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse10 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse10 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse11 .cse10 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse10))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse11 .cse10 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse12 (select (select (store .cse13 .cse14 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse12 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse12 (select (select (store .cse13 .cse14 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (not (= (_ bv0 1) (select |c_#valid| .cse14))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse14 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse14))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse15 (select (select (store .cse16 .cse17 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse15 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse15 (select (select (store .cse16 .cse17 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse17 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse17)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_160 (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse19 (select (select (store .cse18 v_arrayElimCell_160 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse18 v_arrayElimCell_160 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse19 (_ bv0 32)) (not (= (select |c_#valid| v_arrayElimCell_160) (_ bv0 1))))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse20))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse20 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse21 (_ bv0 32)) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse20 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse23 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse22 .cse23 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse23))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse23 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (= (select (select (store .cse22 .cse23 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse24 (select (select (store .cse25 .cse26 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse24 (_ bv0 32)) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse25 .cse26 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse26 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse28 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse27 (_ bv0 32)) (= .cse27 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse28))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse28 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse29 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse29))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse30 (select (select (store .cse31 .cse29 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse30 (_ bv0 32)) (= (select (select (store .cse31 .cse29 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse30) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse33 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse32 (_ bv0 32)) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse33))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse34 (select (select (store .cse35 .cse33 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse34 (select (select (store .cse35 .cse33 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse37 (select v_arrayElimArr_34 .cse0))) (let ((.cse38 (select (select (store .cse36 .cse37 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse36 .cse37 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse37))) (= .cse38 (_ bv0 32)) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse39))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse39 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse40 (_ bv0 32)) (not (= .cse40 .cse39)) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse41))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse41 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse43 (select (select (store .cse42 .cse41 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse42 .cse41 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse43) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_34 .cse0))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse44 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse44))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse44 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse45 (_ bv0 32)) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_161 (_ BitVec 32)) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse46 (select (select (store .cse47 v_arrayElimCell_161 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse46 (select (select (store .cse47 v_arrayElimCell_161 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_161))) (= .cse46 (_ bv0 32)))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse48))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse48 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse49 (_ bv0 32)) (not (= .cse49 .cse48)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse50))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse51 (select (select (store .cse52 .cse50 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse51 (_ bv0 32)) (not (= .cse51 .cse50)) (= (select (select (store .cse52 .cse50 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse51) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse53))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse53 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse53 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse53))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse54 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse54))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store .cse55 .cse54 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse55 .cse54 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse56))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (let ((.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (= (select (select (store .cse57 .cse56 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse57 .cse56 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse56 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse58 (_ bv0 32)) (= .cse58 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse59))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse60 (select (select (store .cse61 .cse59 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse60 (_ bv0 32)) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse61 .cse59 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse60) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse62 (select (select (store .cse63 .cse64 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse62 (_ bv0 32)) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse63 .cse64 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse64))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse65 (select (select (store .cse66 .cse64 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse65 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse65 (select (select (store .cse66 .cse64 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse67))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse68 (select (select (store .cse69 .cse67 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= .cse68 .cse67)) (= .cse68 (select (select (store .cse69 .cse67 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse67 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))))))) is different from false [2023-12-02 12:46:18,988 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse2 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse1 (_ bv0 32)) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse2))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (= (select (select (store .cse4 .cse2 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse4 .cse2 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse5))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse5 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store .cse6 .cse5 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse6 .cse5 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse7))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse8 (select (select (store .cse9 .cse7 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse8 (select (select (store .cse9 .cse7 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse10 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse10 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse11 .cse10 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse10))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse11 .cse10 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse12 (select (select (store .cse13 .cse14 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse12 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse12 (select (select (store .cse13 .cse14 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (not (= (_ bv0 1) (select |c_#valid| .cse14))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse14 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse14))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse15 (select (select (store .cse16 .cse17 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse15 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse15 (select (select (store .cse16 .cse17 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse17 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse17)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_160 (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse19 (select (select (store .cse18 v_arrayElimCell_160 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse18 v_arrayElimCell_160 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse19 (_ bv0 32)) (not (= (select |c_#valid| v_arrayElimCell_160) (_ bv0 1))))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse20))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse20 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse21 (_ bv0 32)) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse20 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse23 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse22 .cse23 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse23))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse23 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (= (select (select (store .cse22 .cse23 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse24 (select (select (store .cse25 .cse26 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse24 (_ bv0 32)) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse25 .cse26 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse26 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse28 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse27 (_ bv0 32)) (= .cse27 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse28))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse28 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse29 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse29))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse30 (select (select (store .cse31 .cse29 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse30 (_ bv0 32)) (= (select (select (store .cse31 .cse29 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse30) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse33 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse32 (_ bv0 32)) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse33))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse34 (select (select (store .cse35 .cse33 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse34 (select (select (store .cse35 .cse33 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse37 (select v_arrayElimArr_34 .cse0))) (let ((.cse38 (select (select (store .cse36 .cse37 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse36 .cse37 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse37))) (= .cse38 (_ bv0 32)) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse39))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse39 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse40 (_ bv0 32)) (not (= .cse40 .cse39)) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse41))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse41 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse43 (select (select (store .cse42 .cse41 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse42 .cse41 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse43) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_34 .cse0))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse44 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse44))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse44 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse45 (_ bv0 32)) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_161 (_ BitVec 32)) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse46 (select (select (store .cse47 v_arrayElimCell_161 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse46 (select (select (store .cse47 v_arrayElimCell_161 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_161))) (= .cse46 (_ bv0 32)))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse48))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse48 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse49 (_ bv0 32)) (not (= .cse49 .cse48)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse50))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse51 (select (select (store .cse52 .cse50 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse51 (_ bv0 32)) (not (= .cse51 .cse50)) (= (select (select (store .cse52 .cse50 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse51) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse53))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse53 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse53 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse53))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse54 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse54))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store .cse55 .cse54 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse55 .cse54 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse56))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (let ((.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (= (select (select (store .cse57 .cse56 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse57 .cse56 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse56 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse58 (_ bv0 32)) (= .cse58 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse59))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse60 (select (select (store .cse61 .cse59 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse60 (_ bv0 32)) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse61 .cse59 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse60) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_34 .cse0))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse62 (select (select (store .cse63 .cse64 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= .cse62 (_ bv0 32)) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse63 .cse64 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse64))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse65 (select (select (store .cse66 .cse64 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse65 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse65 (select (select (store .cse66 .cse64 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (select v_arrayElimArr_34 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse67))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse68 (select (select (store .cse69 .cse67 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= .cse68 .cse67)) (= .cse68 (select (select (store .cse69 .cse67 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse67 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))))))) is different from true [2023-12-02 12:46:23,971 INFO L378 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 48486 treesize of output 45798 [2023-12-02 12:46:24,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:24,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 57 [2023-12-02 12:46:24,096 INFO L378 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 198 treesize of output 166 [2023-12-02 12:46:24,134 INFO L378 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 110 treesize of output 94 [2023-12-02 12:46:24,223 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 12:46:24,224 INFO L378 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 100 treesize of output 82 [2023-12-02 12:46:24,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:46:24,290 INFO L378 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 25 treesize of output 19 [2023-12-02 12:46:24,316 INFO L378 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 88 treesize of output 68 [2023-12-02 12:46:24,455 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 12:46:24,456 INFO L378 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 21 treesize of output 14 [2023-12-02 12:46:24,543 INFO L378 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 851 treesize of output 827 [2023-12-02 12:46:24,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:24,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-12-02 12:46:24,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:24,690 INFO L378 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 452 treesize of output 344 [2023-12-02 12:46:24,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:24,784 INFO L378 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 305 treesize of output 279 [2023-12-02 12:46:24,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:24,890 INFO L378 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 149 treesize of output 137 [2023-12-02 12:46:24,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:25,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:25,037 INFO L378 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 36 treesize of output 35 [2023-12-02 12:46:25,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:25,131 INFO L378 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 272 treesize of output 208 [2023-12-02 12:46:26,107 INFO L378 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 851 treesize of output 827 [2023-12-02 12:46:26,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:26,238 INFO L378 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 463 treesize of output 355 [2023-12-02 12:46:26,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:26,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-12-02 12:46:26,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:26,450 INFO L378 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 305 treesize of output 279 [2023-12-02 12:46:26,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:26,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:26,660 INFO L378 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 39 treesize of output 38 [2023-12-02 12:46:26,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:26,832 INFO L378 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 299 treesize of output 235 [2023-12-02 12:46:26,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:26,963 INFO L378 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 117 treesize of output 105 [2023-12-02 12:46:27,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:27,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 66 [2023-12-02 12:46:28,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:28,156 INFO L378 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 438 treesize of output 419 [2023-12-02 12:46:28,191 INFO L378 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 190 treesize of output 154 [2023-12-02 12:46:28,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:28,289 INFO L378 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 154 treesize of output 118 [2023-12-02 12:46:28,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:28,414 INFO L378 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 89 treesize of output 79 [2023-12-02 12:46:30,388 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:30,407 INFO L378 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 1219 treesize of output 1063 [2023-12-02 12:46:30,477 INFO L378 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 924 treesize of output 888 [2023-12-02 12:46:30,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:30,595 INFO L378 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 378 treesize of output 306 [2023-12-02 12:46:30,641 INFO L378 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 118 treesize of output 102 [2023-12-02 12:46:30,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:30,774 INFO L378 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 241 treesize of output 215 [2023-12-02 12:46:30,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:30,900 INFO L378 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 171 treesize of output 151 [2023-12-02 12:46:32,199 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:32,217 INFO L378 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 162 treesize of output 150 [2023-12-02 12:46:32,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:32,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 57 [2023-12-02 12:46:32,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:32,493 INFO L378 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 365 treesize of output 346 [2023-12-02 12:46:32,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:32,632 INFO L378 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 79 treesize of output 69 [2023-12-02 12:46:32,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:32,768 INFO L378 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 137 treesize of output 101 [2023-12-02 12:46:32,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:32,891 INFO L378 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 94 treesize of output 74 [2023-12-02 12:46:33,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:33,016 INFO L378 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 37 treesize of output 33 [2023-12-02 12:46:33,968 INFO L378 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 3992 treesize of output 3872 [2023-12-02 12:46:34,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:34,113 INFO L378 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 632 treesize of output 480 [2023-12-02 12:46:34,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:34,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-12-02 12:46:34,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:34,332 INFO L378 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 305 treesize of output 279 [2023-12-02 12:46:34,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:34,501 INFO L378 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 208 treesize of output 188 [2023-12-02 12:46:34,565 INFO L378 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 66 treesize of output 50 [2023-12-02 12:46:34,618 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:34,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:34,767 INFO L378 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 39 treesize of output 38 [2023-12-02 12:46:34,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:34,924 INFO L378 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 384 treesize of output 312 [2023-12-02 12:46:36,334 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:46:36,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 1 [2023-12-02 12:46:36,361 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:46:36,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 1 [2023-12-02 12:46:36,419 INFO L378 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 21928 treesize of output 20536 [2023-12-02 12:46:36,497 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 12:46:36,498 INFO L378 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 225 treesize of output 1 [2023-12-02 12:46:36,622 INFO L378 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 394 treesize of output 382 [2023-12-02 12:46:36,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:36,739 INFO L378 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 278 treesize of output 234 [2023-12-02 12:46:36,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:36,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:46:36,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:36,920 INFO L378 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 156 treesize of output 146 [2023-12-02 12:46:37,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:37,047 INFO L378 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 79 treesize of output 75 [2023-12-02 12:46:37,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:37,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:37,236 INFO L378 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 36 treesize of output 35 [2023-12-02 12:46:37,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:37,343 INFO L378 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 147 treesize of output 115 [2023-12-02 12:46:38,026 INFO L378 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 48879 treesize of output 46179 [2023-12-02 12:46:38,078 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 12:46:38,181 INFO L378 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 48879 treesize of output 46179 [2023-12-02 12:46:38,248 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 12:46:38,288 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:46:38,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 1 [2023-12-02 12:46:38,326 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:46:38,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 1 [2023-12-02 12:46:38,361 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:46:38,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2023-12-02 12:46:38,454 INFO L378 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 3535 treesize of output 3427 [2023-12-02 12:46:38,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:38,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-12-02 12:46:38,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:38,624 INFO L378 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 404 treesize of output 320 [2023-12-02 12:46:38,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:38,739 INFO L378 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 156 treesize of output 146 [2023-12-02 12:46:38,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:38,856 INFO L378 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 138 treesize of output 126 [2023-12-02 12:46:38,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:39,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:39,015 INFO L378 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 36 treesize of output 35 [2023-12-02 12:46:39,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:39,121 INFO L378 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 264 treesize of output 224 [2023-12-02 12:46:39,150 INFO L378 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 62 treesize of output 46 [2023-12-02 12:46:40,108 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:46:40,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2023-12-02 12:46:40,148 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:46:40,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 1 [2023-12-02 12:46:40,208 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:40,226 INFO L378 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 162 treesize of output 150 [2023-12-02 12:46:40,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:40,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 57 [2023-12-02 12:46:40,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:40,457 INFO L378 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 279 treesize of output 266 [2023-12-02 12:46:40,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:40,558 INFO L378 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 250 treesize of output 206 [2023-12-02 12:46:40,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:40,656 INFO L378 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 141 treesize of output 113 [2023-12-02 12:46:40,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:40,755 INFO L378 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 37 treesize of output 33 [2023-12-02 12:46:40,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:40,863 INFO L378 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 56 treesize of output 54 [2023-12-02 12:46:40,897 INFO L378 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 28 treesize of output 20 [2023-12-02 12:46:41,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:41,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 89 [2023-12-02 12:46:42,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:42,061 INFO L378 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 615 treesize of output 584 [2023-12-02 12:46:42,096 INFO L378 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 259 treesize of output 215 [2023-12-02 12:46:42,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:42,169 INFO L378 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 215 treesize of output 167 [2023-12-02 12:46:42,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:42,256 INFO L378 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 117 treesize of output 99 [2023-12-02 12:46:44,082 INFO L378 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 394 treesize of output 382 [2023-12-02 12:46:44,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:44,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-12-02 12:46:44,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:44,229 INFO L378 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 244 treesize of output 200 [2023-12-02 12:46:44,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:44,329 INFO L378 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 156 treesize of output 146 [2023-12-02 12:46:44,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:44,432 INFO L378 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 79 treesize of output 75 [2023-12-02 12:46:44,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:44,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:44,575 INFO L378 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 47 treesize of output 46 [2023-12-02 12:46:44,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:44,671 INFO L378 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 166 treesize of output 126 [2023-12-02 12:46:45,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:45,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 80 [2023-12-02 12:46:45,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:45,603 INFO L378 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 370 treesize of output 351 [2023-12-02 12:46:45,641 INFO L378 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 254 treesize of output 210 [2023-12-02 12:46:45,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:45,738 INFO L378 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 210 treesize of output 162 [2023-12-02 12:46:45,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:45,862 INFO L378 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 105 treesize of output 95 [2023-12-02 12:46:45,902 INFO L378 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 28 treesize of output 20 [2023-12-02 12:46:46,421 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:46:46,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 1 [2023-12-02 12:46:46,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:46:46,489 INFO L378 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 162 treesize of output 150 [2023-12-02 12:46:46,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:46,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-12-02 12:46:46,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:46,737 INFO L378 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 188 treesize of output 181 [2023-12-02 12:46:46,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:46,835 INFO L378 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 165 treesize of output 137 [2023-12-02 12:46:46,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:46,940 INFO L378 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 37 treesize of output 33 [2023-12-02 12:46:47,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:47,045 INFO L378 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 72 treesize of output 64 [2023-12-02 12:46:47,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:46:47,143 INFO L378 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 35 treesize of output 33 [2023-12-02 12:47:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 12:47:17,823 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:47:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433496264] [2023-12-02 12:47:17,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433496264] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:47:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1090008823] [2023-12-02 12:47:17,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:47:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:47:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:47:17,825 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:47:17,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 12:47:18,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 12:47:18,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:47:18,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 12:47:18,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:47:18,068 INFO L378 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 7 [2023-12-02 12:47:18,460 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 12:47:18,460 INFO L378 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 19 treesize of output 27 [2023-12-02 12:47:18,908 INFO L378 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 15 treesize of output 1 [2023-12-02 12:47:18,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:47:19,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:47:19,681 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:47:19,681 INFO L378 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 16 treesize of output 15 [2023-12-02 12:47:19,824 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 12:47:19,824 INFO L378 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 35 treesize of output 26 [2023-12-02 12:47:19,986 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 12:47:19,987 INFO L378 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 24 treesize of output 26 [2023-12-02 12:47:20,685 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-02 12:47:20,686 INFO L378 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 143 treesize of output 89 [2023-12-02 12:47:20,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:47:20,790 INFO L378 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 27 treesize of output 22 [2023-12-02 12:47:20,934 INFO L378 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 39 treesize of output 15 [2023-12-02 12:47:21,967 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-12-02 12:47:21,969 INFO L378 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2023-12-02 12:47:22,034 INFO L378 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 16 treesize of output 15 [2023-12-02 12:47:22,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:47:22,138 INFO L378 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 36 treesize of output 41 [2023-12-02 12:47:22,246 INFO L378 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 16 treesize of output 15 [2023-12-02 12:47:22,307 INFO L378 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 36 treesize of output 15 [2023-12-02 12:47:23,303 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 12:47:23,304 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2023-12-02 12:47:23,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 12:47:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:47:23,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:47:23,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:47:23,876 INFO L378 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 74 treesize of output 72 [2023-12-02 12:47:23,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:47:23,911 INFO L378 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 64 treesize of output 62 [2023-12-02 12:47:24,212 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (_ bv0 32) .cse0) (forall ((v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_60 .cse1))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_509) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (_ bv1 32)))) (not (= (select v_arrayElimArr_59 .cse1) (_ bv0 32)))))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_60 .cse1))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_509) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) .cse3) (_ bv1 32)) (= .cse3 (_ bv0 32))))) (not (= (select v_arrayElimArr_59 .cse1) (_ bv0 32))))))) is different from false [2023-12-02 12:47:24,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |c_ULTIMATE.start_main_~t~0#1.offset|))) (.cse5 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_504 (_ BitVec 32)) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_59 .cse0))) (forall ((v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse1 .cse2 v_ArrVal_504)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_509) .cse3) (select (select (store .cse4 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (not (= (select v_arrayElimArr_60 .cse0) (_ bv0 32))))) (= .cse3 (_ bv0 32))))) (forall ((v_ArrVal_504 (_ BitVec 32)) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_59 .cse0))) (forall ((v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse7 (_ bv0 32)) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse1 .cse2 v_ArrVal_504)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_509) (select (select (store .cse6 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) .cse7)) (not (= (select v_arrayElimArr_60 .cse0) (_ bv0 32))))))))))) is different from false [2023-12-02 12:47:25,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:47:25,335 INFO L378 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 181 treesize of output 175 [2023-12-02 12:47:25,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:47:25,633 INFO L378 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 198 treesize of output 218 [2023-12-02 12:47:26,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:47:26,119 INFO L378 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 461 treesize of output 556 [2023-12-02 12:47:26,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:47:26,178 INFO L378 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 552 treesize of output 515 [2023-12-02 12:47:26,219 INFO L378 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 345 treesize of output 309 [2023-12-02 12:47:26,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:47:26,393 INFO L378 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 316 treesize of output 320 [2023-12-02 12:47:26,433 INFO L378 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 291 treesize of output 273 [2023-12-02 12:47:45,454 INFO L378 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 [2023-12-02 12:47:47,903 INFO L378 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 [2023-12-02 12:47:48,871 INFO L378 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 [2023-12-02 12:47:48,958 INFO L378 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 [2023-12-02 12:47:48,974 INFO L378 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 [2023-12-02 12:47:50,869 INFO L378 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 68 treesize of output 52 [2023-12-02 12:47:52,119 INFO L378 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 103 treesize of output 79 [2023-12-02 12:47:56,918 INFO L378 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 84 treesize of output 64 [2023-12-02 12:48:01,537 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_61 .cse3))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse1 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse1 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse1))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse4 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse4 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse5 .cse4 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse4))) (= (select (select (store .cse5 .cse4 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse8 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse6 (_ bv0 32)) (= .cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse9 .cse8 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse9 .cse8 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse8)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse10 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse10))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse10 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse11))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse11 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse12 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse11 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse13) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse11 .cse13)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse16 (select (select (store .cse17 .cse14 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse15 (select (select (store .cse17 .cse14 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse14 .cse15)) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse16 .cse15))))) (not (= (_ bv0 1) (select |c_#valid| .cse14))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse14 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse18 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse18))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse19 .cse18 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse19 .cse18 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_61 .cse3))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse20 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse20 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse21 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse20))) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_342 (_ BitVec 32))) (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse22 (select (select (store .cse23 v_arrayElimCell_342 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 (_ bv0 32)) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_342))) (= (select (select (store .cse23 v_arrayElimCell_342 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse25 (select (select (store .cse26 v_arrayElimCell_343 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse24 (select (select (store .cse26 v_arrayElimCell_343 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse24 (_ bv0 32)) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse25 .cse24) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_343))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse27 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse27))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse28 (select (select (store .cse29 .cse27 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse29 .cse27 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse28) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse30))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse31 (select (select (store .cse32 .cse30 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse31) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse32 .cse30 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse30 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse33 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse33 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse33))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select (select (store .cse35 .cse33 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse33 .cse34))))) (= (select (select (store .cse35 .cse33 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse36 (select (select (store .cse37 v_arrayElimCell_344 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse36 (select (select (store .cse37 v_arrayElimCell_344 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse36 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_344))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse38))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse39 .cse38 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse39 .cse38 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse40 (select (select (store .cse41 .cse38 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse40) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse41 .cse38 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse40)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse42))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse42 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse43 (_ bv0 32)) (not (= .cse43 .cse42)) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse45 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse44 .cse45 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse45 (select (select (store .cse44 .cse45 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse45))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse45 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse46))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse46 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse47 (_ bv0 32)) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (= (select (select (store .cse48 .cse46 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse48 .cse46 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse49))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse49 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse50 (_ bv0 32)) (not (= .cse50 .cse49)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse51 (select (select (store .cse52 .cse53 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse51 (_ bv0 32)) (= .cse51 (select (select (store .cse52 .cse53 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse53 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse53)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse54))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse54 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse55 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse56 (select (select (store .cse57 .cse54 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse56) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse57 .cse54 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse56)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse58 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse60 (select (select (store .cse61 .cse58 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse59 (select (select (store .cse61 .cse58 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse59 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse60 (_ bv0 32)) (= .cse60 .cse59) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse58)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse62 (select (select (store .cse63 .cse64 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse62 (_ bv0 32)) (= .cse62 (select (select (store .cse63 .cse64 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse64 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse64)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse65))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse65 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse66) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse65 .cse66))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse65 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select v_arrayElimArr_61 .cse3))) (let ((.cse67 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse68 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse67 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse68))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse69 (select (select (store .cse70 .cse68 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69)) (= (select (select (store .cse70 .cse68 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse69))))) (= .cse67 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse71 (select (select (store .cse72 .cse73 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse71 (_ bv0 32)) (= .cse71 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse71 (select (select (store .cse72 .cse73 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| .cse73)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select v_arrayElimArr_61 .cse3))) (let ((.cse74 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse75 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse74 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse75))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse75 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse76) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse75 .cse76))))) (= .cse74 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_61 .cse3))) (let ((.cse77 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse78 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse77 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse78))) (= .cse77 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse79 (select (select (store .cse80 .cse78 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse78 .cse79)) (= (select (select (store .cse80 .cse78 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse79))))))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64)) (.cse82 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store .cse81 .cse82 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse81 .cse82 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse82))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse82 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse83) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse82 .cse83)))))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse84 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse84 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse86 (select (select (store .cse87 .cse84 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse85 (select (select (store .cse87 .cse84 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse85 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse86 (_ bv0 32)) (= .cse86 .cse85) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse84)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse88))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse89 .cse88 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse89 .cse88 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse90 (select (select (store .cse91 .cse88 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse88 .cse90)) (= (select (select (store .cse91 .cse88 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse90)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse92))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse92 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse93 (select (select (store .cse94 .cse92 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse93 (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse93 (select (select (store .cse94 .cse92 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse95 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse95))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse95 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse96 (_ bv0 32)) (= .cse96 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse97 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse97))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse98 (select (select (store .cse99 .cse97 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse98 (_ bv0 32)) (= .cse98 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse99 .cse97 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse100 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse100))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse100 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse101 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse101 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse103 (select (select (store .cse104 .cse105 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse102 (select (select (store .cse104 .cse105 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse102) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= .cse103 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse103 .cse102))))) (not (= (_ bv0 1) (select |c_#valid| .cse105))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse105 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse106 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse106))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse107 .cse106 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= (select (select (store .cse107 .cse106 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse108))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse108 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse110 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse109 (select (select (store .cse110 .cse108 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse108 .cse109)) (= (select (select (store .cse110 .cse108 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse109)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse111 (select (select (store .cse113 .cse112 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse111 (_ bv0 32)) (not (= .cse111 .cse112)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse111 (select (select (store .cse113 .cse112 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| .cse112)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64)) (.cse115 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store .cse114 .cse115 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse114 .cse115 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse115 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse115)))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse118 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse116 (select (select (store .cse117 .cse118 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse116 (_ bv0 32)) (= .cse116 (select (select (store .cse117 .cse118 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse119 .cse118 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse118 (select (select (store .cse119 .cse118 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse118)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse120 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse121 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse120 .cse121 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse121))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse121 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse120 .cse121 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) is different from false [2023-12-02 12:48:03,961 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_61 .cse3))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse1 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse1 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse1))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse4 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse4 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse5 .cse4 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse4))) (= (select (select (store .cse5 .cse4 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse8 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse6 (_ bv0 32)) (= .cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse9 .cse8 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse9 .cse8 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse8)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse10 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse10))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse10 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse11))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse11 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse12 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse11 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse13) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse11 .cse13)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse16 (select (select (store .cse17 .cse14 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse15 (select (select (store .cse17 .cse14 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse14 .cse15)) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse16 .cse15))))) (not (= (_ bv0 1) (select |c_#valid| .cse14))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse14 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse18 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse18))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse19 .cse18 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse19 .cse18 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_61 .cse3))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse20 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse20 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse21 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse20))) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_342 (_ BitVec 32))) (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse22 (select (select (store .cse23 v_arrayElimCell_342 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 (_ bv0 32)) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_342))) (= (select (select (store .cse23 v_arrayElimCell_342 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse25 (select (select (store .cse26 v_arrayElimCell_343 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse24 (select (select (store .cse26 v_arrayElimCell_343 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse24 (_ bv0 32)) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse25 .cse24) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_343))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse27 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse27))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse28 (select (select (store .cse29 .cse27 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse29 .cse27 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse28) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse30))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse31 (select (select (store .cse32 .cse30 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse31) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse32 .cse30 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse30 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse33 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse33 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse33))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select (select (store .cse35 .cse33 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse33 .cse34))))) (= (select (select (store .cse35 .cse33 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse36 (select (select (store .cse37 v_arrayElimCell_344 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse36 (select (select (store .cse37 v_arrayElimCell_344 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse36 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_344))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse38))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse39 .cse38 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse39 .cse38 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse40 (select (select (store .cse41 .cse38 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse40) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse41 .cse38 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse40)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse42))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse42 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse43 (_ bv0 32)) (not (= .cse43 .cse42)) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse45 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse44 .cse45 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse45 (select (select (store .cse44 .cse45 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse45))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse45 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse46))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse46 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse47 (_ bv0 32)) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (= (select (select (store .cse48 .cse46 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse48 .cse46 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse49))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse49 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse50 (_ bv0 32)) (not (= .cse50 .cse49)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse51 (select (select (store .cse52 .cse53 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse51 (_ bv0 32)) (= .cse51 (select (select (store .cse52 .cse53 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse53 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse53)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse54))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse54 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse55 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse56 (select (select (store .cse57 .cse54 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse56) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse57 .cse54 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse56)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse58 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse60 (select (select (store .cse61 .cse58 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse59 (select (select (store .cse61 .cse58 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse59 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse60 (_ bv0 32)) (= .cse60 .cse59) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse58)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse62 (select (select (store .cse63 .cse64 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse62 (_ bv0 32)) (= .cse62 (select (select (store .cse63 .cse64 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse64 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse64)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse65))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse65 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse66) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse65 .cse66))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse65 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select v_arrayElimArr_61 .cse3))) (let ((.cse67 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse68 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse67 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse68))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse69 (select (select (store .cse70 .cse68 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69)) (= (select (select (store .cse70 .cse68 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse69))))) (= .cse67 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse71 (select (select (store .cse72 .cse73 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse71 (_ bv0 32)) (= .cse71 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse71 (select (select (store .cse72 .cse73 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| .cse73)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select v_arrayElimArr_61 .cse3))) (let ((.cse74 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse75 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse74 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse75))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse75 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse76) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse75 .cse76))))) (= .cse74 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_61 .cse3))) (let ((.cse77 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse78 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse77 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse78))) (= .cse77 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse79 (select (select (store .cse80 .cse78 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse78 .cse79)) (= (select (select (store .cse80 .cse78 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse79))))))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64)) (.cse82 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store .cse81 .cse82 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse81 .cse82 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse82))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse82 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse83) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse82 .cse83)))))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse84 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse84 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse86 (select (select (store .cse87 .cse84 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse85 (select (select (store .cse87 .cse84 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse85 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse86 (_ bv0 32)) (= .cse86 .cse85) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse84)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse88))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse89 .cse88 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse89 .cse88 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse90 (select (select (store .cse91 .cse88 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse88 .cse90)) (= (select (select (store .cse91 .cse88 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse90)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse92))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse92 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse93 (select (select (store .cse94 .cse92 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse93 (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse93 (select (select (store .cse94 .cse92 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse95 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse95))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse95 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse96 (_ bv0 32)) (= .cse96 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse97 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse97))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse98 (select (select (store .cse99 .cse97 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse98 (_ bv0 32)) (= .cse98 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse99 .cse97 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse100 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse100))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse100 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse101 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse101 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse103 (select (select (store .cse104 .cse105 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse102 (select (select (store .cse104 .cse105 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse102) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= .cse103 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse103 .cse102))))) (not (= (_ bv0 1) (select |c_#valid| .cse105))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse105 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse106 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse106))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse107 .cse106 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= (select (select (store .cse107 .cse106 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse108))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse108 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse110 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse109 (select (select (store .cse110 .cse108 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse108 .cse109)) (= (select (select (store .cse110 .cse108 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse109)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse111 (select (select (store .cse113 .cse112 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse111 (_ bv0 32)) (not (= .cse111 .cse112)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse111 (select (select (store .cse113 .cse112 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| .cse112)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64)) (.cse115 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store .cse114 .cse115 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse114 .cse115 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse115 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse115)))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse118 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse116 (select (select (store .cse117 .cse118 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse116 (_ bv0 32)) (= .cse116 (select (select (store .cse117 .cse118 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse119 .cse118 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse118 (select (select (store .cse119 .cse118 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse118)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse120 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse121 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse120 .cse121 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse121))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse121 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse120 .cse121 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) is different from true [2023-12-02 12:48:15,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:15,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-12-02 12:48:15,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:15,432 INFO L378 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 800 treesize of output 733 [2023-12-02 12:48:15,465 INFO L378 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 32 treesize of output 24 [2023-12-02 12:48:15,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:15,560 INFO L378 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 30 treesize of output 28 [2023-12-02 12:48:15,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:15,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:48:15,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:48:15,729 INFO L378 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 25 treesize of output 19 [2023-12-02 12:48:15,753 INFO L378 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 19 treesize of output 11 [2023-12-02 12:48:15,884 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 12:48:15,884 INFO L378 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 21 treesize of output 14 [2023-12-02 12:48:15,934 INFO L378 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 [2023-12-02 12:48:16,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:16,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:48:16,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:16,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:48:16,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:16,399 INFO L378 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 161 treesize of output 154 [2023-12-02 12:48:16,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:16,621 INFO L378 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 76 treesize of output 74 [2023-12-02 12:48:16,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:16,846 INFO L378 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 77 treesize of output 73 [2023-12-02 12:48:16,907 INFO L378 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 66 treesize of output 58 [2023-12-02 12:48:16,971 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:17,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:17,237 INFO L378 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 36 treesize of output 35 [2023-12-02 12:48:17,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:17,615 INFO L378 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 136 treesize of output 104 [2023-12-02 12:48:18,810 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:18,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 12:48:18,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:18,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:48:19,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:19,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 12:48:19,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:19,411 INFO L378 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 161 treesize of output 154 [2023-12-02 12:48:19,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:19,632 INFO L378 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 76 treesize of output 74 [2023-12-02 12:48:19,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:19,848 INFO L378 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 77 treesize of output 73 [2023-12-02 12:48:19,908 INFO L378 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 66 treesize of output 58 [2023-12-02 12:48:19,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:20,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:20,190 INFO L378 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 47 treesize of output 46 [2023-12-02 12:48:20,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:20,340 INFO L378 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 155 treesize of output 115 [2023-12-02 12:48:23,068 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:23,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 1 [2023-12-02 12:48:23,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:23,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 12:48:23,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:23,375 INFO L378 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 182 treesize of output 175 [2023-12-02 12:48:23,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:23,536 INFO L378 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 170 treesize of output 118 [2023-12-02 12:48:23,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:23,727 INFO L378 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 110 treesize of output 100 [2023-12-02 12:48:25,356 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:25,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 1 [2023-12-02 12:48:25,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:25,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2023-12-02 12:48:25,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:25,650 INFO L378 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 188 treesize of output 175 [2023-12-02 12:48:25,706 INFO L378 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 54 treesize of output 46 [2023-12-02 12:48:25,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:25,913 INFO L378 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 113 treesize of output 103 [2023-12-02 12:48:26,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:26,118 INFO L378 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 81 treesize of output 73 [2023-12-02 12:48:27,454 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:27,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 12:48:27,508 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:27,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 12:48:27,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:27,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2023-12-02 12:48:27,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:27,787 INFO L378 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 511 treesize of output 480 [2023-12-02 12:48:27,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:27,923 INFO L378 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 215 treesize of output 167 [2023-12-02 12:48:28,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:28,090 INFO L378 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 117 treesize of output 99 [2023-12-02 12:48:31,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:31,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:48:31,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:31,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 12:48:32,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:32,130 INFO L378 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 239 treesize of output 226 [2023-12-02 12:48:32,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:32,313 INFO L378 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 76 treesize of output 74 [2023-12-02 12:48:32,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:32,480 INFO L378 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 70 treesize of output 66 [2023-12-02 12:48:32,536 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:32,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:32,733 INFO L378 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 72 treesize of output 65 [2023-12-02 12:48:32,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:32,890 INFO L378 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 166 treesize of output 130 [2023-12-02 12:48:32,928 INFO L378 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 28 treesize of output 20 [2023-12-02 12:48:36,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:36,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:48:36,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:36,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-12-02 12:48:36,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:36,820 INFO L378 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 317 treesize of output 298 [2023-12-02 12:48:36,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:36,989 INFO L378 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 67 treesize of output 63 [2023-12-02 12:48:37,042 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:37,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:37,237 INFO L378 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 39 treesize of output 38 [2023-12-02 12:48:37,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:37,415 INFO L378 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 71 treesize of output 61 [2023-12-02 12:48:37,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:37,572 INFO L378 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 131 treesize of output 115 [2023-12-02 12:48:38,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:38,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:48:38,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:38,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 12:48:39,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:39,209 INFO L378 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 161 treesize of output 154 [2023-12-02 12:48:39,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:39,377 INFO L378 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 145 treesize of output 135 [2023-12-02 12:48:39,435 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:39,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:39,633 INFO L378 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 47 treesize of output 46 [2023-12-02 12:48:39,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:39,820 INFO L378 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 73 treesize of output 69 [2023-12-02 12:48:39,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:39,973 INFO L378 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 155 treesize of output 115 [2023-12-02 12:48:41,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:41,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:48:41,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:41,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 12:48:41,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:41,717 INFO L378 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 86 treesize of output 85 [2023-12-02 12:48:41,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:41,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:41,966 INFO L378 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 72 treesize of output 65 [2023-12-02 12:48:42,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:42,177 INFO L378 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 121 treesize of output 93 [2023-12-02 12:48:42,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:42,347 INFO L378 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 60 treesize of output 58 [2023-12-02 12:48:42,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:42,508 INFO L378 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 33 treesize of output 33 [2023-12-02 12:48:46,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:46,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 68 [2023-12-02 12:48:47,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:47,201 INFO L378 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 314 treesize of output 295 [2023-12-02 12:48:47,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:47,333 INFO L378 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 210 treesize of output 162 [2023-12-02 12:48:47,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:47,488 INFO L378 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 105 treesize of output 95 [2023-12-02 12:48:47,533 INFO L378 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 28 treesize of output 20 [2023-12-02 12:48:48,987 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:48,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 1 [2023-12-02 12:48:49,021 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:49,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2023-12-02 12:48:49,065 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:49,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2023-12-02 12:48:49,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:49,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:48:49,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:49,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2023-12-02 12:48:49,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:49,476 INFO L378 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 164 treesize of output 157 [2023-12-02 12:48:49,527 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:49,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:49,704 INFO L378 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 72 treesize of output 65 [2023-12-02 12:48:49,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:49,851 INFO L378 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 38 treesize of output 38 [2023-12-02 12:48:49,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:49,990 INFO L378 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 109 treesize of output 89 [2023-12-02 12:48:50,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:50,129 INFO L378 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 35 treesize of output 33 [2023-12-02 12:48:52,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:52,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:48:52,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:52,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 12:48:52,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:52,559 INFO L378 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 164 treesize of output 157 [2023-12-02 12:48:52,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:52,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:52,788 INFO L378 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 72 treesize of output 65 [2023-12-02 12:48:52,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:52,971 INFO L378 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 38 treesize of output 38 [2023-12-02 12:48:53,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:53,118 INFO L378 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 109 treesize of output 89 [2023-12-02 12:48:53,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:53,258 INFO L378 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 35 treesize of output 33 [2023-12-02 12:48:54,524 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:48:54,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 12:48:54,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:54,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:48:54,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:54,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 12:48:55,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:55,053 INFO L378 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 86 treesize of output 85 [2023-12-02 12:48:55,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:55,268 INFO L378 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 76 treesize of output 74 [2023-12-02 12:48:55,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:55,484 INFO L378 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 41 treesize of output 41 [2023-12-02 12:48:55,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:55,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:55,813 INFO L378 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 47 treesize of output 46 [2023-12-02 12:48:56,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:56,022 INFO L378 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 98 treesize of output 74 [2023-12-02 12:48:58,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:58,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:48:58,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:58,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:48:58,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:48:58,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:58,982 INFO L378 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 36 treesize of output 35 [2023-12-02 12:48:59,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:59,330 INFO L378 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 164 treesize of output 157 [2023-12-02 12:48:59,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:59,523 INFO L378 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 39 treesize of output 37 [2023-12-02 12:48:59,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:48:59,721 INFO L378 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 64 treesize of output 56 [2023-12-02 12:49:01,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:01,218 INFO L378 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 20 treesize of output 20 [2023-12-02 12:49:01,340 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:01,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2023-12-02 12:49:01,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:01,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:49:01,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:01,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:49:01,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:01,738 INFO L378 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 161 treesize of output 154 [2023-12-02 12:49:01,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:01,897 INFO L378 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 81 treesize of output 77 [2023-12-02 12:49:02,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:02,053 INFO L378 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 137 treesize of output 127 [2023-12-02 12:49:02,103 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:49:02,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:02,283 INFO L378 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 36 treesize of output 35 [2023-12-02 12:49:02,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:02,506 INFO L378 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 136 treesize of output 104 [2023-12-02 12:49:03,419 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:03,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 12:49:03,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:03,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:49:03,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:03,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:49:03,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:49:03,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:03,836 INFO L378 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 36 treesize of output 35 [2023-12-02 12:49:04,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:04,163 INFO L378 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 317 treesize of output 298 [2023-12-02 12:49:04,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:04,313 INFO L378 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 133 treesize of output 113 [2023-12-02 12:49:04,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:04,461 INFO L378 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 63 treesize of output 53 [2023-12-02 12:49:05,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:05,730 INFO L378 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 20 treesize of output 20 [2023-12-02 12:49:05,857 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:05,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2023-12-02 12:49:05,912 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:05,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 12:49:05,979 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:05,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 1 [2023-12-02 12:49:06,026 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:06,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 12:49:06,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:06,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:49:06,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:06,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:49:06,264 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:49:06,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:06,461 INFO L378 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 36 treesize of output 35 [2023-12-02 12:49:06,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:06,720 INFO L378 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 317 treesize of output 298 [2023-12-02 12:49:06,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:06,878 INFO L378 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 39 treesize of output 37 [2023-12-02 12:49:07,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:07,038 INFO L378 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 125 treesize of output 105 [2023-12-02 12:49:07,079 INFO L378 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 28 treesize of output 20 [2023-12-02 12:49:09,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:09,621 INFO L378 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 20 treesize of output 20 [2023-12-02 12:49:09,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:09,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:49:10,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:10,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 12:49:10,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:10,495 INFO L378 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 161 treesize of output 154 [2023-12-02 12:49:10,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:10,727 INFO L378 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 81 treesize of output 77 [2023-12-02 12:49:10,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:10,958 INFO L378 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 137 treesize of output 127 [2023-12-02 12:49:11,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:49:11,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:11,290 INFO L378 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 72 treesize of output 65 [2023-12-02 12:49:11,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:11,499 INFO L378 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 166 treesize of output 122 [2023-12-02 12:49:13,710 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:13,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 12:49:13,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:13,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:49:13,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:13,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:49:14,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:14,293 INFO L378 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 164 treesize of output 157 [2023-12-02 12:49:14,365 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:49:14,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:14,624 INFO L378 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 36 treesize of output 35 [2023-12-02 12:49:14,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:14,829 INFO L378 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 38 treesize of output 38 [2023-12-02 12:49:15,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:15,029 INFO L378 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 79 treesize of output 71 [2023-12-02 12:49:15,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:15,231 INFO L378 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 35 treesize of output 33 [2023-12-02 12:49:16,063 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:16,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 1 [2023-12-02 12:49:16,128 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:16,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 1 [2023-12-02 12:49:16,172 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:16,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 1 [2023-12-02 12:49:16,242 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:16,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 1 [2023-12-02 12:49:16,315 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 12:49:16,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 1 [2023-12-02 12:49:16,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:16,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 12:49:16,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:16,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 12:49:16,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:16,953 INFO L378 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 317 treesize of output 298 [2023-12-02 12:49:17,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:49:17,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:17,304 INFO L378 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 72 treesize of output 65 [2023-12-02 12:49:17,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:17,537 INFO L378 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 67 treesize of output 63 [2023-12-02 12:49:17,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:17,753 INFO L378 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 71 treesize of output 61 [2023-12-02 12:49:17,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:49:17,963 INFO L378 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 150 treesize of output 122 [2023-12-02 12:49:44,889 WARN L293 SmtUtils]: Spent 19.99s on a formula simplification. DAG size of input: 366 DAG size of output: 359 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:50:37,853 WARN L293 SmtUtils]: Spent 16.35s on a formula simplification that was a NOOP. DAG size: 483 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:51:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-02 12:51:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1090008823] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:51:05,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836626439] [2023-12-02 12:51:05,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:51:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:51:05,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:51:05,138 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:51:05,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37337b22-06d3-417a-be84-05927fabdc66/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 12:51:05,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 12:51:05,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:51:05,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 12:51:05,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:51:05,994 INFO L378 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 7 [2023-12-02 12:51:06,600 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 12:51:06,600 INFO L378 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 19 treesize of output 27 [2023-12-02 12:51:07,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:51:07,152 INFO L378 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 15 treesize of output 1 [2023-12-02 12:51:07,752 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:51:07,752 INFO L378 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 16 treesize of output 15 [2023-12-02 12:51:08,044 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 12:51:08,044 INFO L378 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 35 treesize of output 26 [2023-12-02 12:51:08,311 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 12:51:08,311 INFO L378 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 24 treesize of output 26 [2023-12-02 12:51:08,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:51:09,648 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-02 12:51:09,648 INFO L378 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 129 treesize of output 79 [2023-12-02 12:51:09,683 INFO L378 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 39 treesize of output 15 [2023-12-02 12:51:09,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:09,887 INFO L378 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 24 treesize of output 11 [2023-12-02 12:51:11,437 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 12:51:11,437 INFO L378 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2023-12-02 12:51:11,528 INFO L378 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 32 treesize of output 11 [2023-12-02 12:51:11,633 INFO L378 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 36 treesize of output 15 [2023-12-02 12:51:12,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:51:12,863 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2023-12-02 12:51:12,921 INFO L378 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 7 treesize of output 3 [2023-12-02 12:51:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:51:12,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:51:13,711 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_572) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (_ bv1 32))) is different from false [2023-12-02 12:51:13,882 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (_ BitVec 32)) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (select (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_568)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_572) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (_ bv1 32))) is different from false [2023-12-02 12:51:14,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:14,025 INFO L378 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 52 treesize of output 56 [2023-12-02 12:51:14,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:14,145 INFO L378 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 59 treesize of output 65 [2023-12-02 12:51:14,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:14,297 INFO L378 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 118 treesize of output 121 [2023-12-02 12:51:14,333 INFO L378 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 45 treesize of output 27 [2023-12-02 12:51:14,669 INFO L378 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 30 treesize of output 22 [2023-12-02 12:51:14,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_565 (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_566) v_arrayElimCell_565 v_ArrVal_574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_565))))) (forall ((v_arrayElimArr_124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_124 .cse2))) (or (forall ((v_ArrVal_573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_124) .cse1 v_ArrVal_573) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) (forall ((v_arrayElimArr_124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_124 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse3))) (forall ((v_ArrVal_573 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_124) .cse3 v_ArrVal_573) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) is different from false [2023-12-02 12:51:15,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:15,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 12:51:15,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:15,179 INFO L378 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 205 treesize of output 198 [2023-12-02 12:51:15,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:15,293 INFO L378 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 93 treesize of output 69 [2023-12-02 12:51:15,325 INFO L378 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 54 treesize of output 46 [2023-12-02 12:51:16,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:16,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 12:51:16,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:51:16,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:16,444 INFO L378 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 36 treesize of output 35 [2023-12-02 12:51:16,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:16,665 INFO L378 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 22 treesize of output 22 [2023-12-02 12:51:16,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:16,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 12:51:16,869 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:51:16,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:16,994 INFO L378 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 36 treesize of output 35 [2023-12-02 12:51:17,050 INFO L378 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 7 treesize of output 3 [2023-12-02 12:51:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-02 12:51:40,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836626439] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:51:40,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 12:51:40,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 38 [2023-12-02 12:51:40,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645434197] [2023-12-02 12:51:40,784 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 12:51:40,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 12:51:40,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:51:40,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 12:51:40,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=790, Unknown=22, NotChecked=520, Total=1482 [2023-12-02 12:51:40,786 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 39 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:51:46,661 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32))) (.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))) (forall ((v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_565 (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_566) v_arrayElimCell_565 v_ArrVal_574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_565))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_61 .cse3))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse2 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse1 (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse2 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (not (= (_ bv0 1) (select |c_#valid| .cse2))) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse4 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse4 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse5 .cse4 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse4))) (= (select (select (store .cse5 .cse4 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse8 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse6 (_ bv0 32)) (= .cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse9 .cse8 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse9 .cse8 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse8)))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse11 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse10 (_ bv0 32)) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse11))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (= (select (select (store .cse12 .cse11 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (select (select (store .cse12 .cse11 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse13 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (not (= (_ bv0 1) (select |c_#valid| .cse13))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse13 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse14))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse14 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= (select (select (store .cse15 .cse14 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse15 .cse14 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse16))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse16 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse17 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse16 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse16 .cse18)))))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse21 (select (select (store .cse22 .cse19 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (.cse20 (select (select (store .cse22 .cse19 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse19 .cse20)) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 .cse20))))) (not (= (_ bv0 1) (select |c_#valid| .cse19))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse19 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse23))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse23 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse24 (select (select (store .cse25 .cse23 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse24 (select (select (store .cse25 .cse23 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse26 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse27 .cse26 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse27 .cse26 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse28 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse28 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse29 .cse28 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse28))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse29 .cse28 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| .cse30)) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse31 (select (select (store .cse32 .cse33 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse31 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse31 (select (select (store .cse32 .cse33 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (not (= (_ bv0 1) (select |c_#valid| .cse33))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse33 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse33))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select v_arrayElimArr_61 .cse3))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse34 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse34 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (= .cse35 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse34))) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse36 (select (select (store .cse37 .cse38 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse36 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse36 (select (select (store .cse37 .cse38 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse38 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse38)))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_342 (_ BitVec 32))) (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse39 (select (select (store .cse40 v_arrayElimCell_342 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse39 (_ bv0 32)) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_342))) (= (select (select (store .cse40 v_arrayElimCell_342 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse42 (select (select (store .cse43 v_arrayElimCell_343 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (.cse41 (select (select (store .cse43 v_arrayElimCell_343 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse41 (_ bv0 32)) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse42 .cse41) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_343))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse44 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse44))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse45 (select (select (store .cse46 .cse44 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse46 .cse44 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse45) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse47))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse48 (select (select (store .cse49 .cse47 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse48) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse49 .cse47 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse48))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse47 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_160 (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse51 (select (select (store .cse50 v_arrayElimCell_160 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse50 v_arrayElimCell_160 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse51 (_ bv0 32)) (not (= (select |c_#valid| v_arrayElimCell_160) (_ bv0 1))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse52 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse52 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse52))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select (select (store .cse54 .cse52 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse53) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse52 .cse53))))) (= (select (select (store .cse54 .cse52 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse55))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse55 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse56 (_ bv0 32)) (= .cse56 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse55 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse57 (select (select (store .cse58 v_arrayElimCell_344 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse57 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse57 (select (select (store .cse58 v_arrayElimCell_344 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse57 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_344))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse59))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse60 .cse59 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse60 .cse59 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse61 (select (select (store .cse62 .cse59 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse61) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse62 .cse59 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse61)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse63))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse63 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse64 (_ bv0 32)) (not (= .cse64 .cse63)) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse66 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse65 .cse66 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse66 (select (select (store .cse65 .cse66 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (not (= (_ bv0 1) (select |c_#valid| .cse66))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse66 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse67))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse67 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse68 (_ bv0 32)) (= .cse68 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (let ((.cse69 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (= (select (select (store .cse69 .cse67 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (select (select (store .cse69 .cse67 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse70))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse70 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse71 (_ bv0 32)) (not (= .cse71 .cse70)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse72 (select (select (store .cse73 .cse74 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse72 (_ bv0 32)) (= .cse72 (select (select (store .cse73 .cse74 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse74 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse74)))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse76 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse75 .cse76 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse76))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse76 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (= (select (select (store .cse75 .cse76 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse77))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse77 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse78 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse78 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse79 (select (select (store .cse80 .cse77 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse79) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse80 .cse77 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse79)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse81 (select (select (store .cse82 .cse83 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse81 (_ bv0 32)) (= .cse81 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse82 .cse83 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse83))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse83 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse85 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse84 (_ bv0 32)) (= .cse84 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse85))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse85 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse86 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse88 (select (select (store .cse89 .cse86 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (.cse87 (select (select (store .cse89 .cse86 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse87 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse88 (_ bv0 32)) (= .cse88 .cse87) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse86)))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse90 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse90))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse91 (select (select (store .cse92 .cse90 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse91 (_ bv0 32)) (= (select (select (store .cse92 .cse90 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse91) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse93 (select (select (store .cse94 .cse95 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse93 (_ bv0 32)) (= .cse93 (select (select (store .cse94 .cse95 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse95 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse95 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (not (= (_ bv0 1) (select |c_#valid| .cse95)))))) (forall ((v_arrayElimArr_124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select v_arrayElimArr_124 .cse3))) (or (forall ((v_ArrVal_573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_124) .cse96 v_ArrVal_573) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (not (= (_ bv0 1) (select |c_#valid| .cse96)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse97))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse98 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse97 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse98) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse97 .cse98))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse97 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse100 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse99 (_ bv0 32)) (= .cse99 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse100))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse101 (select (select (store .cse102 .cse100 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= .cse101 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse101 (select (select (store .cse102 .cse100 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (select v_arrayElimArr_61 .cse3))) (let ((.cse103 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse104 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse103 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse104))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse105 (select (select (store .cse106 .cse104 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse105)) (= (select (select (store .cse106 .cse104 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse105))))) (= .cse103 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34)) (.cse108 (select v_arrayElimArr_34 .cse3))) (let ((.cse109 (select (select (store .cse107 .cse108 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse107 .cse108 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse108))) (= .cse109 (_ bv0 32)) (= .cse109 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse110 (select (select (store .cse111 .cse112 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse110 (_ bv0 32)) (= .cse110 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse110 (select (select (store .cse111 .cse112 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (not (= (_ bv0 1) (select |c_#valid| .cse112)))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse113))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse113 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse114 (_ bv0 32)) (not (= .cse114 .cse113)) (= .cse114 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse115 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse115))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse115 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse117 (select (select (store .cse116 .cse115 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse116 .cse115 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse117) (= .cse117 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (select v_arrayElimArr_34 .cse3))) (let ((.cse119 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse118 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse118))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse118 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse119 (_ bv0 32)) (= .cse119 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_161 (_ BitVec 32)) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse121 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse120 (select (select (store .cse121 v_arrayElimCell_161 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse120 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse120 (select (select (store .cse121 v_arrayElimCell_161 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_161))) (= .cse120 (_ bv0 32)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse123 (select v_arrayElimArr_61 .cse3))) (let ((.cse122 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse123 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse122 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse123))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse123 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse124) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse123 .cse124))))) (= .cse122 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse125))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse126 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse125 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse126 (_ bv0 32)) (not (= .cse126 .cse125)) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (select v_arrayElimArr_61 .cse3))) (let ((.cse127 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse128 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse127 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse128))) (= .cse127 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse130 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse129 (select (select (store .cse130 .cse128 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse128 .cse129)) (= (select (select (store .cse130 .cse128 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse129))))))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse131 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse131))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse133 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse132 (select (select (store .cse133 .cse131 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse132 (_ bv0 32)) (not (= .cse132 .cse131)) (= (select (select (store .cse133 .cse131 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse132) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse134 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64)) (.cse135 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store .cse134 .cse135 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse134 .cse135 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse135))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse136 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse135 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse136) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse135 .cse136)))))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse137 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse137 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse137 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse140 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse139 (select (select (store .cse140 .cse137 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (.cse138 (select (select (store .cse140 .cse137 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse138 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse139 (_ bv0 32)) (= .cse139 .cse138) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse137)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse30) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse141))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse141 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse141 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse141))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse142))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse143 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (= (select (select (store .cse143 .cse142 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse143 .cse142 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse145 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse144 (select (select (store .cse145 .cse142 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse142 .cse144)) (= (select (select (store .cse145 .cse142 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse144)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse146 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse146))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse146 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse148 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse147 (select (select (store .cse148 .cse146 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse147 (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse147 (select (select (store .cse148 .cse146 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse149 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse149 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse149))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse150 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse149 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse150 (_ bv0 32)) (= .cse150 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse151 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse151))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse152 (select (select (store .cse153 .cse151 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse152 (_ bv0 32)) (= .cse152 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse153 .cse151 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse154 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse154))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse155 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse154 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse155 (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= .cse155 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse159 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse157 (select (select (store .cse158 .cse159 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (.cse156 (select (select (store .cse158 .cse159 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse156) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= .cse157 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse157 .cse156))))) (not (= (_ bv0 1) (select |c_#valid| .cse159))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse159 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32)))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse160 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse160 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse160))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse161 .cse160 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))) (= (select (select (store .cse161 .cse160 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (select v_arrayElimArr_61 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse162))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse162 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse163 (select (select (store .cse164 .cse162 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse162 .cse163)) (= (select (select (store .cse164 .cse162 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse163)))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse165 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse165 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse165))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse166 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= (select (select (store .cse166 .cse165 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse166 .cse165 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse167 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse167))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (not (= (select v_arrayElimArr_33 (_ bv4 32)) (_ bv0 32))) (let ((.cse168 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (= (select (select (store .cse168 .cse167 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (select (select (store .cse168 .cse167 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (forall ((v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse169 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse167 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse169 (_ bv0 32)) (= .cse169 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse170 (select v_arrayElimArr_124 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse170))) (forall ((v_ArrVal_573 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse170 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_124) .cse170 v_ArrVal_573) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse172 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61))) (let ((.cse171 (select (select (store .cse173 .cse172 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse171 (_ bv0 32)) (not (= .cse171 .cse172)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))) (= .cse171 (select (select (store .cse173 .cse172 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (not (= (_ bv0 1) (select |c_#valid| .cse172)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse174 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64)) (.cse175 (select v_arrayElimArr_61 .cse3))) (or (= (select (select (store .cse174 .cse175 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse174 .cse175 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61) .cse175 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse175)))))) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse178 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse177 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64))) (let ((.cse176 (select (select (store .cse177 .cse178 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_234 (_ bv4 32)) (_ bv0 32))) (= .cse176 (_ bv0 32)) (= .cse176 (select (select (store .cse177 .cse178 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse179 .cse178 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (not (= .cse178 (select (select (store .cse179 .cse178 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (not (= (_ bv0 1) (select |c_#valid| .cse178)))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse30))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse180 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse180))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse182 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse181 (select (select (store .cse182 .cse180 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse181 (_ bv0 32)) (= .cse181 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse182 .cse180 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse181) (not (= (select v_arrayElimArr_32 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse183 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_61)) (.cse184 (select v_arrayElimArr_61 .cse3))) (or (forall ((v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse183 .cse184 v_arrayElimArr_59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_59 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse184))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_60 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) .cse184 v_arrayElimArr_60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_64 .cse3) (_ bv0 32))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse183 .cse184 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse187 (select v_arrayElimArr_34 .cse3))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse186 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse185 (select (select (store .cse186 .cse187 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= .cse185 (_ bv0 32)) (= .cse185 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= (select (select (store .cse186 .cse187 v_arrayElimArr_33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse187))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse189 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse188 (select (select (store .cse189 .cse187 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= .cse188 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (= .cse188 (select (select (store .cse189 .cse187 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (forall ((v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse190 (select v_arrayElimArr_34 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse190))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse192 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34))) (let ((.cse191 (select (select (store .cse192 .cse190 v_prenex_4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_prenex_4 (_ bv4 32)) (_ bv0 32))) (not (= .cse191 .cse190)) (= .cse191 (select (select (store .cse192 .cse190 v_arrayElimArr_32) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse190 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32))))))))))) is different from true