./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje --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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:08:48,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:08:48,374 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:08:48,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:08:48,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:08:48,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:08:48,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:08:48,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:08:48,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:08:48,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:08:48,419 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:08:48,419 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:08:48,420 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:08:48,420 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:08:48,421 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:08:48,421 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:08:48,421 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:08:48,421 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:08:48,422 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:08:48,422 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:08:48,423 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:08:48,423 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:08:48,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:08:48,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:08:48,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:08:48,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:08:48,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:08:48,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:08:48,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:08:48,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:08:48,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:08:48,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:08:48,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:08:48,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:08:48,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:08:48,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:08:48,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:08:48,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:08:48,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:08:48,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:08:48,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:08:48,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:08:48,431 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:08:48,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:08:48,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:08:48,432 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:08:48,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:08:48,432 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_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2024-11-09 01:08:48,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:08:48,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:08:48,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:08:48,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:08:48,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:08:48,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-properties/alternating_list-1.i Unable to find full path for "g++" [2024-11-09 01:08:50,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:08:51,005 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:08:51,008 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/sv-benchmarks/c/list-properties/alternating_list-1.i [2024-11-09 01:08:51,030 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/data/ef3ced0a9/0f6d327234364063a7e07b4f78e663f3/FLAG36027226d [2024-11-09 01:08:51,341 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/data/ef3ced0a9/0f6d327234364063a7e07b4f78e663f3 [2024-11-09 01:08:51,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:08:51,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:08:51,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:08:51,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:08:51,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:08:51,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51, skipping insertion in model container [2024-11-09 01:08:51,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:08:51,760 WARN L250 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_15231043-ad9f-4700-b452-c73c75a5ecae/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2024-11-09 01:08:51,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:08:51,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:08:51,852 WARN L250 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_15231043-ad9f-4700-b452-c73c75a5ecae/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2024-11-09 01:08:51,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:08:51,881 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:08:51,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51 WrapperNode [2024-11-09 01:08:51,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:08:51,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:08:51,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:08:51,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:08:51,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,935 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2024-11-09 01:08:51,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:08:51,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:08:51,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:08:51,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:08:51,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:08:51,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:08:51,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:08:51,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:08:51,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (1/1) ... [2024-11-09 01:08:51,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:08:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:08:52,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:08:52,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:08:52,042 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 01:08:52,042 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 01:08:52,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:08:52,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:08:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:08:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:08:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:08:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:08:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:08:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:08:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:08:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:08:52,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:08:52,165 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:08:52,189 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 01:08:52,345 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 01:08:52,345 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:08:52,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:08:52,402 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 01:08:52,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:08:52 BoogieIcfgContainer [2024-11-09 01:08:52,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:08:52,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:08:52,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:08:52,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:08:52,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:08:51" (1/3) ... [2024-11-09 01:08:52,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195cc0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:08:52, skipping insertion in model container [2024-11-09 01:08:52,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:08:51" (2/3) ... [2024-11-09 01:08:52,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195cc0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:08:52, skipping insertion in model container [2024-11-09 01:08:52,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:08:52" (3/3) ... [2024-11-09 01:08:52,414 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2024-11-09 01:08:52,439 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:08:52,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:08:52,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:08:52,498 INFO L333 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, 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;@1d7d6404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:08:52,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:08:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 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) [2024-11-09 01:08:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:08:52,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:52,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:52,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:08:52,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2024637044, now seen corresponding path program 1 times [2024-11-09 01:08:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:52,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841456163] [2024-11-09 01:08:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:52,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841456163] [2024-11-09 01:08:52,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841456163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:08:52,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:08:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:08:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494606325] [2024-11-09 01:08:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:08:52,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:08:52,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:52,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:08:52,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:08:52,781 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:08:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:52,819 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2024-11-09 01:08:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:08:52,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 01:08:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:52,828 INFO L225 Difference]: With dead ends: 41 [2024-11-09 01:08:52,829 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 01:08:52,832 INFO L431 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 [2024-11-09 01:08:52,836 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:52,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:08:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 01:08:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 01:08:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2024-11-09 01:08:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-09 01:08:52,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2024-11-09 01:08:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:52,874 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-09 01:08:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:08:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-09 01:08:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:08:52,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:52,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:52,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:08:52,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:08:52,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash 396703946, now seen corresponding path program 1 times [2024-11-09 01:08:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965040480] [2024-11-09 01:08:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:53,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965040480] [2024-11-09 01:08:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965040480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:08:53,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:08:53,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:08:53,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518794080] [2024-11-09 01:08:53,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:08:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:08:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:08:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:08:53,203 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2024-11-09 01:08:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:53,301 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-09 01:08:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:08:53,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 11 [2024-11-09 01:08:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:53,303 INFO L225 Difference]: With dead ends: 39 [2024-11-09 01:08:53,303 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 01:08:53,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:08:53,305 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:53,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:08:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 01:08:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2024-11-09 01:08:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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) [2024-11-09 01:08:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-09 01:08:53,311 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2024-11-09 01:08:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:53,312 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-09 01:08:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2024-11-09 01:08:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-09 01:08:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 01:08:53,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:53,313 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:53,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:08:53,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:08:53,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash 581461662, now seen corresponding path program 1 times [2024-11-09 01:08:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:53,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723362916] [2024-11-09 01:08:53,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:53,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:53,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723362916] [2024-11-09 01:08:53,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723362916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:08:53,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034024594] [2024-11-09 01:08:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:53,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:08:53,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:08:53,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:08:53,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:08:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:54,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:08:54,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:08:54,086 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 [2024-11-09 01:08:54,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:08:54,251 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 [2024-11-09 01:08:54,266 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:08:54,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:08:54,355 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 [2024-11-09 01:08:54,398 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 [2024-11-09 01:08:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:54,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:08:54,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_73 (Array Int Int)) (v_ArrVal_70 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_70) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_73) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (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_70 .cse0))) v_ArrVal_70)))) is different from false [2024-11-09 01:08:54,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:08:54,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 66 [2024-11-09 01:08:54,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:08:54,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 73 [2024-11-09 01:08:54,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:08:54,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2024-11-09 01:08:54,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:08:54,681 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-11-09 01:08:54,812 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-09 01:08:54,812 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 180 [2024-11-09 01:08:54,832 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 100 treesize of output 96 [2024-11-09 01:08:55,085 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 22 treesize of output 20 [2024-11-09 01:08:55,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:08:55,119 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 199 treesize of output 193 [2024-11-09 01:08:55,139 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 148 treesize of output 144 [2024-11-09 01:08:55,153 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 144 treesize of output 142 [2024-11-09 01:08:55,400 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 [2024-11-09 01:08:55,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:08:55,417 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 65 [2024-11-09 01:08:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:55,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034024594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:08:55,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1378388979] [2024-11-09 01:08:55,647 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 01:08:55,648 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:08:55,652 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:08:55,658 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:08:55,659 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:08:56,965 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:09:27,618 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '274#(and (exists ((|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_32| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_37| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |#memory_int| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~p~0#1.base_37| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~p~0#1.base_37|) |v_ULTIMATE.start_main_~p~0#1.offset_35| 3))) (exists ((|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_30| (Array Int (Array Int Int))) (|v_#memory_int_37| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_36| Int)) (and (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~p~0#1.base_36| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~p~0#1.base_36|) 4 (select (select |v_#memory_$Pointer$.base_32| |v_ULTIMATE.start_main_~p~0#1.base_36|) 4))) |v_#memory_$Pointer$.base_32|) (= (store |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~p~0#1.base_36| (store (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~p~0#1.base_36|) 4 0)) |v_#memory_$Pointer$.offset_31|) (= |v_ULTIMATE.start_main_~p~0#1.base_37| (select (select |v_#memory_$Pointer$.base_32| |v_ULTIMATE.start_main_~p~0#1.base_36|) 4)) (= (store |v_#memory_int_37| |v_ULTIMATE.start_main_~p~0#1.base_36| (store (select |v_#memory_int_37| |v_ULTIMATE.start_main_~p~0#1.base_36|) 4 (select (select |v_#memory_int_38| |v_ULTIMATE.start_main_~p~0#1.base_36|) 4))) |v_#memory_int_38|) (= |v_ULTIMATE.start_main_~p~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_36|) 4)))) (= (store |v_#memory_$Pointer$.base_32| |v_ULTIMATE.start_main_~p~0#1.base_37| (store (select |v_#memory_$Pointer$.base_32| |v_ULTIMATE.start_main_~p~0#1.base_37|) |v_ULTIMATE.start_main_~p~0#1.offset_35| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_37|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_37| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_37|) |v_ULTIMATE.start_main_~p~0#1.offset_35| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_37|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)))))) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~flag~0#1| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)) (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|))' at error location [2024-11-09 01:09:27,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:09:27,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:09:27,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-09 01:09:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94660765] [2024-11-09 01:09:27,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:09:27,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:09:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:09:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:09:27,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=469, Unknown=17, NotChecked=44, Total=600 [2024-11-09 01:09:27,622 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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) [2024-11-09 01:09:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:27,810 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-09 01:09:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:09:27,811 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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 15 [2024-11-09 01:09:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:27,813 INFO L225 Difference]: With dead ends: 38 [2024-11-09 01:09:27,813 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 01:09:27,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=75, Invalid=512, Unknown=17, NotChecked=46, Total=650 [2024-11-09 01:09:27,814 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:27,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2024-11-09 01:09:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 01:09:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2024-11-09 01:09:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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) [2024-11-09 01:09:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 01:09:27,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 15 [2024-11-09 01:09:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:27,822 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 01:09:27,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 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) [2024-11-09 01:09:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 01:09:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 01:09:27,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:27,823 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:09:27,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:09:28,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 01:09:28,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:28,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 581468606, now seen corresponding path program 1 times [2024-11-09 01:09:28,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:09:28,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385625465] [2024-11-09 01:09:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:09:28,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:09:28,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385625465] [2024-11-09 01:09:28,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385625465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:28,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:09:28,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:09:28,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756765561] [2024-11-09 01:09:28,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:28,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:09:28,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:09:28,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:09:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:09:28,094 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2024-11-09 01:09:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:28,114 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-09 01:09:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:09:28,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) Word has length 15 [2024-11-09 01:09:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:28,116 INFO L225 Difference]: With dead ends: 41 [2024-11-09 01:09:28,117 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 01:09:28,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:09:28,118 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:28,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:09:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 01:09:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-09 01:09:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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) [2024-11-09 01:09:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 01:09:28,129 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2024-11-09 01:09:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:28,130 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 01:09:28,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2024-11-09 01:09:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 01:09:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 01:09:28,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:28,133 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:09:28,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:09:28,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:28,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2046331506, now seen corresponding path program 2 times [2024-11-09 01:09:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:09:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670709222] [2024-11-09 01:09:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:09:28,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:09:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670709222] [2024-11-09 01:09:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670709222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:09:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931630180] [2024-11-09 01:09:28,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:09:28,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:28,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:09:28,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:09:28,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:09:28,900 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 01:09:28,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:09:28,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 01:09:28,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:09:28,920 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 [2024-11-09 01:09:29,018 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:09:29,031 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:09:29,032 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 [2024-11-09 01:09:29,038 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:09:29,106 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 [2024-11-09 01:09:29,111 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 23 treesize of output 11 [2024-11-09 01:09:29,188 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 01:09:29,189 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 24 treesize of output 17 [2024-11-09 01:09:29,193 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 16 treesize of output 8 [2024-11-09 01:09:29,199 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 8 treesize of output 1 [2024-11-09 01:09:29,204 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 [2024-11-09 01:09:29,250 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 [2024-11-09 01:09:29,304 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 01:09:29,304 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 19 treesize of output 22 [2024-11-09 01:09:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:09:29,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:09:29,734 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_42| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_190))) (or (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_42|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-09 01:09:29,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:09:29,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 [2024-11-09 01:09:29,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_190 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_42| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_190))) (or (= 3 (select (select (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_42|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (.cse1 (= |c_ULTIMATE.start_main_~flag~0#1| 0))) (and (or .cse0 (not .cse1)) (or .cse0 .cse1))) is different from false [2024-11-09 01:09:29,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~flag~0#1| 0)) (.cse1 (forall ((v_ArrVal_190 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_42| Int) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_190))) (or (not (= v_ArrVal_185 (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 (select v_ArrVal_185 .cse2))))) (= 3 (select (select (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_42|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) (and (or .cse0 .cse1) (or (not .cse0) .cse1))) is different from false [2024-11-09 01:09:29,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:09:29,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 66 [2024-11-09 01:09:29,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:09:29,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 60 [2024-11-09 01:09:29,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:09:29,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 67 [2024-11-09 01:09:30,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:09:30,016 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-11-09 01:09:30,173 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-11-09 01:09:30,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1280 treesize of output 1271 [2024-11-09 01:09:30,239 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 692 treesize of output 656 [2024-11-09 01:09:34,520 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 61 treesize of output 57 [2024-11-09 01:09:34,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:09:34,626 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 43 treesize of output 39 [2024-11-09 01:09:34,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:09:34,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 10283 treesize of output 10085 [2024-11-09 01:09:34,894 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 952 treesize of output 916 [2024-11-09 01:09:34,963 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 900 treesize of output 882 [2024-11-09 01:09:37,741 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 6 treesize of output 4 [2024-11-09 01:09:38,237 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 6 treesize of output 4 [2024-11-09 01:09:39,490 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 01:09:39,491 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 327 treesize of output 308 [2024-11-09 01:09:39,599 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 [2024-11-09 01:09:39,620 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 6 treesize of output 4 [2024-11-09 01:09:39,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:09:39,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:09:39,636 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 38 treesize of output 28 [2024-11-09 01:09:39,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:09:39,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:09:39,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 38 treesize of output 28 [2024-11-09 01:09:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 01:09:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931630180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:09:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [819245577] [2024-11-09 01:09:39,781 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 01:09:39,783 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:09:39,784 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:09:39,784 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:09:39,784 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:09:44,695 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:09:44,993 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| 1))) (and (<= 1 |c_#StackHeapBarrier|) (= (select .cse0 1) 0) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#length_23| (Array Int Int))) (and (= |c_#length| (store |v_#length_23| |c_ULTIMATE.start_main_~a~0#1.base| 8)) (= (select |v_#length_23| 1) 2) (= 21 (select |v_#length_23| 2)))) (= |c_ULTIMATE.start_main_~flag~0#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 48 (select .cse0 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| 0)) (exists ((|v_#valid_29| (Array Int Int))) (and (= (select |v_#valid_29| 2) 1) (= |c_#valid| (store |v_#valid_29| |c_ULTIMATE.start_main_~a~0#1.base| 1)) (= (select |v_#valid_29| 1) 1) (= (select |v_#valid_29| |c_ULTIMATE.start_main_~a~0#1.base|) 0) (= (select |v_#valid_29| 0) 0))) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_44| Int) (|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_47|) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_47|) .cse1))) (and (= (store |v_#memory_int_55| |v_ULTIMATE.start_main_~p~0#1.base_47| (store (select |v_#memory_int_55| |v_ULTIMATE.start_main_~p~0#1.base_47|) .cse1 (select (select |c_#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_47|) .cse1))) |c_#memory_int|) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse3) (= (store |v_#memory_$Pointer$.offset_46| |v_ULTIMATE.start_main_~p~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_46| |v_ULTIMATE.start_main_~p~0#1.base_47|) .cse1 .cse2)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_47| |v_ULTIMATE.start_main_~p~0#1.base_47| (store (select |v_#memory_$Pointer$.base_47| |v_ULTIMATE.start_main_~p~0#1.base_47|) .cse1 .cse3)))))))) is different from true [2024-11-09 01:09:46,831 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '586#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~flag~0#1| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (exists ((|v_#memory_int_56| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_45| Int) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_main_~p~0#1.base_48|) |v_ULTIMATE.start_main_~p~0#1.offset_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_48|) |v_ULTIMATE.start_main_~p~0#1.offset_45|))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_56| |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select |v_#memory_int_56| |v_ULTIMATE.start_main_~p~0#1.base_48|) |v_ULTIMATE.start_main_~p~0#1.offset_45| 3))) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_44| Int) (|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (and (= |v_ULTIMATE.start_main_~p~0#1.base_48| (select (select |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_main_~p~0#1.base_47|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4))) (= (store |v_#memory_$Pointer$.base_47| |v_ULTIMATE.start_main_~p~0#1.base_47| (store (select |v_#memory_$Pointer$.base_47| |v_ULTIMATE.start_main_~p~0#1.base_47|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4) (select (select |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_main_~p~0#1.base_47|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4)))) |v_#memory_$Pointer$.base_48|) (= (store |v_#memory_int_55| |v_ULTIMATE.start_main_~p~0#1.base_47| (store (select |v_#memory_int_55| |v_ULTIMATE.start_main_~p~0#1.base_47|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4) (select (select |v_#memory_int_56| |v_ULTIMATE.start_main_~p~0#1.base_47|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4)))) |v_#memory_int_56|) (= (store |v_#memory_$Pointer$.offset_46| |v_ULTIMATE.start_main_~p~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_46| |v_ULTIMATE.start_main_~p~0#1.base_47|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4) (select (select |v_#memory_$Pointer$.offset_47| |v_ULTIMATE.start_main_~p~0#1.base_47|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4)))) |v_#memory_$Pointer$.offset_47|) (= (select (select |v_#memory_$Pointer$.offset_47| |v_ULTIMATE.start_main_~p~0#1.base_47|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_44| 4)) |v_ULTIMATE.start_main_~p~0#1.offset_45|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_47| |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select |v_#memory_$Pointer$.offset_47| |v_ULTIMATE.start_main_~p~0#1.base_48|) |v_ULTIMATE.start_main_~p~0#1.offset_45| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_48|) |v_ULTIMATE.start_main_~p~0#1.offset_45|)))))) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))' at error location [2024-11-09 01:09:46,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:09:46,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:09:46,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-09 01:09:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004594327] [2024-11-09 01:09:46,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:09:46,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 01:09:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:09:46,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 01:09:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=943, Unknown=7, NotChecked=260, Total=1332 [2024-11-09 01:09:46,834 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:09:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:47,940 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-11-09 01:09:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:09:47,941 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 01:09:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:47,943 INFO L225 Difference]: With dead ends: 48 [2024-11-09 01:09:47,943 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 01:09:47,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=332, Invalid=2119, Unknown=15, NotChecked=396, Total=2862 [2024-11-09 01:09:47,945 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:47,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 145 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 311 Invalid, 0 Unknown, 135 Unchecked, 0.3s Time] [2024-11-09 01:09:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 01:09:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2024-11-09 01:09:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2024-11-09 01:09:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-09 01:09:47,950 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 19 [2024-11-09 01:09:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:47,951 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-09 01:09:47,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:09:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-09 01:09:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 01:09:47,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:47,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:09:47,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:09:48,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:48,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:48,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1370212185, now seen corresponding path program 1 times [2024-11-09 01:09:48,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:09:48,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759563261] [2024-11-09 01:09:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:09:48,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:09:48,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759563261] [2024-11-09 01:09:48,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759563261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:48,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:09:48,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:09:48,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478955303] [2024-11-09 01:09:48,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:48,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:09:48,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:09:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:09:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:09:48,195 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-09 01:09:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:48,211 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-09 01:09:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:09:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 [2024-11-09 01:09:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:48,212 INFO L225 Difference]: With dead ends: 40 [2024-11-09 01:09:48,212 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 01:09:48,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:09:48,213 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:48,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:09:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 01:09:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-09 01:09:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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) [2024-11-09 01:09:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-09 01:09:48,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2024-11-09 01:09:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:48,218 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 01:09:48,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-09 01:09:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-09 01:09:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 01:09:48,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:48,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:09:48,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:09:48,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:48,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1370205241, now seen corresponding path program 1 times [2024-11-09 01:09:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:09:48,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485733331] [2024-11-09 01:09:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:09:48,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:09:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485733331] [2024-11-09 01:09:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485733331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:09:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744189327] [2024-11-09 01:09:48,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:48,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:48,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:09:48,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:09:48,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:09:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:48,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 01:09:48,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:09:48,794 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 [2024-11-09 01:09:48,850 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:09:48,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 11 treesize of output 11 [2024-11-09 01:09:48,890 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 [2024-11-09 01:09:48,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 19 treesize of output 1 [2024-11-09 01:09:48,969 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 01:09:48,969 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 80 treesize of output 73 [2024-11-09 01:09:48,977 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 29 treesize of output 19 [2024-11-09 01:09:48,981 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 [2024-11-09 01:09:49,044 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 [2024-11-09 01:09:49,048 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 [2024-11-09 01:09:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:09:49,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:09:49,123 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 79 treesize of output 57 [2024-11-09 01:09:49,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:09:49,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 [2024-11-09 01:09:49,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:09:49,208 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 [2024-11-09 01:09:49,217 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 [2024-11-09 01:09:49,223 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 01:09:49,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 1 [2024-11-09 01:09:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:09:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744189327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:09:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1899808910] [2024-11-09 01:09:49,330 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 01:09:49,330 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:09:49,331 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:09:49,331 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:09:49,331 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:09:54,532 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:09:54,799 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_59| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_58| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_55| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_58|) .cse1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_58|) .cse1))) (and (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_59| |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select |v_#memory_$Pointer$.offset_59| |v_ULTIMATE.start_main_~p~0#1.base_58|) .cse1 .cse0))) (= |c_#memory_int| (store |v_#memory_int_67| |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select |v_#memory_int_67| |v_ULTIMATE.start_main_~p~0#1.base_58|) .cse1 (select (select |c_#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_58|) .cse1)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_main_~p~0#1.base_58|) .cse1 .cse2))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse2))))) (let ((.cse3 (select |c_#memory_int| 1))) (and (exists ((|v_#length_29| (Array Int Int))) (and (= 2 (select |v_#length_29| 1)) (= |c_#length| (store |v_#length_29| |c_ULTIMATE.start_main_~a~0#1.base| 8)) (= 21 (select |v_#length_29| 2)))) (<= 1 |c_#StackHeapBarrier|) (= (select .cse3 1) 0) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= 0 (select |v_#valid_36| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select |v_#valid_36| 1) 1) (= (select |v_#valid_36| 2) 1) (= (select |v_#valid_36| 0) 0) (= |c_#valid| (store |v_#valid_36| |c_ULTIMATE.start_main_~a~0#1.base| 1)))) (= |c_ULTIMATE.start_main_~flag~0#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 48 (select .cse3 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from true [2024-11-09 01:10:01,559 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '932#(and (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_61| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_56| Int) (|v_#memory_$Pointer$.offset_60| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_main_~p~0#1.base_59|) |v_ULTIMATE.start_main_~p~0#1.offset_56| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_59|) |v_ULTIMATE.start_main_~p~0#1.offset_56|)))) (exists ((|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_59| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_58| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_55| Int)) (and (= |v_#memory_int_68| (store |v_#memory_int_67| |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select |v_#memory_int_67| |v_ULTIMATE.start_main_~p~0#1.base_58|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4) (select (select |v_#memory_int_68| |v_ULTIMATE.start_main_~p~0#1.base_58|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4))))) (= |v_ULTIMATE.start_main_~p~0#1.offset_56| (select (select |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_main_~p~0#1.base_58|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4))) (= (select (select |v_#memory_$Pointer$.base_61| |v_ULTIMATE.start_main_~p~0#1.base_58|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4)) |v_ULTIMATE.start_main_~p~0#1.base_59|) (= (store |v_#memory_$Pointer$.offset_59| |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select |v_#memory_$Pointer$.offset_59| |v_ULTIMATE.start_main_~p~0#1.base_58|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4) (select (select |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_main_~p~0#1.base_58|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4)))) |v_#memory_$Pointer$.offset_60|) (= (store |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_main_~p~0#1.base_58|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4) (select (select |v_#memory_$Pointer$.base_61| |v_ULTIMATE.start_main_~p~0#1.base_58|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_55| 4)))) |v_#memory_$Pointer$.base_61|))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_61| |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select |v_#memory_$Pointer$.base_61| |v_ULTIMATE.start_main_~p~0#1.base_59|) |v_ULTIMATE.start_main_~p~0#1.offset_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_59|) |v_ULTIMATE.start_main_~p~0#1.offset_56|)))) (= |#memory_int| (store |v_#memory_int_68| |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~p~0#1.base_59|) |v_ULTIMATE.start_main_~p~0#1.offset_56| 3))))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) |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|) 3)) (= |ULTIMATE.start_main_~flag~0#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) |ULTIMATE.start_main_~p~0#1.base|))' at error location [2024-11-09 01:10:01,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:10:01,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:10:01,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-11-09 01:10:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360594441] [2024-11-09 01:10:01,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:10:01,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 01:10:01,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:10:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 01:10:01,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=779, Unknown=12, NotChecked=56, Total=930 [2024-11-09 01:10:01,562 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:10:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:01,985 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-11-09 01:10:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:10:01,985 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 01:10:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:01,986 INFO L225 Difference]: With dead ends: 53 [2024-11-09 01:10:01,986 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 01:10:01,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=146, Invalid=1106, Unknown=12, NotChecked=68, Total=1332 [2024-11-09 01:10:01,987 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:01,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 114 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:10:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 01:10:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-11-09 01:10:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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) [2024-11-09 01:10:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-09 01:10:01,997 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 20 [2024-11-09 01:10:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:01,997 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-09 01:10:01,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:10:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-09 01:10:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:10:01,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:01,999 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:10:02,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:10:02,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 01:10:02,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:02,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:02,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1939508109, now seen corresponding path program 2 times [2024-11-09 01:10:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:10:02,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733204354] [2024-11-09 01:10:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:10:03,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:10:03,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733204354] [2024-11-09 01:10:03,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733204354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:10:03,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029962295] [2024-11-09 01:10:03,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:10:03,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:10:03,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:10:03,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:10:03,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:10:03,191 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 01:10:03,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:10:03,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 01:10:03,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:03,203 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 [2024-11-09 01:10:03,290 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:10:03,291 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 [2024-11-09 01:10:03,298 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:10:03,311 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:10:03,374 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 [2024-11-09 01:10:03,391 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:10:03,466 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 01:10:03,466 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 24 treesize of output 17 [2024-11-09 01:10:03,476 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:10:03,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:10:03,485 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 [2024-11-09 01:10:03,577 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:10:03,577 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 93 treesize of output 80 [2024-11-09 01:10:03,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 27 treesize of output 22 [2024-11-09 01:10:03,602 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 [2024-11-09 01:10:03,725 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-09 01:10:03,725 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2024-11-09 01:10:03,747 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:10:03,747 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 45 treesize of output 38 [2024-11-09 01:10:03,770 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 01:10:03,770 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 1 case distinctions, treesize of input 21 treesize of output 26 [2024-11-09 01:10:03,810 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 37 treesize of output 27 [2024-11-09 01:10:04,346 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 50 treesize of output 34 [2024-11-09 01:10:04,352 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:10:04,352 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 30 [2024-11-09 01:10:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:10:04,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:10:05,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:10:05,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 79 [2024-11-09 01:10:05,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:10:05,198 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-11-09 01:10:05,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:10:05,288 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 90 treesize of output 88 [2024-11-09 01:10:05,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:10:05,357 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 90 treesize of output 88 [2024-11-09 01:10:05,570 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 13 treesize of output 1 [2024-11-09 01:10:05,881 INFO L349 Elim1Store]: treesize reduction 20, result has 91.7 percent of original size [2024-11-09 01:10:05,882 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 2250 treesize of output 2292 [2024-11-09 01:10:05,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:10:05,985 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 1215 treesize of output 1158 [2024-11-09 01:10:32,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 8 treesize of output 4 [2024-11-09 01:11:05,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 36 [2024-11-09 01:11:09,916 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 36 [2024-11-09 01:13:08,422 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 35 treesize of output 7 [2024-11-09 01:13:08,431 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 [2024-11-09 01:13:08,450 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 35 treesize of output 7 [2024-11-09 01:13:08,458 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 [2024-11-09 01:13:08,484 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 35 treesize of output 7 [2024-11-09 01:13:08,493 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 [2024-11-09 01:13:08,512 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 01:13:08,524 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 01:13:32,188 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 35 treesize of output 7 [2024-11-09 01:13:32,197 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 [2024-11-09 01:13:32,227 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 35 treesize of output 7 [2024-11-09 01:13:32,237 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 [2024-11-09 01:13:58,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 35 treesize of output 7 [2024-11-09 01:13:58,937 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 [2024-11-09 01:14:03,894 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 35 treesize of output 7 [2024-11-09 01:14:03,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 [2024-11-09 01:14:12,480 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 67 treesize of output 39 [2024-11-09 01:14:20,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 67 treesize of output 39 [2024-11-09 01:15:26,530 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 [2024-11-09 01:15:26,567 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 [2024-11-09 01:15:26,580 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 [2024-11-09 01:15:26,844 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 [2024-11-09 01:15:26,863 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 [2024-11-09 01:15:26,891 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 [2024-11-09 01:15:40,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 8 treesize of output 4 [2024-11-09 01:15:40,410 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 [2024-11-09 01:15:40,439 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 [2024-11-09 01:15:40,649 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 [2024-11-09 01:15:41,151 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 [2024-11-09 01:15:41,164 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 [2024-11-09 01:15:41,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 8 treesize of output 4 [2024-11-09 01:15:41,338 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 [2024-11-09 01:15:45,297 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 [2024-11-09 01:15:45,311 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 [2024-11-09 01:15:47,375 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 [2024-11-09 01:15:50,491 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 [2024-11-09 01:15:50,508 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 [2024-11-09 01:16:04,036 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 [2024-11-09 01:16:04,052 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 [2024-11-09 01:16:04,179 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 [2024-11-09 01:16:09,335 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 [2024-11-09 01:16:09,353 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 [2024-11-09 01:16:23,136 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 [2024-11-09 01:16:23,142 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 [2024-11-09 01:16:23,180 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 [2024-11-09 01:16:23,208 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 [2024-11-09 01:16:23,248 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 [2024-11-09 01:16:23,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 [2024-11-09 01:16:23,289 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 [2024-11-09 01:16:31,957 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 [2024-11-09 01:16:31,972 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 [2024-11-09 01:16:32,014 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 [2024-11-09 01:16:32,028 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 [2024-11-09 01:16:32,085 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 [2024-11-09 01:16:32,099 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 [2024-11-09 01:16:32,129 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 [2024-11-09 01:16:32,157 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 [2024-11-09 01:16:32,172 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 [2024-11-09 01:16:32,203 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 [2024-11-09 01:16:32,240 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 [2024-11-09 01:16:32,257 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 [2024-11-09 01:16:32,282 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 [2024-11-09 01:16:32,300 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 [2024-11-09 01:16:32,577 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 [2024-11-09 01:16:32,595 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 [2024-11-09 01:16:32,617 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 [2024-11-09 01:16:32,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 8 treesize of output 4 [2024-11-09 01:17:07,747 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 [2024-11-09 01:17:07,766 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 [2024-11-09 01:17:07,807 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 [2024-11-09 01:17:07,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 8 treesize of output 4 [2024-11-09 01:17:08,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 8 treesize of output 4 [2024-11-09 01:17:08,537 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 [2024-11-09 01:17:29,938 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 [2024-11-09 01:17:31,282 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 [2024-11-09 01:17:31,307 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 [2024-11-09 01:17:35,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 8 treesize of output 4 [2024-11-09 01:17:35,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 8 treesize of output 4 [2024-11-09 01:17:35,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 8 treesize of output 4 [2024-11-09 01:18:01,893 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 [2024-11-09 01:18:01,919 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 [2024-11-09 01:18:01,925 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 [2024-11-09 01:18:01,965 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 [2024-11-09 01:18:01,997 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 [2024-11-09 01:18:02,203 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 [2024-11-09 01:18:02,220 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 [2024-11-09 01:18:02,233 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 [2024-11-09 01:18:02,251 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 [2024-11-09 01:18:03,322 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 [2024-11-09 01:18:03,359 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 [2024-11-09 01:18:03,373 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 [2024-11-09 01:18:03,412 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 [2024-11-09 01:18:03,450 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 [2024-11-09 01:18:03,472 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 [2024-11-09 01:18:12,572 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 [2024-11-09 01:18:12,579 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 [2024-11-09 01:18:12,850 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 [2024-11-09 01:18:12,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 8 treesize of output 4 [2024-11-09 01:18:12,889 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 [2024-11-09 01:18:12,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 8 treesize of output 4 [2024-11-09 01:19:39,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 8 treesize of output 4 [2024-11-09 01:19:39,945 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 [2024-11-09 01:19:45,084 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 [2024-11-09 01:20:38,940 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-09 01:20:38,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-11-09 01:20:38,941 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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") [2024-11-09 01:20:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [189099018] [2024-11-09 01:20:38,943 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 01:20:38,944 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:20:38,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:20:38,944 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:20:38,944 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:20:38,955 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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 [2024-11-09 01:20:38,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:20:38,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-09 01:20:38,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871137112] [2024-11-09 01:20:38,959 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 01:20:38,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:20:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:20:38,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=925, Unknown=2, NotChecked=0, Total=1056 [2024-11-09 01:20:38,961 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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) [2024-11-09 01:20:38,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=925, Unknown=2, NotChecked=0, Total=1056 [2024-11-09 01:20:38,962 INFO L432 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 [2024-11-09 01:20:38,963 INFO L433 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] [2024-11-09 01:20:38,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:20:39,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:39,164 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_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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 [2024-11-09 01:20:39,167 INFO L158 Benchmark]: Toolchain (without parser) took 707821.61ms. Allocated memory was 136.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 96.8MB in the beginning and 862.0MB in the end (delta: -765.2MB). Peak memory consumption was 926.1MB. Max. memory is 16.1GB. [2024-11-09 01:20:39,167 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 136.3MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:20:39,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.63ms. Allocated memory is still 136.3MB. Free memory was 96.3MB in the beginning and 77.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:20:39,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.93ms. Allocated memory is still 136.3MB. Free memory was 77.0MB in the beginning and 74.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:20:39,168 INFO L158 Benchmark]: Boogie Preprocessor took 27.88ms. Allocated memory is still 136.3MB. Free memory was 74.9MB in the beginning and 73.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:20:39,168 INFO L158 Benchmark]: RCFGBuilder took 437.16ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 73.2MB in the beginning and 148.9MB in the end (delta: -75.6MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-11-09 01:20:39,168 INFO L158 Benchmark]: TraceAbstraction took 706758.95ms. Allocated memory was 180.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 148.2MB in the beginning and 862.0MB in the end (delta: -713.8MB). Peak memory consumption was 930.4MB. Max. memory is 16.1GB. [2024-11-09 01:20:39,170 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.34ms. Allocated memory is still 136.3MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.63ms. Allocated memory is still 136.3MB. Free memory was 96.3MB in the beginning and 77.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.93ms. Allocated memory is still 136.3MB. Free memory was 77.0MB in the beginning and 74.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.88ms. Allocated memory is still 136.3MB. Free memory was 74.9MB in the beginning and 73.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 437.16ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 73.2MB in the beginning and 148.9MB in the end (delta: -75.6MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 706758.95ms. Allocated memory was 180.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 148.2MB in the beginning and 862.0MB in the end (delta: -713.8MB). Peak memory consumption was 930.4MB. 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_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje --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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:20:41,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:20:41,646 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 01:20:41,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:20:41,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:20:41,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:20:41,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:20:41,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:20:41,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:20:41,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:20:41,705 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:20:41,706 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:20:41,706 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:20:41,707 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:20:41,707 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:20:41,708 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:20:41,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:20:41,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:20:41,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:20:41,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:20:41,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:20:41,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:20:41,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:20:41,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:20:41,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:20:41,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:20:41,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:20:41,718 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:20:41,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:20:41,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:20:41,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:20:41,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:20:41,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:20:41,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:20:41,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:20:41,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:20:41,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:20:41,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:20:41,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:20:41,724 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 01:20:41,725 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:20:41,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:20:41,726 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:20:41,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2024-11-09 01:20:42,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:20:42,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:20:42,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:20:42,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:20:42,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:20:42,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-properties/alternating_list-1.i Unable to find full path for "g++" [2024-11-09 01:20:44,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:20:44,747 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:20:44,748 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/sv-benchmarks/c/list-properties/alternating_list-1.i [2024-11-09 01:20:44,772 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/data/4e85a8415/a81558c5f0254622ac5fee8fe7206864/FLAG524188053 [2024-11-09 01:20:44,788 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/data/4e85a8415/a81558c5f0254622ac5fee8fe7206864 [2024-11-09 01:20:44,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:20:44,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:20:44,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:20:44,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:20:44,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:20:44,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:20:44" (1/1) ... [2024-11-09 01:20:44,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ebfb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:44, skipping insertion in model container [2024-11-09 01:20:44,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:20:44" (1/1) ... [2024-11-09 01:20:44,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:20:45,378 WARN L250 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_15231043-ad9f-4700-b452-c73c75a5ecae/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2024-11-09 01:20:45,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:20:45,400 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:20:45,472 WARN L250 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_15231043-ad9f-4700-b452-c73c75a5ecae/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2024-11-09 01:20:45,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:20:45,520 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:20:45,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45 WrapperNode [2024-11-09 01:20:45,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:20:45,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:20:45,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:20:45,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:20:45,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,589 INFO L138 Inliner]: procedures = 127, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2024-11-09 01:20:45,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:20:45,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:20:45,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:20:45,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:20:45,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:20:45,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:20:45,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:20:45,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:20:45,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (1/1) ... [2024-11-09 01:20:45,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:20:45,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:45,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:20:45,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:20:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 01:20:45,745 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 01:20:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 01:20:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:20:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:20:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:20:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:20:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:20:45,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 01:20:45,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 01:20:45,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:20:45,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:20:45,911 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:20:45,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:20:45,943 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 01:20:46,158 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 01:20:46,158 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:20:46,170 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:20:46,170 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 01:20:46,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:20:46 BoogieIcfgContainer [2024-11-09 01:20:46,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:20:46,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:20:46,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:20:46,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:20:46,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:20:44" (1/3) ... [2024-11-09 01:20:46,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644760d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:20:46, skipping insertion in model container [2024-11-09 01:20:46,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:45" (2/3) ... [2024-11-09 01:20:46,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644760d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:20:46, skipping insertion in model container [2024-11-09 01:20:46,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:20:46" (3/3) ... [2024-11-09 01:20:46,181 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2024-11-09 01:20:46,200 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:20:46,200 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:20:46,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:20:46,269 INFO L333 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, 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;@694b79aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:20:46,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:20:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 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) [2024-11-09 01:20:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:20:46,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:46,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:46,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:46,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash 12921097, now seen corresponding path program 1 times [2024-11-09 01:20:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:20:46,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954201232] [2024-11-09 01:20:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:46,308 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 [2024-11-09 01:20:46,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:20:46,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 01:20:46,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:46,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:20:46,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:46,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:20:46,519 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:20:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954201232] [2024-11-09 01:20:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954201232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:46,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:46,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:20:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85286335] [2024-11-09 01:20:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:46,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:20:46,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:20:46,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:20:46,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:20:46,567 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 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 5.5) internal successors, (11), 2 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) [2024-11-09 01:20:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:46,589 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2024-11-09 01:20:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:20:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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 11 [2024-11-09 01:20:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:46,600 INFO L225 Difference]: With dead ends: 46 [2024-11-09 01:20:46,600 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 01:20:46,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:20:46,611 INFO L432 NwaCegarLoop]: 37 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, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:46,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:20:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 01:20:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 01:20:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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) [2024-11-09 01:20:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-09 01:20:46,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-11-09 01:20:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:46,651 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 01:20:46,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2024-11-09 01:20:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-09 01:20:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 01:20:46,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:46,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:46,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 01:20:46,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:46,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash -863503123, now seen corresponding path program 1 times [2024-11-09 01:20:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:20:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627618245] [2024-11-09 01:20:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:46,861 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 [2024-11-09 01:20:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:20:46,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 01:20:46,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:46,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:20:46,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:20:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:47,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:20:47,238 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:20:47,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627618245] [2024-11-09 01:20:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627618245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:47,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:47,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:20:47,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913727407] [2024-11-09 01:20:47,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:47,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:20:47,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:20:47,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:20:47,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:20:47,246 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2024-11-09 01:20:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:47,457 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-11-09 01:20:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:20:47,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 [2024-11-09 01:20:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:47,460 INFO L225 Difference]: With dead ends: 44 [2024-11-09 01:20:47,460 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 01:20:47,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:20:47,462 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:47,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 52 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:20:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 01:20:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2024-11-09 01:20:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2024-11-09 01:20:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-09 01:20:47,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2024-11-09 01:20:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:47,469 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-09 01:20:47,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2024-11-09 01:20:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-09 01:20:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 01:20:47,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:47,470 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:47,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 01:20:47,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:47,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:47,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash -80617192, now seen corresponding path program 1 times [2024-11-09 01:20:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:20:47,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817104301] [2024-11-09 01:20:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:47,674 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 [2024-11-09 01:20:47,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:20:47,679 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 01:20:47,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:47,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:20:47,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:47,827 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 [2024-11-09 01:20:47,995 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:20:48,098 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:20:48,100 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 [2024-11-09 01:20:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 01:20:48,324 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 [2024-11-09 01:20:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:48,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:48,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_46 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_45 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_45 .cse0))) v_ArrVal_45)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_45) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2024-11-09 01:20:48,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:48,782 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 [2024-11-09 01:20:48,825 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 58 treesize of output 54 [2024-11-09 01:20:48,904 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 [2024-11-09 01:20:48,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 48 treesize of output 46 [2024-11-09 01:20:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:49,206 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:20:49,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817104301] [2024-11-09 01:20:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817104301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:20:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [845940465] [2024-11-09 01:20:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:49,209 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:20:49,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:20:49,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:20:49,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 01:20:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:49,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:20:49,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:49,385 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 [2024-11-09 01:20:49,592 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:20:49,667 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:20:49,668 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 [2024-11-09 01:20:49,786 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 23 treesize of output 11 [2024-11-09 01:20:49,803 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 [2024-11-09 01:20:49,810 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 16 treesize of output 8 [2024-11-09 01:20:49,901 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 [2024-11-09 01:20:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:49,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:49,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_75 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-09 01:20:50,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_75 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_72 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_72 .cse0))) v_ArrVal_72)) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_72) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-09 01:20:50,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_13| (_ BitVec 32))) (or (forall ((v_ArrVal_75 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_72 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_72) |v_ULTIMATE.start_main_~t~0#1.base_13| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_72 .cse0))) v_ArrVal_72)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_13|))))) is different from false [2024-11-09 01:20:50,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:50,112 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 [2024-11-09 01:20:50,122 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 [2024-11-09 01:20:50,208 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 [2024-11-09 01:20:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 01:20:50,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [845940465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:20:50,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560795717] [2024-11-09 01:20:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:50,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:50,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:50,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:20:50,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:20:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:50,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:20:50,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:50,552 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 [2024-11-09 01:20:50,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:20:50,684 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:20:50,685 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 [2024-11-09 01:20:50,731 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 01:20:50,770 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 [2024-11-09 01:20:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:50,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:50,886 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_46 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_103 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_103 .cse0))))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-09 01:20:51,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:51,124 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 132 treesize of output 134 [2024-11-09 01:20:51,152 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 24 treesize of output 20 [2024-11-09 01:20:51,206 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 63 treesize of output 59 [2024-11-09 01:20:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560795717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:20:51,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:20:51,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 24 [2024-11-09 01:20:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388150558] [2024-11-09 01:20:51,379 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:20:51,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 01:20:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:20:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 01:20:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=265, Unknown=19, NotChecked=190, Total=552 [2024-11-09 01:20:51,382 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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) [2024-11-09 01:20:52,816 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_9| (_ BitVec 32))) (or (forall ((v_ArrVal_46 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_45 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_45 .cse0))) v_ArrVal_45)) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_45) |v_ULTIMATE.start_main_~t~0#1.base_9| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_9|))))) (forall ((v_ArrVal_46 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-09 01:20:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:53,529 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2024-11-09 01:20:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 01:20:53,531 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 01:20:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:53,534 INFO L225 Difference]: With dead ends: 95 [2024-11-09 01:20:53,534 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 01:20:53,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=585, Unknown=21, NotChecked=342, Total=1122 [2024-11-09 01:20:53,538 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 172 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 44 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 501 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:53,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 166 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 168 Invalid, 23 Unknown, 501 Unchecked, 1.5s Time] [2024-11-09 01:20:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 01:20:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 38. [2024-11-09 01:20:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-09 01:20:53,555 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 18 [2024-11-09 01:20:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:53,555 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 01:20:53,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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) [2024-11-09 01:20:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-09 01:20:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 01:20:53,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:53,557 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:53,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 01:20:53,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:53,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-09 01:20:54,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 01:20:54,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:54,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash -80610248, now seen corresponding path program 1 times [2024-11-09 01:20:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:20:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880427613] [2024-11-09 01:20:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:54,160 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 [2024-11-09 01:20:54,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:20:54,162 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 01:20:54,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:54,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:20:54,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:20:54,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:20:54,250 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:20:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880427613] [2024-11-09 01:20:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880427613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:54,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:54,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:20:54,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742626772] [2024-11-09 01:20:54,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:54,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:20:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:20:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:20:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:20:54,256 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-09 01:20:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:54,294 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2024-11-09 01:20:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:20:54,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 01:20:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:54,297 INFO L225 Difference]: With dead ends: 89 [2024-11-09 01:20:54,299 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 01:20:54,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:20:54,300 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:54,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:20:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 01:20:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-11-09 01:20:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-11-09 01:20:54,320 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 18 [2024-11-09 01:20:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:54,321 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-11-09 01:20:54,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-09 01:20:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-11-09 01:20:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 01:20:54,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:54,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:54,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 01:20:54,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:54,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:54,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1026147731, now seen corresponding path program 1 times [2024-11-09 01:20:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:20:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903856248] [2024-11-09 01:20:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:54,525 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 [2024-11-09 01:20:54,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:20:54,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 01:20:54,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 (8)] Waiting until timeout for monitored process [2024-11-09 01:20:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:54,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:20:54,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:20:54,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:20:54,648 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:20:54,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903856248] [2024-11-09 01:20:54,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903856248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:54,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:54,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:20:54,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342368142] [2024-11-09 01:20:54,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:54,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:20:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:20:54,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:20:54,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:20:54,653 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) [2024-11-09 01:20:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:54,694 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2024-11-09 01:20:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:20:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Word has length 23 [2024-11-09 01:20:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:54,695 INFO L225 Difference]: With dead ends: 93 [2024-11-09 01:20:54,698 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 01:20:54,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:20:54,700 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:54,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:20:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 01:20:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-11-09 01:20:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-11-09 01:20:54,717 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 23 [2024-11-09 01:20:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:54,718 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-11-09 01:20:54,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) [2024-11-09 01:20:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-11-09 01:20:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 01:20:54,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:54,719 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:54,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 (8)] Ended with exit code 0 [2024-11-09 01:20:54,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 01:20:54,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1026140787, now seen corresponding path program 1 times [2024-11-09 01:20:54,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:20:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677845330] [2024-11-09 01:20:54,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:54,922 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 [2024-11-09 01:20:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:20:54,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 01:20:54,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 01:20:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:55,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:20:55,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:55,151 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:20:55,170 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:20:55,269 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-09 01:20:55,270 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 52 treesize of output 51 [2024-11-09 01:20:55,317 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 01:20:55,319 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 20 treesize of output 17 [2024-11-09 01:20:55,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-09 01:20:55,364 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 15 treesize of output 11 [2024-11-09 01:20:55,575 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 19 treesize of output 11 [2024-11-09 01:20:55,581 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 7 treesize of output 3 [2024-11-09 01:20:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:55,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:55,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:55,880 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 94 treesize of output 97 [2024-11-09 01:20:56,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:56,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 51 [2024-11-09 01:20:56,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:56,055 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 69 treesize of output 68 [2024-11-09 01:20:56,071 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 215 treesize of output 203 [2024-11-09 01:20:56,089 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 107 treesize of output 99 [2024-11-09 01:20:56,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:56,119 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 111 treesize of output 79 [2024-11-09 01:20:56,129 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 63 treesize of output 59 [2024-11-09 01:20:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:56,325 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:20:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677845330] [2024-11-09 01:20:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677845330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:20:56,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1802228146] [2024-11-09 01:20:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:56,327 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:20:56,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:20:56,331 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:20:56,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-09 01:20:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:56,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:20:56,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:56,526 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 [2024-11-09 01:20:56,715 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:20:56,716 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 [2024-11-09 01:20:56,831 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 [2024-11-09 01:20:56,845 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:20:57,003 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:20:57,004 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 60 treesize of output 53 [2024-11-09 01:20:57,010 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 11 [2024-11-09 01:20:57,020 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 [2024-11-09 01:20:57,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 27 treesize of output 15 [2024-11-09 01:20:57,191 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 [2024-11-09 01:20:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:57,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:57,283 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 79 treesize of output 57 [2024-11-09 01:20:57,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2024-11-09 01:20:57,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:57,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 [2024-11-09 01:20:57,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:57,358 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 [2024-11-09 01:20:57,383 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 [2024-11-09 01:20:57,395 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 01:20:57,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 1 [2024-11-09 01:20:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 01:20:59,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1802228146] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:20:59,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121014021] [2024-11-09 01:20:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:59,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:59,653 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:20:59,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 01:20:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:59,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:20:59,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:59,758 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 [2024-11-09 01:20:59,870 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:20:59,871 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 [2024-11-09 01:20:59,976 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 [2024-11-09 01:20:59,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:21:00,139 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:21:00,140 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 64 treesize of output 57 [2024-11-09 01:21:00,146 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 23 treesize of output 15 [2024-11-09 01:21:00,152 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 32 treesize of output 19 [2024-11-09 01:21:00,274 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 31 treesize of output 19 [2024-11-09 01:21:00,280 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 19 treesize of output 11 [2024-11-09 01:21:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:21:00,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:21:00,338 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 79 treesize of output 57 [2024-11-09 01:21:00,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_236) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2024-11-09 01:21:00,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:00,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 [2024-11-09 01:21:00,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:00,407 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 [2024-11-09 01:21:00,414 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 [2024-11-09 01:21:00,445 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 01:21:00,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 1 [2024-11-09 01:21:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 01:21:02,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121014021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:21:02,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:21:02,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9, 9, 9, 9] total 31 [2024-11-09 01:21:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150138395] [2024-11-09 01:21:02,587 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:21:02,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 01:21:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:21:02,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 01:21:02,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=694, Unknown=3, NotChecked=110, Total=930 [2024-11-09 01:21:02,592 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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) [2024-11-09 01:21:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:03,716 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2024-11-09 01:21:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:21:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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 23 [2024-11-09 01:21:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:03,717 INFO L225 Difference]: With dead ends: 81 [2024-11-09 01:21:03,717 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 01:21:03,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=252, Invalid=1159, Unknown=3, NotChecked=146, Total=1560 [2024-11-09 01:21:03,719 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 73 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:03,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 195 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 235 Invalid, 0 Unknown, 98 Unchecked, 0.6s Time] [2024-11-09 01:21:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 01:21:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2024-11-09 01:21:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-11-09 01:21:03,734 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 23 [2024-11-09 01:21:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:03,734 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-11-09 01:21:03,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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) [2024-11-09 01:21:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-11-09 01:21:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 01:21:03,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:03,735 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:03,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 01:21:03,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-09 01:21:04,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:21:04,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:21:04,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:04,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 604009604, now seen corresponding path program 1 times [2024-11-09 01:21:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:21:04,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575820865] [2024-11-09 01:21:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:04,337 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 [2024-11-09 01:21:04,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:21:04,339 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 01:21:04,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15231043-ad9f-4700-b452-c73c75a5ecae/bin/utaipan-verify-YMUCfTKeje/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 (12)] Waiting until timeout for monitored process [2024-11-09 01:21:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:04,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 01:21:04,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:04,476 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 [2024-11-09 01:21:04,608 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 01:21:04,608 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 [2024-11-09 01:21:04,750 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 [2024-11-09 01:21:04,873 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-09 01:21:04,911 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:21:04,911 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 [2024-11-09 01:21:04,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 5 treesize of output 3 [2024-11-09 01:21:04,965 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 01:21:04,965 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 [2024-11-09 01:21:05,068 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 01:21:05,069 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 [2024-11-09 01:21:05,296 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-09 01:21:05,297 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 [2024-11-09 01:21:05,305 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 [2024-11-09 01:21:05,323 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 [2024-11-09 01:21:05,579 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 01:21:05,579 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 192 treesize of output 153 [2024-11-09 01:21:05,627 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2024-11-09 01:21:05,627 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 148 treesize of output 142 [2024-11-09 01:21:05,653 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 55 treesize of output 40 [2024-11-09 01:21:06,043 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 01:21:06,043 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 91 treesize of output 46 [2024-11-09 01:21:06,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-09 01:21:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:21:06,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:21:08,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:08,991 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 55 treesize of output 59 [2024-11-09 01:21:09,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:09,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1170 treesize of output 1180 [2024-11-09 01:21:09,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:09,295 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 514 treesize of output 482 [2024-11-09 01:21:09,660 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 6 treesize of output 4 [2024-11-09 01:21:09,677 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 6 treesize of output 4 [2024-11-09 01:21:18,390 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 21 treesize of output 3 [2024-11-09 01:21:18,444 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 21 treesize of output 3 [2024-11-09 01:21:18,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:18,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 74 treesize of output 78 [2024-11-09 01:21:18,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:18,735 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 139 treesize of output 143 [2024-11-09 01:21:19,116 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 21 treesize of output 3 [2024-11-09 01:21:19,164 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 21 treesize of output 3 [2024-11-09 01:21:19,223 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 21 treesize of output 3 [2024-11-09 01:21:19,402 INFO L349 Elim1Store]: treesize reduction 160, result has 17.1 percent of original size [2024-11-09 01:21:19,403 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 154 treesize of output 130 [2024-11-09 01:21:19,471 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 21 treesize of output 3 [2024-11-09 01:21:19,501 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 21 treesize of output 3 [2024-11-09 01:21:19,514 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 21 treesize of output 3 [2024-11-09 01:21:19,552 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 21 treesize of output 3 [2024-11-09 01:21:19,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:19,649 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 139 treesize of output 143 [2024-11-09 01:21:20,104 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-09 01:21:20,104 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 82 treesize of output 1 [2024-11-09 01:21:20,148 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-09 01:21:20,149 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 82 treesize of output 1 [2024-11-09 01:21:20,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:20,197 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 106 treesize of output 110 [2024-11-09 01:21:22,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:22,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 778 treesize of output 728 [2024-11-09 01:21:22,947 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 42 treesize of output 24 [2024-11-09 01:21:23,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:23,221 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 52 treesize of output 56 [2024-11-09 01:21:23,284 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 42 treesize of output 24 [2024-11-09 01:21:23,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:23,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 516 treesize of output 482 [2024-11-09 01:21:23,732 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 44 treesize of output 42 [2024-11-09 01:21:23,792 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 21 treesize of output 3 [2024-11-09 01:21:23,821 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 358 treesize of output 322 [2024-11-09 01:21:23,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:23,867 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 40 treesize of output 44 [2024-11-09 01:21:24,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:24,014 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 254 treesize of output 256 [2024-11-09 01:21:24,031 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 212 treesize of output 210 [2024-11-09 01:21:24,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:24,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 423 treesize of output 391 [2024-11-09 01:21:24,684 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 734 treesize of output 662 [2024-11-09 01:21:24,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:24,733 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 61 treesize of output 65 [2024-11-09 01:21:24,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:24,947 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 778 treesize of output 728 [2024-11-09 01:21:24,973 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 42 treesize of output 24 [2024-11-09 01:21:25,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:25,186 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 85 treesize of output 89 [2024-11-09 01:21:25,204 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 70 treesize of output 68 [2024-11-09 01:21:25,468 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 10 treesize of output 8 [2024-11-09 01:21:25,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:25,545 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 304 treesize of output 306 [2024-11-09 01:21:25,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:25,583 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 304 treesize of output 308 [2024-11-09 01:21:26,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:26,898 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 402 treesize of output 388 [2024-11-09 01:21:26,924 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 42 treesize of output 24 [2024-11-09 01:21:27,163 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 734 treesize of output 662 [2024-11-09 01:21:27,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:27,213 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 40 treesize of output 44 [2024-11-09 01:21:27,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:27,373 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 799 treesize of output 731 [2024-11-09 01:21:27,399 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 42 treesize of output 24 [2024-11-09 01:21:27,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:27,521 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 115 treesize of output 117 [2024-11-09 01:21:27,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:27,769 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 115 treesize of output 117 [2024-11-09 01:21:28,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:28,067 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 2108 treesize of output 1968 [2024-11-09 01:21:28,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:28,297 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 2082 treesize of output 1942 [2024-11-09 01:21:28,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:28,503 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 402 treesize of output 388 [2024-11-09 01:21:28,664 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 358 treesize of output 322 [2024-11-09 01:21:28,686 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 10 treesize of output 8 [2024-11-09 01:21:28,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:28,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 477 treesize of output 445 [2024-11-09 01:21:28,755 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 97 treesize of output 95 [2024-11-09 01:21:29,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:29,199 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 778 treesize of output 728 [2024-11-09 01:21:29,213 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 21 treesize of output 3 [2024-11-09 01:21:29,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:29,526 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 941 treesize of output 873 [2024-11-09 01:21:29,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:29,592 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 227 treesize of output 231 [2024-11-09 01:21:30,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:30,934 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 212 treesize of output 212 [2024-11-09 01:21:31,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:31,411 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 2160 treesize of output 2018 [2024-11-09 01:21:31,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:31,796 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 2087 treesize of output 1947 [2024-11-09 01:21:31,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:31,952 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 444 treesize of output 412 [2024-11-09 01:21:32,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:32,145 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 418 treesize of output 386 [2024-11-09 01:21:32,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:32,318 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 376 treesize of output 362 [2024-11-09 01:21:32,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:32,459 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 402 treesize of output 388 [2024-11-09 01:21:32,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:32,645 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 376 treesize of output 362 [2024-11-09 01:21:32,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:32,792 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 402 treesize of output 388 [2024-11-09 01:21:32,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:32,944 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 402 treesize of output 388 [2024-11-09 01:21:33,105 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 358 treesize of output 322 [2024-11-09 01:21:33,132 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 10 treesize of output 8 [2024-11-09 01:21:33,166 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 358 treesize of output 322 [2024-11-09 01:21:33,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:33,209 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 61 treesize of output 65 [2024-11-09 01:21:33,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:33,339 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 402 treesize of output 388 [2024-11-09 01:21:33,354 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 42 treesize of output 24 [2024-11-09 01:21:33,485 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 44 treesize of output 42 [2024-11-09 01:21:33,499 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 42 treesize of output 24 [2024-11-09 01:21:33,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:33,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 64 treesize of output 68 [2024-11-09 01:21:33,553 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 70 treesize of output 68 [2024-11-09 01:21:33,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:33,778 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 254 treesize of output 256 [2024-11-09 01:21:33,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:33,828 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 255 treesize of output 259 [2024-11-09 01:21:35,301 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 10 treesize of output 8 [2024-11-09 01:21:35,348 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 44 treesize of output 42 [2024-11-09 01:21:35,394 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 42 treesize of output 24 [2024-11-09 01:21:35,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:35,422 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 423 treesize of output 391 [2024-11-09 01:21:35,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:35,525 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 402 treesize of output 388 [2024-11-09 01:21:35,540 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 21 treesize of output 3 [2024-11-09 01:21:35,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:35,674 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 85 treesize of output 89 [2024-11-09 01:21:35,687 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 70 treesize of output 68 [2024-11-09 01:21:36,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:36,152 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 2061 treesize of output 1921 [2024-11-09 01:21:36,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:36,279 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 2281 treesize of output 2135 [2024-11-09 01:21:36,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:36,422 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 617 treesize of output 579 [2024-11-09 01:21:36,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:36,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 617 treesize of output 579 [2024-11-09 01:21:36,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:36,610 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 2281 treesize of output 2135 [2024-11-09 01:21:36,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:36,704 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 260 treesize of output 258 [2024-11-09 01:21:36,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:36,802 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 2281 treesize of output 2135 [2024-11-09 01:21:36,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:36,935 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 423 treesize of output 391 [2024-11-09 01:21:37,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21: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 212 treesize of output 212 [2024-11-09 01:21:37,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:37,514 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 638 treesize of output 600 [2024-11-09 01:21:37,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:37,667 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 578 treesize of output 552 [2024-11-09 01:21:38,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:38,262 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 2302 treesize of output 2156 [2024-11-09 01:21:38,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:38,449 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 376 treesize of output 362 [2024-11-09 01:21:38,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:38,570 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 402 treesize of output 388 [2024-11-09 01:21:38,743 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 10 treesize of output 8 [2024-11-09 01:21:38,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:38,795 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 536 treesize of output 528 [2024-11-09 01:21:39,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:39,384 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 2260 treesize of output 2132 [2024-11-09 01:21:39,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:39,556 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 596 treesize of output 576 [2024-11-09 01:21:39,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:39,746 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 260 treesize of output 258 [2024-11-09 01:21:39,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:39,833 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 617 treesize of output 579 [2024-11-09 01:21:39,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21: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 2281 treesize of output 2135 [2024-11-09 01:21:40,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:40,080 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 2260 treesize of output 2132 [2024-11-09 01:21:40,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:40,246 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 596 treesize of output 576 [2024-11-09 01:21:40,442 INFO L349 Elim1Store]: treesize reduction 160, result has 17.1 percent of original size [2024-11-09 01:21:40,442 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 2517 treesize of output 2313 [2024-11-09 01:21:40,628 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 2043 treesize of output 1881 [2024-11-09 01:21:40,665 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 21 treesize of output 3 [2024-11-09 01:21:40,682 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 379 treesize of output 325 [2024-11-09 01:21:40,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:40,719 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 617 treesize of output 579 [2024-11-09 01:21:40,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:40,833 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 260 treesize of output 258 [2024-11-09 01:21:40,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:40,926 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 2281 treesize of output 2135 [2024-11-09 01:21:41,044 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 379 treesize of output 325 [2024-11-09 01:21:41,065 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 358 treesize of output 322 [2024-11-09 01:21:41,089 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 2022 treesize of output 1878 [2024-11-09 01:21:41,197 INFO L349 Elim1Store]: treesize reduction 160, result has 17.1 percent of original size [2024-11-09 01:21:41,198 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 2480 treesize of output 2276 [2024-11-09 01:21:41,375 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 2043 treesize of output 1881 [2024-11-09 01:21:41,412 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 21 treesize of output 3 [2024-11-09 01:21:41,424 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 2022 treesize of output 1878 [2024-11-09 01:21:41,460 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 358 treesize of output 322 [2024-11-09 01:21:41,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:41,528 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 2108 treesize of output 1968 [2024-11-09 01:21:41,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:41,724 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 444 treesize of output 412 [2024-11-09 01:21:41,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:41,919 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 346 treesize of output 328 [2024-11-09 01:21:42,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:42,588 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 326 treesize of output 322 [2024-11-09 01:21:42,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:42,899 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 122 treesize of output 124 [2024-11-09 01:21:43,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:43,159 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 596 treesize of output 576 [2024-11-09 01:21:43,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:43,304 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 418 treesize of output 386 [2024-11-09 01:21:43,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:43,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 397 treesize of output 365 [2024-11-09 01:21:43,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:43,519 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 115 treesize of output 117 [2024-11-09 01:21:43,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:21:43,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 2071 treesize of output 1909 [2024-11-09 01:21:43,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:21:43,699 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 238 treesize of output 230 [2024-11-09 01:21:43,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:43,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 94 treesize of output 96 [2024-11-09 01:21:43,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:43,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 2087 treesize of output 1947 [2024-11-09 01:21:44,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:44,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 465 treesize of output 415 [2024-11-09 01:21:44,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:44,170 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 2160 treesize of output 2018 [2024-11-09 01:21:44,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:44,452 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 376 treesize of output 362 [2024-11-09 01:21:44,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:44,582 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 402 treesize of output 388 [2024-11-09 01:21:44,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:44,708 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 418 treesize of output 386 [2024-11-09 01:21:44,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:44,842 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 444 treesize of output 412 [2024-11-09 01:21:44,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:45,000 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 638 treesize of output 600 [2024-11-09 01:21:45,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:45,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 2260 treesize of output 2132 [2024-11-09 01:21:45,323 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 238 treesize of output 230 [2024-11-09 01:21:45,354 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-09 01:21:45,354 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 596 treesize of output 1 [2024-11-09 01:21:45,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:45,388 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 560 treesize of output 506 [2024-11-09 01:21:45,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:45,623 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 115 treesize of output 117 [2024-11-09 01:21:45,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:45,918 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 444 treesize of output 412 [2024-11-09 01:21:46,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:46,125 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 423 treesize of output 391 [2024-11-09 01:21:46,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:46,244 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 376 treesize of output 362 [2024-11-09 01:21:46,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:46,364 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 402 treesize of output 388 [2024-11-09 01:21:46,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:46,497 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 2129 treesize of output 1971 [2024-11-09 01:21:46,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:46,618 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 2271 treesize of output 2111 [2024-11-09 01:21:47,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:47,116 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 87 treesize of output 91 [2024-11-09 01:21:47,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:47,208 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 617 treesize of output 579 [2024-11-09 01:21:47,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:47,335 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 402 treesize of output 388 [2024-11-09 01:21:47,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:47,479 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 638 treesize of output 600 [2024-11-09 01:21:47,596 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 10 treesize of output 8 [2024-11-09 01:21:47,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:47,657 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 115 treesize of output 117 [2024-11-09 01:21:47,862 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 44 treesize of output 42 [2024-11-09 01:21:47,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:47,914 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 478 treesize of output 444 [2024-11-09 01:21:48,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:48,145 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 2108 treesize of output 1968 [2024-11-09 01:21:48,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:48,321 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 617 treesize of output 579 [2024-11-09 01:21:48,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:48,412 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 376 treesize of output 362 [2024-11-09 01:21:48,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:48,539 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 2082 treesize of output 1942 [2024-11-09 01:21:48,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:48,685 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 2302 treesize of output 2156 [2024-11-09 01:21:49,405 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 [2024-11-09 01:21:49,446 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 [2024-11-09 01:21:49,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 8 treesize of output 4 [2024-11-09 01:21:49,557 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 [2024-11-09 01:21:49,882 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 [2024-11-09 01:21:49,912 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 [2024-11-09 01:21:50,035 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 [2024-11-09 01:21:50,356 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 [2024-11-09 01:21:50,370 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 [2024-11-09 01:21:50,505 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 [2024-11-09 01:21:50,617 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 [2024-11-09 01:21:51,040 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 [2024-11-09 01:21:51,054 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 [2024-11-09 01:21:51,184 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 [2024-11-09 01:21:51,289 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 [2024-11-09 01:21:51,352 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 [2024-11-09 01:21:51,416 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 [2024-11-09 01:21:51,451 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 [2024-11-09 01:21:51,508 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 [2024-11-09 01:21:51,566 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 [2024-11-09 01:21:51,999 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 [2024-11-09 01:21:52,114 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 [2024-11-09 01:21:52,285 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 [2024-11-09 01:21:52,376 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 [2024-11-09 01:21:52,413 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 [2024-11-09 01:21:52,860 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 [2024-11-09 01:21:53,053 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 [2024-11-09 01:21:53,123 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 [2024-11-09 01:21:53,145 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 [2024-11-09 01:21:53,163 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 [2024-11-09 01:21:53,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 [2024-11-09 01:21:53,348 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 [2024-11-09 01:21:53,365 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 [2024-11-09 01:21:53,519 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 [2024-11-09 01:21:53,550 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 [2024-11-09 01:21:53,850 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 [2024-11-09 01:21:53,946 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 [2024-11-09 01:21:54,062 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 [2024-11-09 01:21:54,076 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 [2024-11-09 01:21:54,273 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 [2024-11-09 01:21:54,297 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 [2024-11-09 01:21:54,963 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 [2024-11-09 01:21:55,009 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 [2024-11-09 01:21:55,152 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 [2024-11-09 01:21:56,593 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 57 treesize of output 41 [2024-11-09 01:21:56,608 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 [2024-11-09 01:21:56,867 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 38 treesize of output 26 [2024-11-09 01:21:56,877 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 [2024-11-09 01:21:57,477 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 46 treesize of output 30 [2024-11-09 01:21:57,487 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 [2024-11-09 01:21:57,491 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 [2024-11-09 01:21:58,216 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 37 treesize of output 25 [2024-11-09 01:22:00,125 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 46 treesize of output 30 [2024-11-09 01:22:02,679 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 37 treesize of output 25 [2024-11-09 01:22:07,434 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 41 treesize of output 29 [2024-11-09 01:22:10,357 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse59 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse5)) (.cse7 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (let ((.cse8 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse51 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse323 (select v_arrayElimArr_6 .cse5))) (let ((.cse324 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse323 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse323 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (= .cse323 .cse324) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse324 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse323))) (= .cse323 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse226 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse322 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse322))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse322 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse322 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse322 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse14 (not .cse59)) (.cse142 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse321 (select v_arrayElimArr_6 .cse5))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse321 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse321))) (= .cse321 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse321 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse180 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse319 (select v_arrayElimArr_6 .cse5))) (let ((.cse320 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse319 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse319 .cse320) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse319))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse319 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse320 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))) (let ((.cse25 (or .cse3 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse317 (select v_arrayElimArr_6 .cse5))) (let ((.cse316 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse317 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse318 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse317 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse316) (= .cse317 .cse318) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse317))) (= .cse316 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse318 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (.cse26 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse314 (select v_arrayElimArr_6 .cse5))) (let ((.cse315 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse314 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse314 .cse315) (= .cse314 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse314 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse314))) (not (= .cse315 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (.cse27 (or .cse3 .cse180)) (.cse0 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse313 (select v_arrayElimArr_6 .cse5))) (or (= .cse313 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse313 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse313))) (= .cse313 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse313 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse1 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse312 (select v_arrayElimArr_6 .cse5))) (or (= .cse312 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse312 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse312))) (= .cse312 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse312 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse12 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse311 (select v_arrayElimArr_6 .cse5))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse311 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse311))) (not (= .cse311 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse32 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse310 (select v_arrayElimArr_6 .cse5))) (let ((.cse309 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse310 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse309 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse310))) (not (= .cse310 .cse309))))))) (.cse50 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse307 (select v_arrayElimArr_6 .cse5))) (let ((.cse308 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse307 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse307 .cse308) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse308 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse307))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse307 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse307 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse15 (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse16 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse306 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse306 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse306))) (= .cse306 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse306 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse134 (or .cse14 .cse142)) (.cse17 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse305 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse304 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse305 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse304) (= .cse304 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse305))) (= .cse305 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse305 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse38 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse302 (select v_arrayElimArr_6 .cse5))) (let ((.cse303 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse302 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse302 .cse303) (= .cse303 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse302))) (= .cse302 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse2 (or .cse226 .cse3)) (.cse77 (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse300 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse301 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse300 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse300 .cse301) (= .cse301 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse300))) (not (= .cse300 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse113 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse299 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse298 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse299 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse298) (= .cse298 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse299))) (= .cse299 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse299 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse299 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (.cse114 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse297 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse297))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse297 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (= .cse297 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse297 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse297 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (.cse115 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse296 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse296 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse296))) (= .cse296 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse296 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse296 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (.cse110 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse294 (select v_arrayElimArr_6 .cse5))) (let ((.cse295 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse294 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse294 .cse295) (= .cse295 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse294))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse294 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (= .cse294 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse22 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse293 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse293 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse293 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse293))) (not (= .cse293 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse43 (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse291 (select v_arrayElimArr_6 .cse5))) (or (= .cse291 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse291))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse292 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse291 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse291 .cse292) (= .cse292 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (.cse11 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse290 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse290))) (= .cse290 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse290 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse290 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (.cse135 (or .cse226 .cse59)) (.cse118 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse288 (select v_arrayElimArr_6 .cse5))) (let ((.cse289 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse288 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse287 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse288 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse287) (= .cse287 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (= .cse288 .cse289) (= .cse289 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse288))) (= .cse288 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse111 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse285 (select v_arrayElimArr_6 .cse5))) (let ((.cse286 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse285 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse285 .cse286) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse285 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse286 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse285))) (= .cse285 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse164 (or .cse14 .cse51)) (.cse30 (or .cse3 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse284 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse284 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse284))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse284 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (.cse31 (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse283 (select v_arrayElimArr_6 .cse5))) (or (= .cse283 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse283 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse283))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse283 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse227 (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_1179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse282 (select v_arrayElimArr_6 .cse5))) (let ((.cse281 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse282 v_prenex_1179) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse281) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse282 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (= .cse282 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse282))) (= .cse281 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse282 .cse281) (= .cse282 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5)))))) (.cse181 (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse279 (select v_arrayElimArr_6 .cse5))) (or (= .cse279 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse279))) (= .cse279 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse280 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse279 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse279 .cse280) (= .cse280 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (.cse230 (or .cse3 (forall ((v_prenex_1179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse278 (select v_arrayElimArr_6 .cse5))) (let ((.cse277 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse278 v_prenex_1179) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse277) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse278 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse278))) (= .cse277 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse278 .cse277) (= .cse278 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (.cse18 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse276 (select v_arrayElimArr_6 .cse5))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse276 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse276))) (= .cse276 |c_ULTIMATE.start_main_~p~0#1.base|))))) (.cse9 (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse10 (not .cse8))) (and (or (and .cse0 .cse1 .cse2 (or .cse3 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select v_arrayElimArr_6 .cse5))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse6 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse6))) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse6 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)))))))) .cse8) (or .cse9 .cse10 .cse11) (or .cse9 .cse3 .cse12) (or .cse9 .cse10 (and (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse13))) (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse13 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse13 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) .cse14 .cse15) .cse16 .cse17)) (or .cse9 .cse10 .cse18) (or (and (or .cse14 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_6 .cse5))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse19 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse19 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse19))) (not (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse21 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse20) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse21 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse21))) (not (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse22) .cse9 .cse3) (or (and (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_6 .cse5))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse23 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse23 .cse24) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse23))) (not (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse23 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse15) .cse25 .cse26 .cse27) .cse8) (or (and .cse25 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_6 .cse5))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse28 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse28 .cse29) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse28 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse28))) (not (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse26 .cse27) .cse8) (or .cse8 (and .cse30 .cse31)) (or (and .cse0 .cse1 (or (and .cse16 .cse17) .cse3)) .cse8) (or .cse12 (and (or .cse9 .cse3) .cse8)) (or .cse9 .cse10 .cse32) (or (and (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_6 .cse5))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse33 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse33 .cse34) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse33))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse33 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))))) .cse3) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (select v_arrayElimArr_6 .cse5))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse35))) (forall ((v_prenex_1218 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse35 v_prenex_1218) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse35 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select v_arrayElimArr_6 .cse5))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse36 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse36 .cse37) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse36))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse36 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) .cse8) (or .cse9 .cse10 .cse38) (or .cse9 .cse10 (forall ((v_prenex_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_6 .cse5))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse39 v_prenex_1159) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse39 .cse40) (not (= (_ bv0 1) (select |c_#valid| .cse39))) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and (or .cse3 (forall ((v_prenex_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select v_arrayElimArr_6 .cse5))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse41 v_prenex_1189) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse41 .cse42) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse42) (not (= (_ bv0 1) (select |c_#valid| .cse41))) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse43 (forall ((v_prenex_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_6 .cse5))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse44 v_prenex_1189) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse44 .cse45) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse45) (not (= (_ bv0 1) (select |c_#valid| .cse44))) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse8) (or .cse8 (and (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_arrayElimArr_6 .cse5))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse46 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse46 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (= .cse46 .cse47) (= .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse46))) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select v_arrayElimArr_6 .cse5))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse48 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse48 .cse49) (= .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse48))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse48 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (or .cse3 .cse50) (or .cse3 .cse51))) (or .cse9 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select v_arrayElimArr_6 .cse5))) (or (= .cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse52 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse52))) (not (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse52 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse3) (or (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_6 .cse5))) (or (= .cse53 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1186 (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_6) .cse53 v_prenex_1186) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (not (= (_ bv0 1) (select |c_#valid| .cse53))) (= .cse53 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or (forall ((v_prenex_1187 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse54))) (= |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_6) .cse54 v_prenex_1187) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse3) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select v_arrayElimArr_6 .cse5))) (or (= .cse55 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse55))) (forall ((v_prenex_1188 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse55 v_prenex_1188) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse56 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse8) (or (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select v_arrayElimArr_6 .cse5))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse57 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse57 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse58 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse57))) (not (= .cse57 .cse58)))))) (or .cse3 .cse32)) .cse8) (or .cse9 .cse10 (and (or .cse14 .cse50) (or .cse59 .cse50))) (or .cse9 .cse10 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select v_arrayElimArr_6 .cse5))) (or (= .cse60 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse60 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse60))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse60 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.base|))))) (or (and (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select v_arrayElimArr_6 .cse5))) (or (= .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse61))) (forall ((v_prenex_1177 (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_6) .cse61 v_prenex_1177) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse61 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (select v_arrayElimArr_6 .cse5))) (or (= .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse62 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse63 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse63 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse62))) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse62 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_6 .cse5))) (or (= .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse64 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse65 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse65 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse64))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse64 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or .cse3 (forall ((v_prenex_1178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse66))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse66 v_prenex_1178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse66 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse66 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (forall ((v_prenex_1178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse67))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse67 v_prenex_1178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse67 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse67 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) .cse3) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select v_arrayElimArr_6 .cse5))) (or (= .cse68 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse68))) (forall ((v_prenex_1177 (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_6) .cse68 v_prenex_1177) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse68 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse68 |c_ULTIMATE.start_main_~p~0#1.base|))))))) .cse8) (or .cse9 .cse10 .cse50) (or .cse8 (let ((.cse75 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|))))) (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse69))) (not (= .cse69 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse69 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse69 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_prenex_1203 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse70 v_prenex_1203) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) (_ bv0 32)))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse70 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse70))) (not (= .cse70 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse71 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse71))) (not (= .cse71 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse71 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse72))) (not (= .cse72 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse72 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse72 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse72 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5)))))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse73))) (not (= .cse73 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_1204 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse73 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse73 v_prenex_1204) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (select v_arrayElimArr_6 .cse5))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse74 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse74))) (not (= .cse74 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_1203 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse74 v_prenex_1203) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5)))))))) (or .cse75 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse76 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse76))))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)) .cse75) .cse77 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse78 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse78))) (not (= .cse78 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse78 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse78 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse80 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse79 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse79 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse80 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (not (= (_ bv0 1) (select |c_#valid| .cse80))) (not (= .cse80 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_prenex_1203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse81 .cse82 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (select (select (store .cse81 .cse82 v_prenex_1203) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) (_ bv0 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse82))) (not (= .cse82 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse82 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse83))) (not (= .cse83 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse83 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= .cse83 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse83 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))) (or (and (or .cse3 (forall ((v_prenex_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (select v_arrayElimArr_6 .cse5))) (let ((.cse84 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse85 v_prenex_1169) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse84 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse85))) (= .cse85 .cse84) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse85 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse85 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse87 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse86) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse86 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_prenex_1168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse87 v_prenex_1168) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse87 .cse88) (= .cse88 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse87 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse87))) (= .cse87 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or (forall ((v_prenex_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (select v_arrayElimArr_6 .cse5))) (let ((.cse90 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse89 v_prenex_1168) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse89 .cse90) (= .cse89 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse90 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse89))) (= .cse89 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse89 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse3) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select v_arrayElimArr_6 .cse5))) (or (= .cse91 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse91 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse91))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse91 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse91 .cse92) (= .cse92 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse92 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse91 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_prenex_1168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse93 v_prenex_1168) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse93 .cse94) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse93 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse93 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse93))) (= .cse93 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or .cse3 (forall ((v_prenex_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select v_arrayElimArr_6 .cse5))) (let ((.cse95 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse96 v_prenex_1169) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse95 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse96))) (= .cse96 .cse95) (not (= .cse96 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse96 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) (or .cse3 (forall ((v_prenex_1169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (select v_arrayElimArr_6 .cse5))) (let ((.cse97 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse99 v_prenex_1169) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse98 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse99 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse97 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse98) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse99))) (= .cse99 .cse97) (= .cse98 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse99 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select v_arrayElimArr_6 .cse5))) (or (= .cse100 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse100))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse100 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse100 .cse101) (= .cse101 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse101 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse100 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse100 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_prenex_1168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse102 v_prenex_1168) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse102 .cse103) (= .cse103 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse102 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse102))) (= .cse102 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse102 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))) .cse8) (or .cse9 .cse3 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse104 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse104))) (not (= .cse104 |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse104 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (or .cse9 .cse10 (forall ((v_prenex_1180 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select v_arrayElimArr_6 .cse5))) (let ((.cse105 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse106 v_prenex_1180) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse105 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse106))) (= .cse106 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse106 .cse105)))))) (or .cse9 .cse10 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse107 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse107))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse107 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse107 |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse9 .cse10 (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (select v_arrayElimArr_6 .cse5))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse108 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse108))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse108 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (= .cse108 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse109 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse109 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse109))) (= .cse109 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or .cse9 .cse10 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_428 (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= v_arrayElimCell_428 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_arrayElimCell_428 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_428)))))) (or .cse9 .cse10 (and .cse110 .cse111)) (or (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select v_arrayElimArr_6 .cse5))) (or (= .cse112 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse112 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse112))) (= .cse112 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse112 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse112 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (or (and .cse113 .cse114) .cse3) (or .cse3 (and .cse114 .cse115)) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (select v_arrayElimArr_6 .cse5))) (or (= .cse116 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse116))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse116 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (= .cse116 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse116 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse116 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse8) (or .cse9 .cse10 (let ((.cse117 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (select v_arrayElimArr_6 .cse5))) (let ((.cse120 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse119 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse119 .cse120) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse120 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse119))) (= .cse119 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse119 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))) (and (or .cse14 .cse117 .cse15) .cse118 .cse111 (or .cse117 .cse3 .cse15)))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (select v_arrayElimArr_6 .cse5))) (let ((.cse121 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse122 v_prenex_1192) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse121) (= .cse122 .cse121) (not (= (_ bv0 1) (select |c_#valid| .cse122))) (= .cse122 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse123 (select v_arrayElimArr_6 .cse5))) (let ((.cse124 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse123 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse123 .cse124) (= .cse123 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse123 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse124 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse123))))))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse126 (select v_arrayElimArr_6 .cse5))) (let ((.cse127 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse126 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse125 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse126 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse125) (= .cse126 .cse127) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse127 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse126))) (= .cse125 |c_ULTIMATE.start_main_~p~0#1.offset|))))) .cse3) (or .cse3 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (select v_arrayElimArr_6 .cse5))) (let ((.cse129 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse128 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse128 .cse129) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse129 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse128))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse128 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse130 (select v_arrayElimArr_6 .cse5))) (let ((.cse131 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse130 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse130 .cse131) (= .cse130 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse131 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse130 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse130)))))))) .cse8) (or .cse9 .cse10 .cse3 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (and (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (select v_arrayElimArr_6 .cse5))) (let ((.cse133 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse132 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse132 .cse133) (= .cse133 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse133 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse132))))))) .cse3) .cse43) .cse8) (or .cse9 (and .cse134 .cse16 .cse17) .cse10) (or .cse9 .cse10 (and .cse135 .cse134 .cse17)) (or (and (or .cse3 .cse38) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse136 (select v_arrayElimArr_6 .cse5))) (let ((.cse137 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse136 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse136 .cse137) (= .cse136 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse137 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse136))) (= .cse136 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse8) (or .cse9 .cse3 (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse138 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse138 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse138))) (not (= .cse138 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse138 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse139 (select v_arrayElimArr_6 .cse5))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse139 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse139))) (not (= .cse139 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse139 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= .cse139 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (or (and .cse2 (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse140 (select v_arrayElimArr_6 .cse5))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse140 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (= .cse140 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse140))) (= .cse140 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse140 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (select v_arrayElimArr_6 .cse5))) (or (= .cse141 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse141))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse141 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse141 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse141 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (or .cse3 .cse142)) .cse8) (or (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse144 (select v_arrayElimArr_6 .cse5))) (let ((.cse143 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse144 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse143 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse143 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse144))) (not (= .cse144 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse144 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse146 (select v_arrayElimArr_6 .cse5))) (let ((.cse145 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse146 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse145 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse146 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse145 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse146))) (not (= .cse146 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_prenex_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse147 (select v_arrayElimArr_6 .cse5))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse147 v_prenex_1198) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_prenex_1199 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse147 v_prenex_1199) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= (_ bv0 1) (select |c_#valid| .cse147))) (not (= .cse147 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_prenex_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse148 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_prenex_1199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse148 v_prenex_1199) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse148 v_prenex_1198) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse148))) (not (= .cse148 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse77 (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse149 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse149))) (not (= .cse149 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_1200 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse149 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse149 v_prenex_1200) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse150 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse150 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse150))) (not (= .cse150 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse150 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse150 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse8) (or .cse9 .cse10 (and .cse113 .cse114 (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse151 (select v_arrayElimArr_6 .cse5))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse151 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse151))) (= .cse151 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse151 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse151 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) .cse14) .cse115)) (or (and (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse152 (select v_arrayElimArr_6 .cse5))) (or (= .cse152 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse152 v_prenex_1216) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse153) (= .cse153 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse152 .cse153)))) (not (= (_ bv0 1) (select |c_#valid| .cse152))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse152 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (select v_arrayElimArr_6 .cse5))) (or (= .cse154 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse154))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse155 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse154 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse154 .cse155) (= .cse155 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse154 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (select v_arrayElimArr_6 .cse5))) (or (= .cse156 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse157 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse156 v_prenex_1216) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse157) (= .cse157 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse156 .cse157)))) (not (= (_ bv0 1) (select |c_#valid| .cse156))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse156 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) (or (forall ((v_prenex_1217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse159 (select v_arrayElimArr_6 .cse5))) (let ((.cse158 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse159 v_prenex_1217) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse158 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse159))) (not (= .cse159 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse159 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (= .cse159 .cse158))))) .cse3) (or .cse3 (forall ((v_prenex_1217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (select v_arrayElimArr_6 .cse5))) (let ((.cse160 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse161 v_prenex_1217) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse160 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse161))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse161 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse161 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse161 .cse160)))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (select v_arrayElimArr_6 .cse5))) (or (= .cse162 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse162))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse162 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse163 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse162 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse162 .cse163) (= .cse163 |c_ULTIMATE.start_main_~p~0#1.base|)))))))))) .cse8) (or (and .cse113 .cse114 .cse115) .cse9 .cse10) (or .cse9 .cse10 (and .cse110 .cse118 .cse111 .cse164)) (or (and (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse165 (select v_arrayElimArr_6 .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse165 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (forall ((v_prenex_1162 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse166 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse165 v_prenex_1162) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse166) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse166) (= .cse165 .cse166)))) (= .cse165 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse165))) (= .cse165 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or .cse3 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse167 (select v_arrayElimArr_6 .cse5))) (let ((.cse168 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse167 v_prenex_1161) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse167 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse167))) (= .cse168 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse167 .cse168) (not (= .cse167 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse169 (select v_arrayElimArr_6 .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse169 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (= .cse169 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse169))) (forall ((v_prenex_1160 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse170 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse169 v_prenex_1160) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse169 .cse170) (= .cse170 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse169 |c_ULTIMATE.start_main_~p~0#1.base|))))))) .cse8) (or (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse171 (select v_arrayElimArr_6 .cse5))) (let ((.cse172 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse171 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse171 .cse172) (= .cse171 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse172 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse171))))))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (select v_arrayElimArr_6 .cse5))) (let ((.cse174 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse173 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse173 .cse174) (= .cse174 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse173))))))) .cse3)) .cse8) (or (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse176 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse175 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse176 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse175) (= .cse175 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse176))) (not (= .cse176 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse176 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse176 |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse177 (select v_arrayElimArr_6 .cse5))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse177 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse177))) (not (= .cse177 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse177 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse177 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse14) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse178 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse178 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse178))) (not (= .cse178 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse178 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse178 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse179))) (not (= .cse179 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse179 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse179 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse179 |c_ULTIMATE.start_main_~a~0#1.base|)))))) .cse9 .cse3) (or .cse9 .cse10 (and (or .cse59 .cse180) (or .cse14 .cse180))) (or (and .cse181 (or .cse3 (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1209 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse183 (select v_arrayElimArr_6 .cse5))) (let ((.cse182 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse183 v_prenex_1209) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse182) (not (= (_ bv0 1) (select |c_#valid| .cse183))) (= .cse183 .cse182) (not (= .cse183 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse185 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_prenex_1208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse184 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse185 v_prenex_1208) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse184) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse184) (= .cse185 .cse184)))) (= .cse185 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse185))) (= .cse185 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse8) (or .cse9 .cse3 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse186 (select v_arrayElimArr_6 .cse5))) (or (= .cse186 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse186 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 1) (select |c_#valid| .cse186))) (not (= .cse186 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse186 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or .cse9 .cse3 (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse188 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse187 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse188 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse187) (= .cse187 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse188))) (not (= .cse188 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse188 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= .cse188 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse188 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (or .cse14 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse189 (select v_arrayElimArr_6 .cse5))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse189 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse189))) (not (= .cse189 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse189 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= .cse189 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse189 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse190 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse190))) (not (= .cse190 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse190 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= .cse190 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= .cse190 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse190 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse191 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse191 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse191))) (not (= .cse191 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse191 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= .cse191 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse191 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) (or .cse9 .cse3 (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse192 (select v_arrayElimArr_6 .cse5))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse192 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse192))) (not (= .cse192 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse192 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))) .cse22)) (or (let ((.cse193 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse194 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse194))) (not (= .cse194 |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse194 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse194 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= .cse194 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse194 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) (and (or .cse193 .cse14) (or .cse193 .cse59))) .cse9 .cse3) (or .cse8 (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse195 (select v_arrayElimArr_6 .cse5))) (let ((.cse196 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse195 v_prenex_1193) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse195 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse195 .cse196) (not (= (_ bv0 1) (select |c_#valid| .cse195))) (= .cse196 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse196 |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse3 (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse197 (select v_arrayElimArr_6 .cse5))) (let ((.cse198 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse197 v_prenex_1193) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse197 .cse198) (not (= (_ bv0 1) (select |c_#valid| .cse197))) (= .cse198 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse198 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse43)) (or (and (or (and (forall ((v_prenex_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse199 (select v_arrayElimArr_6 .cse5))) (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_6) .cse199 v_prenex_1213) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse199 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse199))) (not (= .cse199 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_prenex_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse200 (select v_arrayElimArr_6 .cse5))) (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_6) .cse200 v_prenex_1213) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 1) (select |c_#valid| .cse200))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse200 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= .cse200 |c_ULTIMATE.start_main_~a~0#1.base|)))))) .cse3) (forall ((v_prenex_1212 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse201 (select v_arrayElimArr_6 .cse5))) (or (= .cse201 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse201 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse201))) (= |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_6) .cse201 v_prenex_1212) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse202 (select v_arrayElimArr_6 .cse5))) (let ((.cse203 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse202 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse202 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse203 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse202 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse203 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse202))))))) (forall ((v_prenex_1212 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse204 (select v_arrayElimArr_6 .cse5))) (or (= .cse204 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse204))) (= |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_6) .cse204 v_prenex_1212) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse204 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse205 (select v_arrayElimArr_6 .cse5))) (let ((.cse206 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse205 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse205 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse206 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse206 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse205))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse205 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))))) .cse8) (or (and .cse181 (or .cse3 (forall ((v_prenex_1158 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse207 (select v_arrayElimArr_6 .cse5))) (let ((.cse208 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse207 v_prenex_1158) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse207 .cse208) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse208) (not (= (_ bv0 1) (select |c_#valid| .cse207))) (= .cse207 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse208)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse209 (select v_arrayElimArr_6 .cse5))) (or (= .cse209 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse209))) (= .cse209 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse210 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse209 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse209 .cse210) (= .cse210 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse209 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5)))))))) (forall ((v_prenex_1158 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse211 (select v_arrayElimArr_6 .cse5))) (let ((.cse212 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse211 v_prenex_1158) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse211 .cse212) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse212) (= .cse211 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse211))) (= .cse211 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse212)))))) .cse8) (or (and (or .cse3 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_429 (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_arrayElimCell_429 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_429)))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_429 (_ BitVec 32))) (or (= v_arrayElimCell_429 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_arrayElimCell_429 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_429)))))))) .cse8) (or (and (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_prenex_1166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse214 (select v_arrayElimArr_6 .cse5))) (let ((.cse213 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse214 v_prenex_1166) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse213) (= .cse214 .cse213) (= .cse214 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse214))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse214 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse214 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (or .cse3 (forall ((v_prenex_1166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse216 (select v_arrayElimArr_6 .cse5))) (let ((.cse215 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse216 v_prenex_1166) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse215) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse216 .cse215) (not (= (_ bv0 1) (select |c_#valid| .cse216))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse216 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse216 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse218 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse217 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse218 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse217) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse217 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse218 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse218))) (= .cse218 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse218 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse218 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse219 (select v_arrayElimArr_6 .cse5))) (or (= .cse219 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse219 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse219))) (= .cse219 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse219 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse219 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse8) (or .cse8 (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse220 (select v_arrayElimArr_6 .cse5))) (or (= .cse220 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse220 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse220))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse220 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse3 (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse221 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse221 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse221))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse221 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse223 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse222 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse223 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse222) (= .cse222 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse223))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse223 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse224 (select v_arrayElimArr_6 .cse5))) (or (= .cse224 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse224 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse224))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse224 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (or .cse9 (forall ((v_arrayElimCell_426 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_426))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_arrayElimCell_426 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (= v_arrayElimCell_426 |c_ULTIMATE.start_main_~p~0#1.base|))) .cse10) (or (and (or .cse3 .cse11) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse225 (select v_arrayElimArr_6 .cse5))) (or (= .cse225 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse225))) (= .cse225 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse225 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse225 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse8) (or (and .cse135 (or .cse226 .cse14)) .cse9 .cse10) (or (and .cse227 (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse228 (select v_arrayElimArr_6 .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse228 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (= .cse228 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse228))) (= .cse228 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse229 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse228 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse228 .cse229) (= .cse229 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) .cse230) .cse8) (or .cse9 .cse10 (forall ((v_prenex_1210 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse231 (select v_arrayElimArr_6 .cse5))) (let ((.cse232 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse231 v_prenex_1210) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse231 .cse232) (not (= (_ bv0 1) (select |c_#valid| .cse231))) (= .cse231 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse232)))))) (or .cse9 .cse10 (and .cse118 .cse111 .cse164)) (or .cse9 .cse3 (let ((.cse235 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse236 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse236))) (not (= .cse236 |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse236 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse236 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse236 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (and (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse234 (select v_arrayElimArr_6 .cse5))) (let ((.cse233 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse234 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse233) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse234))) (not (= .cse234 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse233 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse234 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse234 |c_ULTIMATE.start_main_~a~0#1.base|)))))) .cse59) (or .cse14 .cse235) (or .cse59 .cse235)))) (or (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse238 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_prenex_1162 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse237 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse238 v_prenex_1162) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse237) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse237) (= .cse238 .cse237)))) (= .cse238 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse238))) (= .cse238 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse239 (select v_arrayElimArr_6 .cse5))) (or (= .cse239 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse239))) (forall ((v_prenex_1160 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse240 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse239 v_prenex_1160) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse239 .cse240) (= .cse240 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse239 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse241 (select v_arrayElimArr_6 .cse5))) (let ((.cse242 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse241 v_prenex_1161) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (_ bv0 1) (select |c_#valid| .cse241))) (= .cse242 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse241 .cse242) (not (= .cse241 |c_ULTIMATE.start_main_~a~0#1.base|)))))) .cse3)) .cse8) (or (and (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse243 (select v_arrayElimArr_6 .cse5))) (or (= .cse243 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse243 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse243))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse243 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse244 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse244 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse244))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse244 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) .cse3) .cse30 .cse31) .cse8) (or .cse8 (and (or .cse3 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse245 (select v_arrayElimArr_6 .cse5))) (let ((.cse246 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse245 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse245 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (= .cse245 .cse246) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (= .cse246 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse245)))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse247 (select v_arrayElimArr_6 .cse5))) (let ((.cse248 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse247 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse247 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (= .cse247 .cse248) (= .cse247 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse248 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse247))))))))))) (or (and .cse227 .cse181 (forall ((v_prenex_1179 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse250 (select v_arrayElimArr_6 .cse5))) (let ((.cse249 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse250 v_prenex_1179) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse249) (= .cse250 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse250))) (= .cse249 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse250 .cse249) (= .cse250 |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse3 (forall ((v_prenex_1179 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse252 (select v_arrayElimArr_6 .cse5))) (let ((.cse251 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse252 v_prenex_1179) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse251) (not (= (_ bv0 1) (select |c_#valid| .cse252))) (= .cse251 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse252 .cse251) (= .cse252 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse230) .cse8) (or .cse8 (and (or .cse3 .cse18) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse253 (select v_arrayElimArr_6 .cse5))) (or (= .cse253 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse253 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse253))) (= .cse253 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and (or .cse3 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse254 (select v_arrayElimArr_6 .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse254 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse254))) (= .cse254 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse254 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse254 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse255 (select v_arrayElimArr_6 .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse255 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (= .cse255 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse255))) (= .cse255 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse255 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse255 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))) .cse8) (or .cse9 .cse10 (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse256 (select v_arrayElimArr_6 .cse5))) (let ((.cse257 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse256 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse256 .cse257) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse256 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse256))) (not (= .cse257 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse259 (select v_arrayElimArr_6 .cse5))) (let ((.cse260 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse259 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse258 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse259 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse258) (= .cse258 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (= .cse259 .cse260) (not (= (_ bv0 1) (select |c_#valid| .cse259))) (not (= .cse260 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or .cse14 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse261 (select v_arrayElimArr_6 .cse5))) (let ((.cse262 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse261 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse261 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)) (= .cse261 .cse262) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (not (= (_ bv0 1) (select |c_#valid| .cse261))) (not (= .cse262 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) (or .cse9 .cse10 (forall ((v_prenex_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse264 (select v_arrayElimArr_6 .cse5))) (let ((.cse263 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse264 v_prenex_1196) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse263) (not (= (_ bv0 1) (select |c_#valid| .cse264))) (= .cse264 .cse263) (= .cse264 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse265 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_prenex_1174 (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_6) .cse265 v_prenex_1174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (= .cse265 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse265))) (= .cse265 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse266 (select v_arrayElimArr_6 .cse5))) (or (= .cse266 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse266))) (forall ((v_prenex_1176 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse267 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse266 v_prenex_1176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse267 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse267 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse266 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or (forall ((v_prenex_1175 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse268 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse268))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse268 v_prenex_1175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse268 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse3)) .cse8) (or (and (or (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse270 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse269 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse270 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse269) (= .cse269 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse270))) (not (= .cse270 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse270 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse271 (select v_arrayElimArr_6 .cse5))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse271 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse271))) (not (= .cse271 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse271 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse272 (select v_arrayElimArr_6 .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse272))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse272 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= .cse272 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse272 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse3) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse273 (select v_arrayElimArr_6 .cse5))) (or (= .cse273 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse273 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| .cse273))) (not (= .cse273 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse273 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse274 (select v_arrayElimArr_6 .cse5))) (or (= .cse274 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse274))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse274 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (not (= .cse274 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse274 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse275 (select v_arrayElimArr_6 .cse5))) (or (= .cse275 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_7 .cse5))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) .cse275 v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse275))) (not (= .cse275 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse275 v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse8)))))) is different from true