./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/simple-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/simple-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:00:32,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:00:32,707 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 20:00:32,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:00:32,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:00:32,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:00:32,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:00:32,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:00:32,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:00:32,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:00:32,743 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 20:00:32,743 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 20:00:32,744 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 20:00:32,745 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 20:00:32,745 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 20:00:32,746 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 20:00:32,746 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 20:00:32,747 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 20:00:32,747 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 20:00:32,748 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 20:00:32,748 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 20:00:32,749 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 20:00:32,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:00:32,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:00:32,751 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:00:32,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:00:32,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:00:32,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:00:32,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:00:32,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:00:32,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:00:32,754 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:00:32,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:00:32,755 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:00:32,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:00:32,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:00:32,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:00:32,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:00:32,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:00:32,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:00:32,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:00:32,758 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 20:00:32,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:00:32,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:00:32,759 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:00:32,759 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 20:00:32,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 20:00:32,759 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_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2023-12-02 20:00:32,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:00:33,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:00:33,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:00:33,025 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:00:33,025 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:00:33,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-properties/simple-2.i [2023-12-02 20:00:35,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:00:36,048 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:00:36,048 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/sv-benchmarks/c/list-properties/simple-2.i [2023-12-02 20:00:36,059 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/data/70d15ba05/13416e56da954ec29ff8307b641ef4ae/FLAG04418dc85 [2023-12-02 20:00:36,071 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/data/70d15ba05/13416e56da954ec29ff8307b641ef4ae [2023-12-02 20:00:36,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:00:36,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:00:36,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:00:36,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:00:36,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:00:36,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abd4b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36, skipping insertion in model container [2023-12-02 20:00:36,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,129 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:00:36,403 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2023-12-02 20:00:36,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:00:36,419 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:00:36,456 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2023-12-02 20:00:36,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:00:36,488 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:00:36,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36 WrapperNode [2023-12-02 20:00:36,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:00:36,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:00:36,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:00:36,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:00:36,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,530 INFO L138 Inliner]: procedures = 124, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-12-02 20:00:36,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:00:36,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:00:36,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:00:36,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:00:36,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:00:36,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:00:36,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:00:36,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:00:36,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (1/1) ... [2023-12-02 20:00:36,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:00:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:00:36,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:00:36,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:00:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-02 20:00:36,626 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-02 20:00:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:00:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:00:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 20:00:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:00:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 20:00:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 20:00:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:00:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:00:36,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:00:36,727 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:00:36,729 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:00:36,749 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-02 20:00:36,837 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:00:36,864 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:00:36,865 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:00:36,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:00:36 BoogieIcfgContainer [2023-12-02 20:00:36,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:00:36,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:00:36,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:00:36,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:00:36,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:00:36" (1/3) ... [2023-12-02 20:00:36,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d8708d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:00:36, skipping insertion in model container [2023-12-02 20:00:36,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:00:36" (2/3) ... [2023-12-02 20:00:36,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d8708d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:00:36, skipping insertion in model container [2023-12-02 20:00:36,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:00:36" (3/3) ... [2023-12-02 20:00:36,876 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-12-02 20:00:36,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:00:36,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 20:00:36,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 20:00:36,940 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f8f0cfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:00:36,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:00:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 20:00:36,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:00:36,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:00:36,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:00:36,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:00:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1597896168, now seen corresponding path program 1 times [2023-12-02 20:00:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:00:36,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429635331] [2023-12-02 20:00:36,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:00:36,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:00:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:00:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:00:37,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:00:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429635331] [2023-12-02 20:00:37,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429635331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:00:37,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:00:37,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:00:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122934243] [2023-12-02 20:00:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:00:37,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:00:37,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:00:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:00:37,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:00:37,173 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:00:37,195 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2023-12-02 20:00:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:00:37,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 20:00:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:00:37,204 INFO L225 Difference]: With dead ends: 25 [2023-12-02 20:00:37,205 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 20:00:37,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:00:37,210 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 20:00:37,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 20:00:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 20:00:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-02 20:00:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-02 20:00:37,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-12-02 20:00:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:00:37,247 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-02 20:00:37,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-02 20:00:37,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 20:00:37,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:00:37,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:00:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:00:37,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:00:37,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:00:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1847503380, now seen corresponding path program 1 times [2023-12-02 20:00:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:00:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059887026] [2023-12-02 20:00:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:00:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:00:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:00:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:00:37,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:00:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059887026] [2023-12-02 20:00:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059887026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:00:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:00:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:00:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171860986] [2023-12-02 20:00:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:00:37,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:00:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:00:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:00:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:00:37,514 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:00:37,593 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-12-02 20:00:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:00:37,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 20:00:37,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:00:37,594 INFO L225 Difference]: With dead ends: 28 [2023-12-02 20:00:37,594 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 20:00:37,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:00:37,596 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 20:00:37,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 20:00:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 20:00:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2023-12-02 20:00:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-02 20:00:37,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2023-12-02 20:00:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:00:37,603 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-02 20:00:37,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-02 20:00:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 20:00:37,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:00:37,604 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:00:37,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:00:37,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:00:37,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:00:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1027892324, now seen corresponding path program 1 times [2023-12-02 20:00:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:00:37,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625415724] [2023-12-02 20:00:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:00:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:00:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:00:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:00:37,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:00:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625415724] [2023-12-02 20:00:37,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625415724] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:00:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026390595] [2023-12-02 20:00:37,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:00:37,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:00:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:00:37,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:00:37,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 20:00:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:00:37,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 20:00:37,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:00:38,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:00:38,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:00:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:00:38,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:00:38,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-12-02 20:00:38,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:00:38,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:00:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:00:38,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026390595] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:00:38,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [114790724] [2023-12-02 20:00:38,229 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-12-02 20:00:38,229 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:00:38,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:00:38,237 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:00:38,237 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:00:38,849 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:00:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [114790724] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:00:39,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:00:39,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 14 [2023-12-02 20:00:39,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064700979] [2023-12-02 20:00:39,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:00:39,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 20:00:39,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:00:39,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 20:00:39,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=123, Unknown=2, NotChecked=0, Total=182 [2023-12-02 20:00:39,881 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:00:40,756 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-12-02 20:00:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:00:40,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 20:00:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:00:40,758 INFO L225 Difference]: With dead ends: 23 [2023-12-02 20:00:40,758 INFO L226 Difference]: Without dead ends: 15 [2023-12-02 20:00:40,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=123, Unknown=2, NotChecked=0, Total=182 [2023-12-02 20:00:40,760 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 20:00:40,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 20:00:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-02 20:00:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-02 20:00:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-12-02 20:00:40,765 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2023-12-02 20:00:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:00:40,765 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-12-02 20:00:40,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:00:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-12-02 20:00:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 20:00:40,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:00:40,766 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:00:40,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 20:00:40,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:00:40,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:00:40,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:00:40,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1651422971, now seen corresponding path program 1 times [2023-12-02 20:00:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:00:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093571603] [2023-12-02 20:00:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:00:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:00:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:00:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:00:41,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:00:41,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093571603] [2023-12-02 20:00:41,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093571603] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:00:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714700397] [2023-12-02 20:00:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:00:41,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:00:41,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:00:41,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:00:41,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:00:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:00:41,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 20:00:41,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:00:41,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:00:41,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:00:41,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:00:41,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:00:41,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 20:00:41,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:00:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:00:41,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:00:41,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:00:41,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-02 20:00:41,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:00:41,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-12-02 20:00:41,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 20:00:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:00:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714700397] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:00:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778722768] [2023-12-02 20:00:41,735 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-12-02 20:00:41,735 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:00:41,735 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:00:41,736 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:00:41,736 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:00:46,393 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:01:00,978 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '348#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (exists ((|v_#memory_$Pointer$.base_8| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.offset_37| Int) (|v_#memory_int_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_8| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_29| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (and (<= 1 |#StackHeapBarrier|) (= |v_#memory_$Pointer$.offset_8| (store |v_#memory_$Pointer$.offset_28| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.offset_28| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37| (select (select |v_#memory_$Pointer$.offset_8| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37|)))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_#memory_int_25| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_27| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_38| Int)) (and (= (store |v_#memory_$Pointer$.offset_27| |v_ULTIMATE.start_main_~p~0#1.base_38| (store (select |v_#memory_$Pointer$.offset_27| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4 0)) |v_#memory_$Pointer$.offset_28|) (= |v_ULTIMATE.start_main_~p~0#1.base_39| (select (select |v_#memory_$Pointer$.base_29| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4)) (= |v_ULTIMATE.start_main_~p~0#1.offset_37| (select (select |v_#memory_$Pointer$.offset_28| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4)) (= |v_#memory_int_26| (store |v_#memory_int_25| |v_ULTIMATE.start_main_~p~0#1.base_38| (store (select |v_#memory_int_25| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4 (select (select |v_#memory_int_26| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4)))) (= (store |v_#memory_$Pointer$.base_28| |v_ULTIMATE.start_main_~p~0#1.base_38| (store (select |v_#memory_$Pointer$.base_28| |v_ULTIMATE.start_main_~p~0#1.base_38|) 4 |ULTIMATE.start_main_~t~0#1.base|)) |v_#memory_$Pointer$.base_29|))) (= |#memory_int| (store |v_#memory_int_26| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37| 1) (+ |v_ULTIMATE.start_main_~p~0#1.offset_37| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_39|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_37| 4))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_8| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.offset_8| |v_ULTIMATE.start_main_~p~0#1.base_39|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_37| 4) 0))) (= |v_#memory_$Pointer$.base_8| (store |v_#memory_$Pointer$.base_29| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.base_29| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37| (select (select |v_#memory_$Pointer$.base_8| |v_ULTIMATE.start_main_~p~0#1.base_39|) |v_ULTIMATE.start_main_~p~0#1.offset_37|)))) (= (store |v_#memory_$Pointer$.base_8| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.base_8| |v_ULTIMATE.start_main_~p~0#1.base_39|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_37| 4) 0)) |#memory_$Pointer$.base|) (= |ULTIMATE.start_main_~t~0#1.offset| 0))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|)))' at error location [2023-12-02 20:01:00,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:01:00,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:01:00,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-12-02 20:01:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071811329] [2023-12-02 20:01:00,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:01:00,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 20:01:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:01:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 20:01:00,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=512, Unknown=9, NotChecked=0, Total=600 [2023-12-02 20:01:00,981 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:01:01,237 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-12-02 20:01:01,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:01:01,238 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 20:01:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:01:01,238 INFO L225 Difference]: With dead ends: 22 [2023-12-02 20:01:01,238 INFO L226 Difference]: Without dead ends: 20 [2023-12-02 20:01:01,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=127, Invalid=676, Unknown=9, NotChecked=0, Total=812 [2023-12-02 20:01:01,240 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:01:01,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:01:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-02 20:01:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-12-02 20:01:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-02 20:01:01,243 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2023-12-02 20:01:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:01:01,244 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-02 20:01:01,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-02 20:01:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 20:01:01,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:01:01,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:01:01,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 20:01:01,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:01:01,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:01:01,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:01:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1303834283, now seen corresponding path program 1 times [2023-12-02 20:01:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:01:01,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807177534] [2023-12-02 20:01:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:01:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:01:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:01:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:01:01,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:01:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807177534] [2023-12-02 20:01:01,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807177534] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:01:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579393214] [2023-12-02 20:01:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:01:01,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:01:01,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:01:01,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:01:01,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:01:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:01:01,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 20:01:01,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:01:02,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:01:02,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:01:02,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:01:02,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:01:02,110 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 [2023-12-02 20:01:02,193 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 20:01:02,193 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 87 treesize of output 78 [2023-12-02 20:01:02,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2023-12-02 20:01:02,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 32 treesize of output 19 [2023-12-02 20:01:02,256 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 [2023-12-02 20:01:02,260 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 [2023-12-02 20:01:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:01:02,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:01:02,349 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 452 treesize of output 408 [2023-12-02 20:01:02,377 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_177) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (or (forall ((v_ArrVal_179 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((v_ArrVal_177 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_177) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))))) is different from false [2023-12-02 20:01:02,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:02,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 20:01:02,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:02,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 20:01:02,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 11 treesize of output 7 [2023-12-02 20:01:02,455 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:01:02,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-02 20:01:02,463 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:01:02,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-12-02 20:01:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:01:02,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579393214] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:01:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1901478627] [2023-12-02 20:01:02,585 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 20:01:02,586 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:01:02,586 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:01:02,586 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:01:02,586 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:01:03,067 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:01:05,831 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '519#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~p~0#1.offset| 0)) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|))))' at error location [2023-12-02 20:01:05,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:01:05,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:01:05,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-12-02 20:01:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953263653] [2023-12-02 20:01:05,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:01:05,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 20:01:05,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:01:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 20:01:05,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=530, Unknown=2, NotChecked=46, Total=650 [2023-12-02 20:01:05,833 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:01:06,165 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2023-12-02 20:01:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:01:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 20:01:06,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:01:06,167 INFO L225 Difference]: With dead ends: 33 [2023-12-02 20:01:06,167 INFO L226 Difference]: Without dead ends: 31 [2023-12-02 20:01:06,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=126, Invalid=806, Unknown=2, NotChecked=58, Total=992 [2023-12-02 20:01:06,169 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 59 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:01:06,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 55 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 108 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2023-12-02 20:01:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-02 20:01:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2023-12-02 20:01:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-02 20:01:06,175 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2023-12-02 20:01:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:01:06,176 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-02 20:01:06,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-02 20:01:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 20:01:06,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:01:06,177 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:01:06,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:01:06,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:01:06,383 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:01:06,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:01:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1161912507, now seen corresponding path program 2 times [2023-12-02 20:01:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:01:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954035818] [2023-12-02 20:01:06,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:01:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:01:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:01:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:01:06,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:01:06,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954035818] [2023-12-02 20:01:06,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954035818] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:01:06,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810399973] [2023-12-02 20:01:06,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:01:06,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:01:06,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:01:06,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:01:06,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:01:06,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 20:01:06,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:01:06,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 20:01:06,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:01:06,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:01:07,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:01:07,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:01:07,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:01:07,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:01:07,144 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-02 20:01:07,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 20:01:07,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 20:01:07,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-12-02 20:01:07,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 20:01:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:01:07,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:01:07,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2023-12-02 20:01:07,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2023-12-02 20:01:07,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2023-12-02 20:01:07,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2023-12-02 20:01:07,444 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) 0) (not (= (select v_arrayElimArr_5 .cse0) 0)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int))) (or (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) 0) (not (= (select v_arrayElimArr_8 .cse0) 0)) (not (= (select v_arrayElimArr_7 .cse0) 0)))))) is different from false [2023-12-02 20:01:07,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 20:01:07,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 20:01:07,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2023-12-02 20:01:07,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,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 38 treesize of output 38 [2023-12-02 20:01:07,887 INFO L349 Elim1Store]: treesize reduction 34, result has 83.2 percent of original size [2023-12-02 20:01:07,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 295 [2023-12-02 20:01:07,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:07,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 176 [2023-12-02 20:01:13,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:13,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 20:01:13,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:13,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 20:01:13,603 INFO L349 Elim1Store]: treesize reduction 88, result has 21.4 percent of original size [2023-12-02 20:01:13,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 107 [2023-12-02 20:01:13,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:01:13,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-02 20:01:13,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:01:13,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:01:13,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 59 [2023-12-02 20:01:13,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:01:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:01:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810399973] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:01:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [836877512] [2023-12-02 20:01:13,884 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 20:01:13,884 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:01:13,884 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:01:13,885 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:01:13,885 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:01:14,261 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:01:17,025 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '737#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~p~0#1.offset| 0)) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|))))' at error location [2023-12-02 20:01:17,026 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:01:17,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:01:17,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-12-02 20:01:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502617469] [2023-12-02 20:01:17,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:01:17,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 20:01:17,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:01:17,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 20:01:17,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=572, Unknown=2, NotChecked=48, Total=702 [2023-12-02 20:01:17,028 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 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) [2023-12-02 20:01:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:01:17,314 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-12-02 20:01:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:01:17,315 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 20:01:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:01:17,315 INFO L225 Difference]: With dead ends: 37 [2023-12-02 20:01:17,316 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 20:01:17,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=123, Invalid=809, Unknown=2, NotChecked=58, Total=992 [2023-12-02 20:01:17,317 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 65 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:01:17,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 63 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2023-12-02 20:01:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 20:01:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-12-02 20:01:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-12-02 20:01:17,320 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-12-02 20:01:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:01:17,320 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-12-02 20:01:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 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) [2023-12-02 20:01:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-12-02 20:01:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 20:01:17,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:01:17,321 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:01:17,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:01:17,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 20:01:17,522 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:01:17,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:01:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1908211058, now seen corresponding path program 3 times [2023-12-02 20:01:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:01:17,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755236904] [2023-12-02 20:01:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:01:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:01:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:01:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:01:18,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:01:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755236904] [2023-12-02 20:01:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755236904] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:01:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529121546] [2023-12-02 20:01:18,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 20:01:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:01:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:01:18,187 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:01:18,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:01:18,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 20:01:18,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:01:18,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 20:01:18,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:01:18,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:01:18,330 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:01:18,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 20:01:18,381 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 [2023-12-02 20:01:18,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:01:18,451 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 20:01:18,452 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 33 treesize of output 24 [2023-12-02 20:01:18,468 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-02 20:01:18,468 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 20 treesize of output 22 [2023-12-02 20:01:18,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:01:18,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:01:18,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:01:18,557 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-12-02 20:01:18,557 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 175 treesize of output 125 [2023-12-02 20:01:18,563 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 128 treesize of output 105 [2023-12-02 20:01:18,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-02 20:01:18,663 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 20:01:18,663 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 172 treesize of output 135 [2023-12-02 20:01:18,679 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-02 20:01:18,679 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 128 treesize of output 121 [2023-12-02 20:01:18,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2023-12-02 20:01:18,749 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 20:01:18,749 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 71 treesize of output 30 [2023-12-02 20:01:18,753 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 [2023-12-02 20:01:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:01:18,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:01:18,794 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_341) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2023-12-02 20:01:18,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:18,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2023-12-02 20:01:18,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:18,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2023-12-02 20:01:18,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:18,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2023-12-02 20:01:18,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2023-12-02 20:01:19,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-12-02 20:01:19,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:19,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:01:19,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:19,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2023-12-02 20:01:19,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 62 [2023-12-02 20:01:19,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:19,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 56 [2023-12-02 20:01:19,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:19,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 20:01:19,254 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:01:19,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:19,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 20:01:19,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:01:19,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:19,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 20:01:19,293 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:01:19,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:19,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-12-02 20:01:19,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:19,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2023-12-02 20:01:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 20:01:19,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529121546] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:01:19,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1524124437] [2023-12-02 20:01:19,797 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 20:01:19,797 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:01:19,798 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:01:19,798 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:01:19,798 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:01:20,120 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:01:22,860 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '965#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~p~0#1.offset| 0)) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|))))' at error location [2023-12-02 20:01:22,860 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:01:22,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:01:22,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2023-12-02 20:01:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109598626] [2023-12-02 20:01:22,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:01:22,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 20:01:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:01:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 20:01:22,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=760, Unknown=12, NotChecked=56, Total=930 [2023-12-02 20:01:22,863 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:01:23,404 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-12-02 20:01:23,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:01:23,405 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 20:01:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:01:23,405 INFO L225 Difference]: With dead ends: 37 [2023-12-02 20:01:23,405 INFO L226 Difference]: Without dead ends: 35 [2023-12-02 20:01:23,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=161, Invalid=1163, Unknown=12, NotChecked=70, Total=1406 [2023-12-02 20:01:23,406 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 20:01:23,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 87 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 192 Invalid, 1 Unknown, 34 Unchecked, 0.2s Time] [2023-12-02 20:01:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-02 20:01:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-12-02 20:01:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-12-02 20:01:23,411 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2023-12-02 20:01:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:01:23,411 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-12-02 20:01:23,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:01:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-12-02 20:01:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 20:01:23,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:01:23,412 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:01:23,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:01:23,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 20:01:23,613 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:01:23,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:01:23,613 INFO L85 PathProgramCache]: Analyzing trace with hash 676313314, now seen corresponding path program 4 times [2023-12-02 20:01:23,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:01:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967049977] [2023-12-02 20:01:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:01:23,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:01:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:01:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:01:24,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:01:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967049977] [2023-12-02 20:01:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967049977] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:01:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765442736] [2023-12-02 20:01:24,454 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 20:01:24,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:01:24,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:01:24,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:01:24,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:01:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:01:24,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 20:01:24,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:01:24,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:01:24,576 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:01:24,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 20:01:24,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:01:24,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:01:24,670 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 20:01:24,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 20:01:24,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:01:24,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:01:24,746 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-02 20:01:24,746 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 113 treesize of output 71 [2023-12-02 20:01:24,751 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 35 treesize of output 11 [2023-12-02 20:01:24,837 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 20:01:24,838 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 147 treesize of output 102 [2023-12-02 20:01:24,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 23 [2023-12-02 20:01:24,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:01:24,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-12-02 20:01:25,000 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:01:25,000 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 74 treesize of output 37 [2023-12-02 20:01:25,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-02 20:01:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:01:25,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:01:25,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 393 [2023-12-02 20:01:25,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_442))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2023-12-02 20:01:25,140 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_436 (Array Int Int)) (|ULTIMATE.start_main_~t~0#1.offset| Int) (v_ArrVal_442 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_436))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (forall ((v_ArrVal_436 (Array Int Int)) (|ULTIMATE.start_main_~t~0#1.offset| Int) (v_ArrVal_442 (Array Int Int))) (= |ULTIMATE.start_main_~t~0#1.offset| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_442))) (select (select .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))))) is different from false [2023-12-02 20:01:25,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:25,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 124 [2023-12-02 20:01:25,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:25,183 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 98 treesize of output 92 [2023-12-02 20:01:25,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 20:01:25,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:25,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2023-12-02 20:01:25,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:25,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2023-12-02 20:01:25,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:25,328 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 230 treesize of output 229 [2023-12-02 20:01:26,219 INFO L349 Elim1Store]: treesize reduction 414, result has 57.9 percent of original size [2023-12-02 20:01:26,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 2336 treesize of output 2617 [2023-12-02 20:01:26,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:26,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 694 treesize of output 660 [2023-12-02 20:01:26,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:26,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 634 treesize of output 486 [2023-12-02 20:01:26,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 508 treesize of output 412 [2023-12-02 20:01:26,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:01:26,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 498 treesize of output 458 [2023-12-02 20:06:39,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 20:06:39,228 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 20:06:39,229 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2023-12-02 20:06:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1389399609] [2023-12-02 20:06:39,231 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 20:06:39,232 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:06:39,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:06:39,232 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:06:39,232 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:06:39,236 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:332) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:223) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2023-12-02 20:06:39,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:06:39,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-12-02 20:06:39,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047315136] [2023-12-02 20:06:39,239 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 20:06:39,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:06:39,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:06:39,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:06:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=333, Unknown=2, NotChecked=74, Total=462 [2023-12-02 20:06:39,240 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:39,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=333, Unknown=2, NotChecked=74, Total=462 [2023-12-02 20:06:39,241 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:39,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 20:06:39,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:06:39,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:39,442 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_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-12-02 20:06:39,445 INFO L158 Benchmark]: Toolchain (without parser) took 363369.85ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 163.8MB in the beginning and 139.0MB in the end (delta: 24.7MB). Peak memory consumption was 187.5MB. Max. memory is 16.1GB. [2023-12-02 20:06:39,445 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 142.6MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 20:06:39,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.37ms. Allocated memory is still 211.8MB. Free memory was 163.2MB in the beginning and 146.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 20:06:39,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.89ms. Allocated memory is still 211.8MB. Free memory was 146.4MB in the beginning and 144.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:06:39,446 INFO L158 Benchmark]: Boogie Preprocessor took 26.12ms. Allocated memory is still 211.8MB. Free memory was 144.3MB in the beginning and 143.4MB in the end (delta: 909.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:06:39,446 INFO L158 Benchmark]: RCFGBuilder took 308.64ms. Allocated memory is still 211.8MB. Free memory was 143.4MB in the beginning and 129.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 20:06:39,447 INFO L158 Benchmark]: TraceAbstraction took 362574.62ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 129.3MB in the beginning and 139.0MB in the end (delta: -9.7MB). Peak memory consumption was 153.9MB. Max. memory is 16.1GB. [2023-12-02 20:06:39,449 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.23ms. Allocated memory is still 142.6MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.37ms. Allocated memory is still 211.8MB. Free memory was 163.2MB in the beginning and 146.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.89ms. Allocated memory is still 211.8MB. Free memory was 146.4MB in the beginning and 144.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.12ms. Allocated memory is still 211.8MB. Free memory was 144.3MB in the beginning and 143.4MB in the end (delta: 909.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 308.64ms. Allocated memory is still 211.8MB. Free memory was 143.4MB in the beginning and 129.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 362574.62ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 129.3MB in the beginning and 139.0MB in the end (delta: -9.7MB). Peak memory consumption was 153.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/simple-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:06:41,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:06:41,244 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 20:06:41,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:06:41,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:06:41,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:06:41,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:06:41,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:06:41,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:06:41,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:06:41,279 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 20:06:41,280 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 20:06:41,280 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 20:06:41,281 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 20:06:41,282 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 20:06:41,282 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 20:06:41,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:06:41,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:06:41,285 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:06:41,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:06:41,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:06:41,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:06:41,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:06:41,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:06:41,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 20:06:41,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 20:06:41,289 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 20:06:41,289 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:06:41,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:06:41,290 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:06:41,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:06:41,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:06:41,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:06:41,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:06:41,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:06:41,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:06:41,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:06:41,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:06:41,293 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 20:06:41,293 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 20:06:41,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:06:41,294 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:06:41,294 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 20:06:41,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 20:06:41,294 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2023-12-02 20:06:41,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:06:41,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:06:41,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:06:41,634 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:06:41,635 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:06:41,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-properties/simple-2.i [2023-12-02 20:06:44,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:06:44,709 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:06:44,710 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/sv-benchmarks/c/list-properties/simple-2.i [2023-12-02 20:06:44,726 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/data/9a7a50cbb/1ab80e372d984f1cbf9a0ba35d50f751/FLAGd8628ee81 [2023-12-02 20:06:44,741 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/data/9a7a50cbb/1ab80e372d984f1cbf9a0ba35d50f751 [2023-12-02 20:06:44,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:06:44,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:06:44,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:06:44,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:06:44,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:06:44,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:06:44" (1/1) ... [2023-12-02 20:06:44,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28269d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:44, skipping insertion in model container [2023-12-02 20:06:44,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:06:44" (1/1) ... [2023-12-02 20:06:44,798 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:06:45,100 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2023-12-02 20:06:45,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:06:45,121 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:06:45,159 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2023-12-02 20:06:45,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:06:45,197 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:06:45,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45 WrapperNode [2023-12-02 20:06:45,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:06:45,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:06:45,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:06:45,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:06:45,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,248 INFO L138 Inliner]: procedures = 127, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-12-02 20:06:45,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:06:45,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:06:45,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:06:45,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:06:45,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:06:45,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:06:45,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:06:45,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:06:45,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (1/1) ... [2023-12-02 20:06:45,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:06:45,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:06:45,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:06:45,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:06:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-02 20:06:45,357 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-02 20:06:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 20:06:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 20:06:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:06:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 20:06:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 20:06:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 20:06:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 20:06:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:06:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:06:45,479 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:06:45,482 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:06:45,516 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-02 20:06:45,664 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:06:45,690 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:06:45,691 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:06:45,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:06:45 BoogieIcfgContainer [2023-12-02 20:06:45,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:06:45,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:06:45,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:06:45,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:06:45,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:06:44" (1/3) ... [2023-12-02 20:06:45,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f30e475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:06:45, skipping insertion in model container [2023-12-02 20:06:45,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:06:45" (2/3) ... [2023-12-02 20:06:45,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f30e475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:06:45, skipping insertion in model container [2023-12-02 20:06:45,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:06:45" (3/3) ... [2023-12-02 20:06:45,701 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-12-02 20:06:45,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:06:45,722 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 20:06:45,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 20:06:45,779 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40e561dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:06:45,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:06:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 20:06:45,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:45,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:45,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:06:45,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:45,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1597896168, now seen corresponding path program 1 times [2023-12-02 20:06:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 20:06:45,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047813254] [2023-12-02 20:06:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:45,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:45,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 20:06:45,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:06:45,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 20:06:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:45,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 20:06:45,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:45,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:06:45,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 20:06:45,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047813254] [2023-12-02 20:06:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047813254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:06:45,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:06:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:06:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040176146] [2023-12-02 20:06:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:06:45,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:06:45,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 20:06:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:06:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:06:45,956 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:45,977 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-12-02 20:06:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:06:45,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 20:06:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:45,986 INFO L225 Difference]: With dead ends: 27 [2023-12-02 20:06:45,986 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 20:06:45,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:06:45,993 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:45,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 20:06:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 20:06:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-02 20:06:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-02 20:06:46,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-12-02 20:06:46,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:46,025 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-02 20:06:46,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-02 20:06:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 20:06:46,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:46,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:46,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 20:06:46,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:46,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:06:46,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:46,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1847503380, now seen corresponding path program 1 times [2023-12-02 20:06:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 20:06:46,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800451608] [2023-12-02 20:06:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:46,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 20:06:46,232 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:06:46,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 20:06:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:46,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 20:06:46,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:46,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-12-02 20:06:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:46,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:06:46,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 20:06:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800451608] [2023-12-02 20:06:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800451608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:06:46,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:06:46,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:06:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910235142] [2023-12-02 20:06:46,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:06:46,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:06:46,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 20:06:46,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:06:46,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:06:46,446 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:46,610 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-12-02 20:06:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:06:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 20:06:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:46,612 INFO L225 Difference]: With dead ends: 28 [2023-12-02 20:06:46,612 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 20:06:46,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:06:46,614 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:46,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:06:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 20:06:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2023-12-02 20:06:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-02 20:06:46,621 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2023-12-02 20:06:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:46,621 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-02 20:06:46,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-02 20:06:46,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 20:06:46,623 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:46,623 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:46,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 20:06:46,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:46,824 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:06:46,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1027892324, now seen corresponding path program 1 times [2023-12-02 20:06:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 20:06:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827338567] [2023-12-02 20:06:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:46,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 20:06:46,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:06:46,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 20:06:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:46,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 20:06:46,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:46,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:06:46,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:06:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:47,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:47,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-12-02 20:06:47,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:47,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:47,134 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 20:06:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827338567] [2023-12-02 20:06:47,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827338567] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [906621103] [2023-12-02 20:06:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:47,136 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 20:06:47,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 20:06:47,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 20:06:47,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-02 20:06:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:47,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 20:06:47,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:47,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:47,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:47,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:47,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-12-02 20:06:47,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:47,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [906621103] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:47,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966640348] [2023-12-02 20:06:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:47,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:06:47,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:06:47,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:06:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:47,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 20:06:47,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:47,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:47,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:47,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:47,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-12-02 20:06:47,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:47,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966640348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:47,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 20:06:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 20:06:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501149394] [2023-12-02 20:06:47,751 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 20:06:47,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 20:06:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 20:06:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 20:06:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-02 20:06:47,754 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:47,965 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-02 20:06:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:06:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 20:06:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:47,969 INFO L225 Difference]: With dead ends: 32 [2023-12-02 20:06:47,969 INFO L226 Difference]: Without dead ends: 22 [2023-12-02 20:06:47,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-02 20:06:47,971 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:47,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 36 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 20:06:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-02 20:06:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2023-12-02 20:06:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-12-02 20:06:47,975 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2023-12-02 20:06:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:47,976 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-12-02 20:06:47,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-12-02 20:06:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 20:06:47,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:47,977 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:47,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-02 20:06:48,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 20:06:48,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:06:48,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:48,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:06:48,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1651422971, now seen corresponding path program 1 times [2023-12-02 20:06:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 20:06:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128303963] [2023-12-02 20:06:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:48,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:48,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 20:06:48,582 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:06:48,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 20:06:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:48,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 20:06:48,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:48,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:06:48,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:48,762 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:06:48,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:06:48,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:06:48,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:06:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:48,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:49,001 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_107 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_106 (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_106 .cse0))))))) is different from false [2023-12-02 20:06:49,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:49,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2023-12-02 20:06:49,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-02 20:06:49,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2023-12-02 20:06:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:49,355 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 20:06:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128303963] [2023-12-02 20:06:49,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128303963] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1416814667] [2023-12-02 20:06:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:49,356 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 20:06:49,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 20:06:49,357 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 20:06:49,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-02 20:06:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:49,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 20:06:49,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:49,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:06:49,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:49,640 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:06:49,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:06:49,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 20:06:49,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:06:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:49,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:49,889 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_107 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_138 (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_138 .cse0))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2023-12-02 20:06:49,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:49,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2023-12-02 20:06:49,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-02 20:06:50,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:06:50,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 102 treesize of output 98 [2023-12-02 20:06:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1416814667] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986448038] [2023-12-02 20:06:50,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:50,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:50,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:06:50,155 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:06:50,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:06:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:50,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 20:06:50,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:50,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:06:50,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:50,300 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:06:50,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:06:50,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:06:50,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:06:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:50,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:50,386 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2023-12-02 20:06:50,419 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_173 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_173) |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_172 .cse0))) v_ArrVal_172)))) is different from false [2023-12-02 20:06:50,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:50,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2023-12-02 20:06:50,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-02 20:06:50,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:06:50,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-12-02 20:06:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:06:50,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986448038] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:50,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 20:06:50,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2023-12-02 20:06:50,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895456560] [2023-12-02 20:06:50,664 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 20:06:50,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 20:06:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 20:06:50,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 20:06:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=167, Unknown=8, NotChecked=116, Total=342 [2023-12-02 20:06:50,667 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:51,157 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-02 20:06:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:06:51,158 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 20:06:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:51,159 INFO L225 Difference]: With dead ends: 32 [2023-12-02 20:06:51,159 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 20:06:51,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=320, Unknown=8, NotChecked=164, Total=600 [2023-12-02 20:06:51,161 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:51,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 51 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 75 Invalid, 0 Unknown, 119 Unchecked, 0.3s Time] [2023-12-02 20:06:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 20:06:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2023-12-02 20:06:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-12-02 20:06:51,167 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2023-12-02 20:06:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:51,168 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-12-02 20:06:51,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-12-02 20:06:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 20:06:51,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:51,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:51,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 20:06:51,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-02 20:06:51,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 20:06:51,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:51,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:06:51,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1303834283, now seen corresponding path program 1 times [2023-12-02 20:06:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 20:06:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623828604] [2023-12-02 20:06:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:51,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:51,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 20:06:51,772 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:06:51,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 20:06:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:51,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 20:06:51,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:51,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:06:51,928 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:06:51,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:06:51,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 20:06:52,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 20:06:52,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 100 [2023-12-02 20:06:52,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 19 [2023-12-02 20:06:52,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2023-12-02 20:06:52,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-12-02 20:06:52,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 20:06:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:52,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:52,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:52,272 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 85 treesize of output 89 [2023-12-02 20:06:52,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 131 [2023-12-02 20:06:52,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_207 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_207 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-12-02 20:06:52,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:52,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 20:06:52,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:52,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:06:52,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 7 treesize of output 3 [2023-12-02 20:06:52,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:06:52,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:52,484 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-12-02 20:06:52,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:06:52,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:52,491 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:06:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:06:52,582 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 20:06:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623828604] [2023-12-02 20:06:52,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623828604] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712275149] [2023-12-02 20:06:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 20:06:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 20:06:52,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 20:06:52,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-02 20:06:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:52,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 20:06:52,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:52,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:06:52,842 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:06:52,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:06:52,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:06:52,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:53,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 20:06:53,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2023-12-02 20:06:53,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 20:06:53,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-02 20:06:53,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 20:06:53,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:06:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:53,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:53,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:53,221 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 85 treesize of output 89 [2023-12-02 20:06:53,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 14 treesize of output 3 [2023-12-02 20:06:53,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 224 [2023-12-02 20:06:53,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:53,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 20:06:53,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:53,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:06:53,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 7 treesize of output 3 [2023-12-02 20:06:53,467 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:06:53,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-12-02 20:06:53,476 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:06:53,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-02 20:06:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1712275149] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994525848] [2023-12-02 20:06:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:53,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:53,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:06:53,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:06:53,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 20:06:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:53,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 20:06:53,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:53,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:06:53,705 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:06:53,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:06:53,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:53,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:06:53,819 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 20:06:53,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2023-12-02 20:06:53,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-02 20:06:53,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 20:06:53,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 20:06:53,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:06:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:53,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:53,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:53,954 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 85 treesize of output 89 [2023-12-02 20:06:53,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 131 [2023-12-02 20:06:54,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_277 (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_277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2023-12-02 20:06:54,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:54,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 20:06:54,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:54,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:06:54,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:06:54,139 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:06:54,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-12-02 20:06:54,149 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:06:54,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-02 20:06:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:06:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994525848] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:06:54,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 20:06:54,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 19 [2023-12-02 20:06:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210286999] [2023-12-02 20:06:54,234 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 20:06:54,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 20:06:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 20:06:54,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 20:06:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=254, Unknown=7, NotChecked=66, Total=380 [2023-12-02 20:06:54,237 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:54,859 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-12-02 20:06:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:06:54,860 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 20:06:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:54,861 INFO L225 Difference]: With dead ends: 35 [2023-12-02 20:06:54,861 INFO L226 Difference]: Without dead ends: 33 [2023-12-02 20:06:54,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=8, NotChecked=90, Total=650 [2023-12-02 20:06:54,863 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 88 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:54,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 60 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 121 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2023-12-02 20:06:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-02 20:06:54,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-02 20:06:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-02 20:06:54,868 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2023-12-02 20:06:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:54,869 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-02 20:06:54,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:06:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-02 20:06:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 20:06:54,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:54,870 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:54,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-02 20:06:55,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 20:06:55,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-12-02 20:06:55,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 20:06:55,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:06:55,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1687156834, now seen corresponding path program 2 times [2023-12-02 20:06:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 20:06:55,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213118204] [2023-12-02 20:06:55,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:06:55,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:06:55,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 20:06:55,473 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:06:55,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 20:06:55,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:06:55,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:06:55,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 20:06:55,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:55,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:06:55,647 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 20:06:55,648 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 21 treesize of output 20 [2023-12-02 20:06:55,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:55,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:06:55,772 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:06:55,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:06:55,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:06:55,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:06:55,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:06:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:55,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:55,893 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2023-12-02 20:06:55,907 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2023-12-02 20:06:55,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_29| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_329) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_331) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|))))) is different from false [2023-12-02 20:06:55,962 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_29| (_ BitVec 32))) (or (not (= v_ArrVal_326 (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_326 .cse0))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_329) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_331) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2023-12-02 20:06:56,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:06:56,024 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 1960 treesize of output 1934 [2023-12-02 20:06:56,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:06:56,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 54 treesize of output 46 [2023-12-02 20:06:56,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 111 [2023-12-02 20:07:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-02 20:07:00,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 20:07:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213118204] [2023-12-02 20:07:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213118204] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:07:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [616830542] [2023-12-02 20:07:00,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:07:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 20:07:00,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 20:07:00,365 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 20:07:00,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-02 20:07:00,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:07:00,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:07:00,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 20:07:00,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:07:00,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:07:00,592 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:07:00,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:07:00,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:07:00,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 20:07:00,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:07:00,747 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 9 treesize of output 3 [2023-12-02 20:07:00,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:07:00,818 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 20:07:00,818 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 26 treesize of output 18 [2023-12-02 20:07:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:07:00,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:07:00,887 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= v_ArrVal_381 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv1 32)) .cse0 (select v_ArrVal_381 .cse0))))))) is different from false [2023-12-02 20:07:00,916 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 47 treesize of output 35 [2023-12-02 20:07:00,938 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_89 (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379))) (or (= (select (select (store .cse0 v_arrayElimCell_89 v_ArrVal_381) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= v_ArrVal_381 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (store (store (select .cse0 v_arrayElimCell_89) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv1 32)) .cse1 (select v_ArrVal_381 .cse1)))))))) is different from false [2023-12-02 20:07:00,972 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_89 (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379))) (or (= (select (select (store .cse0 v_arrayElimCell_89 v_ArrVal_381) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= v_ArrVal_381 (store (store (select .cse0 v_arrayElimCell_89) (_ bv0 32) (_ bv1 32)) (_ bv4 32) (select v_ArrVal_381 (_ bv4 32)))))))) is different from false [2023-12-02 20:07:01,033 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_89 (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_379))) (or (= (select (select (store .cse0 v_arrayElimCell_89 v_ArrVal_381) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= v_ArrVal_377 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_377 .cse1))))) (not (= v_ArrVal_381 (store (store (select .cse0 v_arrayElimCell_89) (_ bv0 32) (_ bv1 32)) (_ bv4 32) (select v_ArrVal_381 (_ bv4 32)))))))) is different from false [2023-12-02 20:07:01,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:01,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 576 treesize of output 588 [2023-12-02 20:07:01,625 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2023-12-02 20:07:01,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 143 [2023-12-02 20:07:01,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:01,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2023-12-02 20:07:02,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:02,014 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 30 treesize of output 40 [2023-12-02 20:07:02,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:02,219 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 30 treesize of output 40 [2023-12-02 20:07:02,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:02,402 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 30 treesize of output 40 [2023-12-02 20:07:02,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:02,623 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 30 treesize of output 40 [2023-12-02 20:07:04,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:04,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2023-12-02 20:07:04,190 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:07:04,255 INFO L349 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2023-12-02 20:07:04,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 18 [2023-12-02 20:07:04,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:07:04,321 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:07:04,325 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:07:04,330 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:07:04,414 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2023-12-02 20:07:04,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 101 [2023-12-02 20:07:04,522 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:07:04,522 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:07:04,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-12-02 20:07:04,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:04,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2023-12-02 20:07:04,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:07:04,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:07:04,641 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-12-02 20:07:04,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 18 [2023-12-02 20:07:04,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:04,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 13 [2023-12-02 20:07:04,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:07:04,807 INFO L349 Elim1Store]: treesize reduction 209, result has 0.5 percent of original size [2023-12-02 20:07:04,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 1 [2023-12-02 20:07:04,854 INFO L349 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2023-12-02 20:07:04,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 121 treesize of output 1 [2023-12-02 20:07:04,890 INFO L349 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2023-12-02 20:07:04,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 1 [2023-12-02 20:07:04,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:07:04,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:07:04,962 INFO L349 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2023-12-02 20:07:04,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 1 [2023-12-02 20:07:04,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:07:05,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-12-02 20:07:05,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:05,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 265 treesize of output 269 [2023-12-02 20:07:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-02 20:07:06,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [616830542] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:07:06,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682186080] [2023-12-02 20:07:06,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:07:06,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:07:06,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:07:06,032 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:07:06,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 20:07:06,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:07:06,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:07:06,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 20:07:06,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:07:06,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:07:06,180 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 20:07:06,180 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 21 treesize of output 20 [2023-12-02 20:07:06,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:07:06,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 20:07:06,250 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:07:06,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:07:06,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:07:06,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:07:06,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:07:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:07:06,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:07:08,799 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_431 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_35| (_ BitVec 32)) (v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_431) |v_ULTIMATE.start_main_~t~0#1.base_35| v_ArrVal_433) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_429 (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_429 .cse0))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_35|))))) is different from false [2023-12-02 20:07:08,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:08,855 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 496 treesize of output 494 [2023-12-02 20:07:08,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 55 treesize of output 51 [2023-12-02 20:07:08,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-12-02 20:07:09,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:07:09,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 63 [2023-12-02 20:07:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:07:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682186080] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:07:11,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 20:07:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 31 [2023-12-02 20:07:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300142968] [2023-12-02 20:07:11,178 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 20:07:11,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 20:07:11,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 20:07:11,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 20:07:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=36, NotChecked=450, Total=992 [2023-12-02 20:07:11,180 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:07:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:07:11,891 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-02 20:07:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:07:11,891 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 20:07:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:07:11,892 INFO L225 Difference]: With dead ends: 32 [2023-12-02 20:07:11,892 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 20:07:11,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=36, NotChecked=558, Total=1406 [2023-12-02 20:07:11,894 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 20:07:11,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 54 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 106 Invalid, 0 Unknown, 223 Unchecked, 0.4s Time] [2023-12-02 20:07:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 20:07:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-12-02 20:07:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:07:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-02 20:07:11,900 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2023-12-02 20:07:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:07:11,901 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-02 20:07:11,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:07:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-02 20:07:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 20:07:11,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:07:11,902 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:07:11,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-12-02 20:07:12,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 20:07:12,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 20:07:12,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:07:12,503 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:07:12,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:07:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1161912507, now seen corresponding path program 2 times [2023-12-02 20:07:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 20:07:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186670762] [2023-12-02 20:07:12,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:07:12,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:07:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 20:07:12,505 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:07:12,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 20:07:12,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:07:12,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:07:12,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 20:07:12,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:07:12,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:07:12,645 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:07:12,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 13 treesize of output 13 [2023-12-02 20:07:12,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:07:12,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:07:12,770 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-02 20:07:12,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 20:07:12,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-12-02 20:07:12,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 20:07:12,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 20:07:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:07:12,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:07:13,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:13,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2023-12-02 20:07:13,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:13,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2023-12-02 20:07:13,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:13,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2023-12-02 20:07:13,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:13,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2023-12-02 20:07:13,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (_ bv0 32)) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_13 .cse2) (_ bv0 32))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_11 .cse2) (_ bv0 32))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (_ bv0 32)) (not (= (select v_arrayElimArr_12 .cse2) (_ bv0 32))))))) is different from false [2023-12-02 20:07:13,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:13,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 60 treesize of output 61 [2023-12-02 20:07:13,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:13,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 20:07:13,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:13,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2023-12-02 20:07:13,984 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-12-02 20:07:13,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 335 [2023-12-02 20:07:14,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:14,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 182 [2023-12-02 20:07:14,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:14,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 97 [2023-12-02 20:07:23,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:23,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 20:07:23,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:23,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 20:07:51,462 WARN L293 SmtUtils]: Spent 28.15s on a formula simplification. DAG size of input: 47 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 20:07:51,462 INFO L349 Elim1Store]: treesize reduction 59, result has 47.3 percent of original size [2023-12-02 20:07:51,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 136 [2023-12-02 20:07:52,997 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2023-12-02 20:07:52,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2023-12-02 20:07:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:07:53,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2023-12-02 20:07:53,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:07:53,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:07:53,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:53,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 112 [2023-12-02 20:07:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:07:53,361 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 20:07:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186670762] [2023-12-02 20:07:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186670762] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:07:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [335774999] [2023-12-02 20:07:53,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:07:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 20:07:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 20:07:53,362 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 20:07:53,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 20:07:53,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:07:53,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:07:53,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 20:07:53,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:07:53,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:07:53,575 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:07:53,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:07:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:07:53,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:07:53,685 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-02 20:07:53,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 20:07:53,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-12-02 20:07:53,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 20:07:53,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 20:07:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:07:53,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:07:53,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:53,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2023-12-02 20:07:53,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:53,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2023-12-02 20:07:53,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:53,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2023-12-02 20:07:53,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:53,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2023-12-02 20:07:53,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_22 .cse0))) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_21))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_22) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (_ bv0 32)) (not (= (select v_arrayElimArr_21 .cse0) (_ bv0 32))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_20))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (_ bv0 32)) (not (= (select v_arrayElimArr_20 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_19 .cse0) (_ bv0 32))))))) is different from false [2023-12-02 20:07:54,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:54,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 20:07:54,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:54,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 20:07:54,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:54,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2023-12-02 20:07:54,683 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-12-02 20:07:54,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 335 [2023-12-02 20:07:54,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:54,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 117 [2023-12-02 20:07:54,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:07:54,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 176 [2023-12-02 20:08:05,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:05,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 20:08:05,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:05,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 20:08:30,293 WARN L293 SmtUtils]: Spent 24.61s on a formula simplification. DAG size of input: 47 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 20:08:30,293 INFO L349 Elim1Store]: treesize reduction 59, result has 47.3 percent of original size [2023-12-02 20:08:30,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 136 [2023-12-02 20:08:31,854 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2023-12-02 20:08:31,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2023-12-02 20:08:31,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:08:31,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2023-12-02 20:08:31,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:08:31,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:08:31,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:31,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 112 [2023-12-02 20:08:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:08:32,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [335774999] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:08:32,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292445107] [2023-12-02 20:08:32,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:08:32,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:08:32,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:08:32,131 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:08:32,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 20:08:32,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:08:32,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:08:32,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 20:08:32,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:08:32,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:08:32,345 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:08:32,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:08:32,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:08:32,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:08:32,446 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-02 20:08:32,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 20:08:32,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 20:08:32,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-12-02 20:08:32,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 20:08:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:08:32,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:08:32,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:32,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2023-12-02 20:08:32,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:32,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2023-12-02 20:08:32,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:32,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2023-12-02 20:08:32,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:32,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2023-12-02 20:08:32,739 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_30 .cse0) (_ bv0 32))) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (_ bv0 32)) (not (= (select v_arrayElimArr_29 .cse0) (_ bv0 32))))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 .cse0) (_ bv0 32))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (_ bv0 32)) (not (= (select v_arrayElimArr_28 .cse0) (_ bv0 32))))))) is different from false [2023-12-02 20:08:32,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:32,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 20:08:32,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:32,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 20:08:33,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:33,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 195 [2023-12-02 20:08:33,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:33,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 185 [2023-12-02 20:08:33,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:33,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 162 [2023-12-02 20:08:33,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:33,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 176 [2023-12-02 20:08:39,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:39,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-02 20:08:41,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:41,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-02 20:08:47,372 WARN L293 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 11 DAG size of output: 4 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 20:08:47,372 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2023-12-02 20:08:47,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 64 [2023-12-02 20:08:56,496 WARN L293 SmtUtils]: Spent 9.09s on a formula simplification. DAG size of input: 45 DAG size of output: 1 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 20:08:56,496 INFO L349 Elim1Store]: treesize reduction 97, result has 1.0 percent of original size [2023-12-02 20:08:56,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 1 [2023-12-02 20:08:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:08:56,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292445107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:08:56,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 20:08:56,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 16 [2023-12-02 20:08:56,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507765048] [2023-12-02 20:08:56,698 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 20:08:56,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 20:08:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 20:08:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 20:08:56,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=152, Unknown=3, NotChecked=78, Total=272 [2023-12-02 20:08:56,700 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:08:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:08:57,361 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-12-02 20:08:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:08:57,365 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 20:08:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:08:57,365 INFO L225 Difference]: With dead ends: 37 [2023-12-02 20:08:57,365 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 20:08:57,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=278, Unknown=3, NotChecked=108, Total=462 [2023-12-02 20:08:57,366 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 20:08:57,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 64 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 105 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2023-12-02 20:08:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 20:08:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-12-02 20:08:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:08:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-12-02 20:08:57,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-12-02 20:08:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:08:57,370 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-12-02 20:08:57,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:08:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-12-02 20:08:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 20:08:57,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:08:57,371 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:08:57,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-02 20:08:57,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 20:08:57,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 20:08:57,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:08:57,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:08:57,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:08:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1908211058, now seen corresponding path program 3 times [2023-12-02 20:08:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 20:08:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359116638] [2023-12-02 20:08:57,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:08:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:08:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 20:08:57,974 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:08:57,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 20:08:58,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 20:08:58,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:08:58,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 20:08:58,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:08:58,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:08:58,182 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 20:08:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 20:08:58,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:08:58,354 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:08:58,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 20:08:58,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:08:58,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:08:58,397 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 20:08:58,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 20:08:58,431 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 20:08:58,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 20:08:58,593 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-12-02 20:08:58,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 147 [2023-12-02 20:08:58,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 124 [2023-12-02 20:08:58,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-02 20:08:58,815 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-12-02 20:08:58,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 136 [2023-12-02 20:08:58,845 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2023-12-02 20:08:58,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 148 [2023-12-02 20:08:58,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-12-02 20:08:58,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-12-02 20:08:58,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2023-12-02 20:08:59,064 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-12-02 20:08:59,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 56 [2023-12-02 20:08:59,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2023-12-02 20:08:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:08:59,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:08:59,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:59,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2023-12-02 20:08:59,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:08:59,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2023-12-02 20:09:02,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:02,636 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 197 treesize of output 191 [2023-12-02 20:09:03,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:03,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1228 treesize of output 1241 [2023-12-02 20:09:03,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:03,297 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 576 treesize of output 540 [2023-12-02 20:09:03,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 531 treesize of output 495 [2023-12-02 20:09:03,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 495 treesize of output 459 [2023-12-02 20:09:04,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:09:04,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:09:05,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:09:05,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:09:05,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 325 [2023-12-02 20:09:05,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:09:05,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:09:06,094 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 358 treesize of output 322 [2023-12-02 20:09:06,109 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 21 treesize of output 3 [2023-12-02 20:09:06,161 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 21 treesize of output 3 [2023-12-02 20:09:06,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 [2023-12-02 20:09:06,290 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 181 treesize of output 145 [2023-12-02 20:09:06,324 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 21 treesize of output 3 [2023-12-02 20:09:06,388 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 358 treesize of output 322 [2023-12-02 20:09:06,403 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 21 treesize of output 3 [2023-12-02 20:09:06,453 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 21 treesize of output 3 [2023-12-02 20:09:07,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:07,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 528 treesize of output 577 [2023-12-02 20:09:09,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 145 [2023-12-02 20:09:09,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:09,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 528 treesize of output 577 [2023-12-02 20:09:11,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:09:11,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 181 treesize of output 145 [2023-12-02 20:09:11,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 142 [2023-12-02 20:09:11,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:09:12,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:09:12,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:09:12,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:09:13,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:09:13,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:09:13,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:09:13,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 91 [2023-12-02 20:09:13,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2023-12-02 20:09:13,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2023-12-02 20:09:14,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2023-12-02 20:09:18,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse1 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse0 (_ bv0 32)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0)))) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse5 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store .cse4 .cse5 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse4 .cse5 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse7 (select (select (store .cse6 .cse5 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse6 .cse5 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse7) (= .cse7 (_ bv0 32)) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse5)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_37 .cse3))) (or (= |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_38) .cse8 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse8 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse8)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse9 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse9 .cse10)) (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse10 (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse9)))))) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_291 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse11 (select (select (store .cse12 v_arrayElimCell_270 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_292 (_ bv4 32)) (_ bv0 32))) (= .cse11 (select (select (store .cse12 v_arrayElimCell_270 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_270))) (= .cse11 (select (select (store .cse12 v_arrayElimCell_270 v_prenex_291) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse11 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse14 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store .cse13 .cse14 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse13 .cse14 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse16 (select (select (store .cse15 .cse14 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse15 .cse14 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse15 .cse14 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse16 (_ bv0 32)) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse14)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_290 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (or (= (select (select (store .cse17 .cse18 v_prenex_290) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (= (select (select (store .cse17 .cse18 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse17 .cse18 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_290 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse18 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse18)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_37 .cse3))) (or (= |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_38) .cse19 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse19 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20)) (= .cse20 (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse19)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse22 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= .cse21 (_ bv0 32)) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse22 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse22)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse23 (select (select (store .cse24 .cse25 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse23)) (= .cse23 (_ bv0 32)) (= (select (select (store .cse24 .cse25 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse23))))) (= |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_38) .cse25 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse25)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse28 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse26 (select (select (store .cse27 .cse28 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 (select (select (store .cse27 .cse28 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse26 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (not (= (select v_prenex_245 (_ bv4 32)) (_ bv0 32))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse29 .cse28 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse29 .cse28 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse28)))))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_273 (_ BitVec 32)) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_291 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse31 (select (select (store .cse30 v_arrayElimCell_273 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store .cse30 v_arrayElimCell_273 v_prenex_291) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31) (not (= (select v_prenex_292 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_273))) (= (_ bv0 32) .cse31) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse31) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse33 (select v_arrayElimArr_37 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse32 .cse33 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse34 (select (select (store .cse35 .cse33 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 (select (select (store .cse35 .cse33 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse34 (select (select (store .cse35 .cse33 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse34 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (not (= (select v_prenex_245 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse32 .cse33 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse33)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_291 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse36 v_prenex_291) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_291 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse36 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse36)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_37 .cse3))) (or (= |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_38) .cse37 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse38 (select (select (store .cse40 .cse37 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select (select (store .cse40 .cse37 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse39 (_ bv0 32)) (= .cse38 .cse39)))))))) (not (= (_ bv0 1) (select |c_#valid| .cse37)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select v_arrayElimArr_37 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse41))) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse42 (select (select (store .cse43 .cse41 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse41 .cse42)) (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse42 (_ bv0 32)) (= (select (select (store .cse43 .cse41 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse42)))))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse44 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse44 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse44)))))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) v_arrayElimCell_272 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_292 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_272))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse45) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (= (_ bv0 32) .cse45)))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_291 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (or (= (select (select (store .cse46 .cse47 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse46 .cse47 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (_ bv0 32) (select (select (store .cse46 .cse47 v_prenex_291) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_291 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse47 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse47)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse49 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse48 .cse49 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 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_38) .cse49 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store .cse48 .cse49 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse50)) (= .cse50 (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse49)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse52 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (or (= (select (select (store .cse51 .cse52 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse51 .cse52 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse51 .cse52 v_prenex_244) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_244 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse52 (select (select (store .cse53 .cse52 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse53 .cse52 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse52)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse55 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= .cse54 (_ bv0 32)) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse55 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse55)))))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse56 (select (select (store .cse57 .cse58 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse56 (_ bv0 32)) (= (select (select (store .cse57 .cse58 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse56) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse56))))) (not (= (_ bv0 1) (select |c_#valid| .cse58)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse60 (select v_arrayElimArr_37 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse59 .cse60 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse61 (select (select (store .cse62 .cse60 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse61 (select (select (store .cse62 .cse60 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse61 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (not (= (select v_prenex_245 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse59 .cse60 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse60)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_37 .cse3))) (or (= |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_38) .cse63 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse64 (select (select (store .cse65 .cse63 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse64 (_ bv0 32)) (= (select (select (store .cse65 .cse63 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse64))))) (not (= (_ bv0 1) (select |c_#valid| .cse63)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse66 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse66 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (not (= (select v_prenex_245 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse67 .cse66 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse67 .cse66 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse66)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse69 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse69 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= .cse68 (_ bv0 32)) (= .cse68 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse70 .cse69 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse70 .cse69 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse69)))))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse71 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse71 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse72 .cse71 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse72 .cse71 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse71)))))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse74 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse73 .cse74 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |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_38) .cse74 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse73 .cse74 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse74)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse75 (select (select (store .cse77 .cse78 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse76 (select (select (store .cse77 .cse78 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse75 (_ bv0 32)) (= .cse76 .cse75) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse75) (= .cse76 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse78)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse81 (select (select (store .cse79 .cse80 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store .cse79 .cse80 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse81) (not (= (select v_prenex_246 (_ bv4 32)) (_ bv0 32))) (= .cse81 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse81 (_ bv0 32)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 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_37) .cse80 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse80)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse82 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse82 (select (select (store .cse83 .cse82 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse83 .cse82 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (or (= (select (select (store .cse84 .cse82 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse84 .cse82 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse84 .cse82 v_prenex_244) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_244 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse82)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse85 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse86 (select (select (store .cse87 .cse85 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= .cse86 (select (select (store .cse87 .cse85 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse86 (_ bv0 32)) (= .cse86 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse85)))))) (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse88 (select (select (store .cse89 v_arrayElimCell_271 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_292 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_271))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse88) (= .cse88 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (= (select (select (store .cse89 v_arrayElimCell_271 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse88))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse90 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse90 v_prenex_244) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_244 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse90 (select (select (store .cse91 .cse90 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse91 .cse90 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse90)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse93 (select (select (store .cse95 .cse92 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse94 (select (select (store .cse95 .cse92 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse92 .cse93)) (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse93 (_ bv0 32)) (= .cse94 .cse93) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse92)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse96 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse96 .cse97)) (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse97 (_ bv0 32)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse97)))) (not (= (_ bv0 1) (select |c_#valid| .cse96)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse98 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_290 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse98 v_prenex_290) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_290 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse98 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse98 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse98)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse100 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_246 (_ bv4 32)) (_ bv0 32))) (= .cse99 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse99 (_ bv0 32))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 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_37) .cse100 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse100)))))))) is different from false [2023-12-02 20:09:20,522 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse1 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse0 (_ bv0 32)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0)))) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse5 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store .cse4 .cse5 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse4 .cse5 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse7 (select (select (store .cse6 .cse5 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse6 .cse5 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse7) (= .cse7 (_ bv0 32)) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse5)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_37 .cse3))) (or (= |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_38) .cse8 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse8 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse8)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse9 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse9 .cse10)) (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse10 (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse9)))))) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_291 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse11 (select (select (store .cse12 v_arrayElimCell_270 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_292 (_ bv4 32)) (_ bv0 32))) (= .cse11 (select (select (store .cse12 v_arrayElimCell_270 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_270))) (= .cse11 (select (select (store .cse12 v_arrayElimCell_270 v_prenex_291) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse11 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse14 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store .cse13 .cse14 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse13 .cse14 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse16 (select (select (store .cse15 .cse14 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse15 .cse14 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse15 .cse14 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse16 (_ bv0 32)) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse14)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_290 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (or (= (select (select (store .cse17 .cse18 v_prenex_290) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (= (select (select (store .cse17 .cse18 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse17 .cse18 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_290 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse18 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse18)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_37 .cse3))) (or (= |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_38) .cse19 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse19 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20)) (= .cse20 (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse19)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse22 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= .cse21 (_ bv0 32)) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse22 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse22)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse23 (select (select (store .cse24 .cse25 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse23)) (= .cse23 (_ bv0 32)) (= (select (select (store .cse24 .cse25 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse23))))) (= |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_38) .cse25 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse25)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse28 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse26 (select (select (store .cse27 .cse28 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 (select (select (store .cse27 .cse28 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse26 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (not (= (select v_prenex_245 (_ bv4 32)) (_ bv0 32))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse29 .cse28 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse29 .cse28 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse28)))))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_273 (_ BitVec 32)) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_291 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse31 (select (select (store .cse30 v_arrayElimCell_273 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store .cse30 v_arrayElimCell_273 v_prenex_291) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31) (not (= (select v_prenex_292 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_273))) (= (_ bv0 32) .cse31) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse31) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse33 (select v_arrayElimArr_37 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse32 .cse33 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse34 (select (select (store .cse35 .cse33 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 (select (select (store .cse35 .cse33 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse34 (select (select (store .cse35 .cse33 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse34 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (not (= (select v_prenex_245 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse32 .cse33 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse33)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_291 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse36 v_prenex_291) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_291 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse36 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse36)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_37 .cse3))) (or (= |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_38) .cse37 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse38 (select (select (store .cse40 .cse37 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select (select (store .cse40 .cse37 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse39 (_ bv0 32)) (= .cse38 .cse39)))))))) (not (= (_ bv0 1) (select |c_#valid| .cse37)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select v_arrayElimArr_37 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse41))) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse42 (select (select (store .cse43 .cse41 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse41 .cse42)) (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse42 (_ bv0 32)) (= (select (select (store .cse43 .cse41 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse42)))))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse44 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse44 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse44)))))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) v_arrayElimCell_272 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_292 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_272))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse45) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (= (_ bv0 32) .cse45)))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_291 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (or (= (select (select (store .cse46 .cse47 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse46 .cse47 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (_ bv0 32) (select (select (store .cse46 .cse47 v_prenex_291) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_prenex_291 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse47 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse47)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse49 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse48 .cse49 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 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_38) .cse49 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store .cse48 .cse49 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse50)) (= .cse50 (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse49)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse52 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (or (= (select (select (store .cse51 .cse52 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse51 .cse52 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse51 .cse52 v_prenex_244) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_244 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse52 (select (select (store .cse53 .cse52 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse53 .cse52 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse52)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse55 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= .cse54 (_ bv0 32)) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse55 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse55)))))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse56 (select (select (store .cse57 .cse58 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse56 (_ bv0 32)) (= (select (select (store .cse57 .cse58 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse56) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse56))))) (not (= (_ bv0 1) (select |c_#valid| .cse58)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse60 (select v_arrayElimArr_37 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse59 .cse60 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse61 (select (select (store .cse62 .cse60 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse61 (select (select (store .cse62 .cse60 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse61 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (not (= (select v_prenex_245 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse59 .cse60 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse60)))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_37 .cse3))) (or (= |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_38) .cse63 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse64 (select (select (store .cse65 .cse63 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse64 (_ bv0 32)) (= (select (select (store .cse65 .cse63 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse64))))) (not (= (_ bv0 1) (select |c_#valid| .cse63)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse66 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse66 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (not (= (select v_prenex_245 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse67 .cse66 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse67 .cse66 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse66)))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse69 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse69 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= .cse68 (_ bv0 32)) (= .cse68 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse70 .cse69 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse70 .cse69 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse69)))))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse71 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse71 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse72 .cse71 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse72 .cse71 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse71)))))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_19 (_ bv4 32)) (_ bv0 32))) (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse74 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse73 .cse74 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |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_38) .cse74 v_prenex_19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse73 .cse74 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse74)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse75 (select (select (store .cse77 .cse78 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse76 (select (select (store .cse77 .cse78 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse75 (_ bv0 32)) (= .cse76 .cse75) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse75) (= .cse76 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse78)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse81 (select (select (store .cse79 .cse80 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store .cse79 .cse80 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse81) (not (= (select v_prenex_246 (_ bv4 32)) (_ bv0 32))) (= .cse81 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse81 (_ bv0 32)))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 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_37) .cse80 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse80)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse82 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse82 (select (select (store .cse83 .cse82 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse83 .cse82 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_245 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (or (= (select (select (store .cse84 .cse82 v_prenex_245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse84 .cse82 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse84 .cse82 v_prenex_244) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_244 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse82)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse85 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse86 (select (select (store .cse87 .cse85 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_36 (_ bv4 32)) (_ bv0 32))) (= .cse86 (select (select (store .cse87 .cse85 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse86 (_ bv0 32)) (= .cse86 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse85)))))) (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_prenex_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38))) (let ((.cse88 (select (select (store .cse89 v_arrayElimCell_271 v_prenex_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_292 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_271))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse88) (= .cse88 (_ bv0 32)) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))) (= (select (select (store .cse89 v_arrayElimCell_271 v_arrayElimArr_36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse88))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37)) (.cse90 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse90 v_prenex_244) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_244 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse90 (select (select (store .cse91 .cse90 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse91 .cse90 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse90)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37))) (let ((.cse93 (select (select (store .cse95 .cse92 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse94 (select (select (store .cse95 .cse92 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse92 .cse93)) (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse93 (_ bv0 32)) (= .cse94 .cse93) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse92)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse96 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse96 .cse97)) (not (= (select v_prenex_21 (_ bv4 32)) (_ bv0 32))) (= .cse97 (_ bv0 32)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse97)))) (not (= (_ bv0 1) (select |c_#valid| .cse96)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse98 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_290 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse98 v_prenex_290) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_290 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 32))))) (forall ((v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse98 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse98 v_arrayElimArr_35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_35 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse98)))))) (forall ((v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select v_arrayElimArr_37 .cse3))) (or (forall ((v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse100 v_prenex_246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_prenex_246 (_ bv4 32)) (_ bv0 32))) (= .cse99 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse99 (_ bv0 32))))) (not (= (select v_arrayElimArr_38 .cse3) (_ bv0 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_37) .cse100 v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| .cse100)))))))) is different from true [2023-12-02 20:09:29,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:29,226 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 71 treesize of output 61 [2023-12-02 20:09:29,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:29,368 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 270 treesize of output 209 [2023-12-02 20:09:29,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:29,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:09:29,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:29,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 154 [2023-12-02 20:09:29,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:29,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 162 [2023-12-02 20:09:30,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:30,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 56 treesize of output 54 [2023-12-02 20:09:30,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 42 [2023-12-02 20:09:30,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:30,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-02 20:09:32,495 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:32,496 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 1318 treesize of output 1 [2023-12-02 20:09:32,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:32,556 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 35 treesize of output 36 [2023-12-02 20:09:32,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:32,759 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 293 treesize of output 190 [2023-12-02 20:09:33,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:33,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-12-02 20:09:33,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:33,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 38 treesize of output 38 [2023-12-02 20:09:33,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:33,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-12-02 20:09:33,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:33,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-12-02 20:09:33,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:33,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 97 [2023-12-02 20:09:34,839 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:34,840 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 1510 treesize of output 1 [2023-12-02 20:09:34,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:34,979 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 255 treesize of output 200 [2023-12-02 20:09:35,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:35,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:09:35,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:35,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:09:35,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:09:35,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:35,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:09:35,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:35,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 39 treesize of output 37 [2023-12-02 20:09:35,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:35,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 63 [2023-12-02 20:09:36,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:36,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 20:09:36,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:36,439 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 245 treesize of output 190 [2023-12-02 20:09:36,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:36,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:09:36,631 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:09:36,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:36,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:09:37,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:37,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-12-02 20:09:37,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:37,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 63 [2023-12-02 20:09:37,659 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:37,659 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 1545 treesize of output 1 [2023-12-02 20:09:37,694 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:09:37,694 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 149 treesize of output 1 [2023-12-02 20:09:37,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:37,843 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 266 treesize of output 205 [2023-12-02 20:09:37,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:37,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 20:09:38,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:38,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:09:38,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:09:38,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:38,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-12-02 20:09:38,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:38,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 82 [2023-12-02 20:09:38,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:38,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 35 treesize of output 33 [2023-12-02 20:09:39,451 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:39,451 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 1283 treesize of output 1 [2023-12-02 20:09:39,515 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:39,516 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 1205 treesize of output 1 [2023-12-02 20:09:39,576 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:39,577 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 3132 treesize of output 1 [2023-12-02 20:09:39,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:39,637 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 72 treesize of output 62 [2023-12-02 20:09:39,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:39,837 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 319 treesize of output 210 [2023-12-02 20:09:40,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:40,069 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 326 treesize of output 307 [2023-12-02 20:09:40,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:40,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 95 [2023-12-02 20:09:40,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:40,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 155 [2023-12-02 20:09:40,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:40,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-12-02 20:09:40,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:40,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-02 20:09:41,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:41,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 97 [2023-12-02 20:09:41,615 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 103 treesize of output 73 [2023-12-02 20:09:41,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:41,791 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 257 treesize of output 244 [2023-12-02 20:09:41,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:41,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 167 [2023-12-02 20:09:42,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:42,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 159 treesize of output 141 [2023-12-02 20:09:43,796 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:43,797 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 2115 treesize of output 1 [2023-12-02 20:09:43,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:43,853 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 82 treesize of output 72 [2023-12-02 20:09:43,882 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 78 treesize of output 54 [2023-12-02 20:09:44,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:44,058 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 358 treesize of output 339 [2023-12-02 20:09:44,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:44,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 118 [2023-12-02 20:09:44,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:44,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 79 [2023-12-02 20:09:46,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:46,609 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 493 treesize of output 342 [2023-12-02 20:09:46,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:46,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-12-02 20:09:46,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:46,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2023-12-02 20:09:46,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:09:47,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:47,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-12-02 20:09:47,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:47,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 147 treesize of output 131 [2023-12-02 20:09:47,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:47,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2023-12-02 20:09:48,438 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:09:48,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 1 [2023-12-02 20:09:48,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:48,596 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 288 treesize of output 197 [2023-12-02 20:09:48,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:48,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:09:48,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:48,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 135 [2023-12-02 20:09:48,847 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:09:49,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:49,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:09:49,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:49,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 112 [2023-12-02 20:09:49,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:49,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2023-12-02 20:09:50,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:50,110 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 321 treesize of output 254 [2023-12-02 20:09:50,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:50,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 59 treesize of output 55 [2023-12-02 20:09:50,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:50,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2023-12-02 20:09:51,451 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:09:51,452 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 173 treesize of output 1 [2023-12-02 20:09:51,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:51,620 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 301 treesize of output 234 [2023-12-02 20:09:51,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:51,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 20:09:51,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:09:51,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:51,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2023-12-02 20:09:52,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:52,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:09:52,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:52,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 89 [2023-12-02 20:09:52,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:52,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-02 20:09:53,705 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:09:53,706 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 184 treesize of output 1 [2023-12-02 20:09:53,745 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:09:53,746 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 103 treesize of output 1 [2023-12-02 20:09:53,787 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:09:53,787 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 138 treesize of output 1 [2023-12-02 20:09:53,871 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:53,872 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 1606 treesize of output 1 [2023-12-02 20:09:53,958 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:53,959 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 2891 treesize of output 1 [2023-12-02 20:09:54,020 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:54,021 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 2353 treesize of output 1 [2023-12-02 20:09:54,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:54,191 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 492 treesize of output 341 [2023-12-02 20:09:54,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:54,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:09:54,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:54,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2023-12-02 20:09:54,466 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:09:54,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:54,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:09:54,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2023-12-02 20:09:55,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:55,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 104 [2023-12-02 20:09:55,868 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:55,868 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 1272 treesize of output 1 [2023-12-02 20:09:55,928 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:55,929 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 2126 treesize of output 1 [2023-12-02 20:09:55,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:55,996 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 71 treesize of output 61 [2023-12-02 20:09:56,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:56,202 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 318 treesize of output 209 [2023-12-02 20:09:56,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:56,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:09:56,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:56,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 154 [2023-12-02 20:09:56,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:56,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 162 [2023-12-02 20:09:56,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:56,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2023-12-02 20:09:56,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 50 treesize of output 42 [2023-12-02 20:09:57,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:57,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-02 20:09:59,032 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:09:59,032 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 138 treesize of output 1 [2023-12-02 20:09:59,091 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:09:59,091 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 1307 treesize of output 1 [2023-12-02 20:09:59,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:59,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2023-12-02 20:09:59,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 67 treesize of output 49 [2023-12-02 20:09:59,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:59,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 298 [2023-12-02 20:09:59,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:59,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 113 [2023-12-02 20:09:59,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:09:59,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2023-12-02 20:10:00,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:00,062 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 71 treesize of output 61 [2023-12-02 20:10:00,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:00,263 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 270 treesize of output 209 [2023-12-02 20:10:00,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:10:00,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:00,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:10:00,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:00,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:10:00,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:00,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2023-12-02 20:10:00,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:00,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-02 20:10:01,441 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:10:01,442 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 107 treesize of output 1 [2023-12-02 20:10:01,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:01,609 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 527 treesize of output 370 [2023-12-02 20:10:01,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:01,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 20:10:01,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:10:01,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:01,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:10:02,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:02,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2023-12-02 20:10:02,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:02,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 120 [2023-12-02 20:10:02,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:02,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2023-12-02 20:10:03,391 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:10:03,392 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 1606 treesize of output 1 [2023-12-02 20:10:35,387 WARN L293 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 344 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:10:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 20:10:46,305 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 20:10:46,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359116638] [2023-12-02 20:10:46,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359116638] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:10:46,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980547236] [2023-12-02 20:10:46,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:10:46,306 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 20:10:46,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 20:10:46,308 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 20:10:46,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 20:10:46,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 20:10:46,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:10:46,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 20:10:46,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:10:46,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:10:47,094 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 20:10:47,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 20:10:47,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:10:48,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:10:49,132 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:10:49,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 20:10:49,370 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 20:10:49,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 20:10:49,677 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 20:10:49,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 20:10:49,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:10:50,961 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-02 20:10:50,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 89 [2023-12-02 20:10:51,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-02 20:10:51,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-02 20:10:52,903 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-12-02 20:10:52,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2023-12-02 20:10:52,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-02 20:10:53,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 20:10:53,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:10:53,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2023-12-02 20:10:53,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 16 treesize of output 15 [2023-12-02 20:10:54,847 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:10:54,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2023-12-02 20:10:54,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 20:10:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:10:55,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:10:55,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:55,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2023-12-02 20:10:55,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:10:55,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2023-12-02 20:10:56,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_649 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_63 .cse0) (_ bv0 32))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_649) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) .cse2) (_ bv1 32)))) (not (= (select v_arrayElimArr_64 .cse0) (_ bv0 32))) (= .cse2 (_ bv0 32))))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_649 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_63 .cse0) (_ bv0 32))) (= .cse3 (_ bv0 32)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_649) .cse3) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (_ bv1 32))))) (not (= (select v_arrayElimArr_64 .cse0) (_ bv0 32))))))) is different from false [2023-12-02 20:11:04,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:11:04,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 191 [2023-12-02 20:11:04,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:11:04,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 632 treesize of output 681 [2023-12-02 20:11:05,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:11:05,061 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 592 treesize of output 556 [2023-12-02 20:11:05,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 511 [2023-12-02 20:11:05,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 511 treesize of output 475 [2023-12-02 20:11:07,980 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 21 treesize of output 3 [2023-12-02 20:11:08,204 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 21 treesize of output 3 [2023-12-02 20:11:13,293 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 160 treesize of output 142 [2023-12-02 20:11:13,600 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 160 treesize of output 142 [2023-12-02 20:11:13,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 3 [2023-12-02 20:11:13,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 21 treesize of output 3 [2023-12-02 20:11:14,000 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 21 treesize of output 3 [2023-12-02 20:11:14,217 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 181 treesize of output 145 [2023-12-02 20:11:14,448 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 160 treesize of output 142 [2023-12-02 20:11:15,080 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 21 treesize of output 3 [2023-12-02 20:11:15,175 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 21 treesize of output 3 [2023-12-02 20:11:15,420 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 160 treesize of output 142 [2023-12-02 20:11:15,662 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 21 treesize of output 3 [2023-12-02 20:11:16,076 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 181 treesize of output 145 [2023-12-02 20:11:17,382 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 160 treesize of output 142 [2023-12-02 20:11:17,611 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 21 treesize of output 3 [2023-12-02 20:11:17,801 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 181 treesize of output 145 [2023-12-02 20:11:18,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:11:18,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 445 treesize of output 494 [2023-12-02 20:11:30,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:11:30,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 643 treesize of output 674 [2023-12-02 20:11:35,825 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 21 treesize of output 3 [2023-12-02 20:11:35,960 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 160 treesize of output 142 [2023-12-02 20:11:36,394 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 21 treesize of output 3 [2023-12-02 20:11:36,485 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 21 treesize of output 3 [2023-12-02 20:11:36,684 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 160 treesize of output 142 [2023-12-02 20:11:37,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:11:37,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 643 treesize of output 674 [2023-12-02 20:11:42,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:11:44,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 [2023-12-02 20:11:44,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:11:45,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:11:54,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2023-12-02 20:11:57,998 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse1 (select (select (store .cse2 .cse3 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse5 (select (select (store .cse2 .cse3 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 .cse1)) (= (select (select (store .cse2 .cse3 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse5) (= .cse1 .cse5))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse6 (select (select (store .cse7 .cse3 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse6 (_ bv0 32)) (= .cse6 (select (select (store .cse7 .cse3 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse3)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse8 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse8 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse9 .cse8 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse8))) (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse8 (select (select (store .cse9 .cse8 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse10 (select (select (store .cse11 .cse12 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse10 (_ bv0 32)) (= .cse10 (select (select (store .cse11 .cse12 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse12))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse14 (select (select (store .cse15 .cse12 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse13 (select (select (store .cse15 .cse12 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 .cse13)) (= .cse14 (select (select (store .cse15 .cse12 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse14 .cse13)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse17 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse16 (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse17)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse19 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse18 .cse19 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse19 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse18 .cse19 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse19)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse20))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse21 (select (select (store .cse22 .cse20 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse21 (_ bv0 32)) (= .cse21 (select (select (store .cse22 .cse20 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= .cse21 .cse20)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse23 (select (select (store .cse24 .cse25 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse23) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse24 .cse25 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse23) (= .cse23 (select (select (store .cse24 .cse25 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse26 (select (select (store .cse27 .cse25 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse26 (_ bv0 32)) (= .cse26 (select (select (store .cse27 .cse25 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse25)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse28 (select (select (store .cse29 .cse30 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse28 (_ bv0 32)) (= .cse28 (select (select (store .cse29 .cse30 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse30))) (forall ((v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse31 (select (select (store .cse32 .cse30 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_971 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse31) (= (select (select (store .cse32 .cse30 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse31)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 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_65) .cse33 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse33 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse33)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse34 (select (select (store .cse35 .cse36 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse34 (_ bv0 32)) (= .cse34 (select (select (store .cse35 .cse36 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse36))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse37 (select (select (store .cse38 .cse36 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 .cse37)) (= (select (select (store .cse38 .cse36 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse37)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse39 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse39))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse40 .cse39 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse41 (select (select (store .cse42 .cse39 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= .cse41 (select (select (store .cse42 .cse39 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_1068 (_ bv4 32)))) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse40 .cse39 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1099 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse43 (select (select (store .cse44 .cse45 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse43) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse44 .cse45 v_prenex_1099) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse43))))) (not (= (_ bv0 1) (select |c_#valid| .cse45))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse45 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse46 (select (select (store .cse47 .cse48 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 .cse46)) (= .cse46 (select (select (store .cse47 .cse48 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse49 (select (select (store .cse50 .cse48 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse49 (_ bv0 32)) (= .cse49 (select (select (store .cse50 .cse48 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse48)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse51 (select (select (store .cse52 .cse53 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse54 (select (select (store .cse52 .cse53 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse51) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse52 .cse53 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse54) (= .cse51 .cse54))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse55 (select (select (store .cse56 .cse53 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse55 (_ bv0 32)) (= .cse55 (select (select (store .cse56 .cse53 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse53)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse57 (select (select (store .cse58 .cse59 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse57 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse57 (_ bv0 32)) (= .cse57 (select (select (store .cse58 .cse59 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse59)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse60 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse60))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse61 .cse60 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_1068 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse60 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse61 .cse60 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse64 (select (select (store .cse62 .cse63 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse62 .cse63 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse64) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse64))))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse63 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse63)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse65))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |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_66) .cse65 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse65 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse66 (select (select (store .cse69 .cse67 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse68 (select (select (store .cse69 .cse67 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse67 .cse68)) (= .cse66 .cse68))))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse67 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse67)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse70 (select (select (store .cse71 .cse72 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse70) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse71 .cse72 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse70))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse73 (select (select (store .cse74 .cse72 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse73 (_ bv0 32)) (= .cse73 (select (select (store .cse74 .cse72 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse72)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse75 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse76 (select (select (store .cse77 .cse75 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse76 (_ bv0 32)) (= .cse76 (select (select (store .cse77 .cse75 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse75)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse78 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse78))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse79 (select (select (store .cse80 .cse78 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse78 .cse79)) (= (select (select (store .cse80 .cse78 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse79)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse81 (select (select (store .cse82 .cse83 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse81 (_ bv0 32)) (= .cse81 (select (select (store .cse82 .cse83 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse83))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse85 (select (select (store .cse87 .cse83 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse84 (select (select (store .cse87 .cse83 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse86 (select (select (store .cse87 .cse83 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse84) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= .cse85 .cse86) (= .cse85 .cse84) (= .cse84 .cse86)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse88 (select (select (store .cse89 .cse90 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse88 (_ bv0 32)) (= .cse88 (select (select (store .cse89 .cse90 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse90))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |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_66) .cse90 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse91 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse91))) (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse91 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse91 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1099 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse94 (select (select (store .cse92 .cse93 v_prenex_1100) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (select (select (store .cse92 .cse93 v_prenex_1099) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse94) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_1100 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse93))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse93 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse95))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse95 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse96 (_ bv0 32)) (not (= .cse96 .cse95)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse98 (select (select (store .cse99 .cse100 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse97 (select (select (store .cse99 .cse100 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse97) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= .cse98 (select (select (store .cse99 .cse100 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse98 .cse97))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse101 (select (select (store .cse102 .cse100 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse101 (_ bv0 32)) (= .cse101 (select (select (store .cse102 .cse100 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse100)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse103 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse103))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse105 (select (select (store .cse104 .cse103 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= (select (select (store .cse104 .cse103 v_prenex_1067) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse105) (= .cse105 (select (select (store .cse104 .cse103 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_1068 (_ bv4 32)))) (= .cse105 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse106 .cse103 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse106 .cse103 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse107 (select (select (store .cse108 .cse109 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse107) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= .cse107 (select (select (store .cse108 .cse109 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse110 (select (select (store .cse111 .cse109 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse110 (_ bv0 32)) (= .cse110 (select (select (store .cse111 .cse109 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse109)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse112))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse112 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse112 v_prenex_1100) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_1100 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse114 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse115 (select (select (store .cse113 .cse114 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= (select (select (store .cse113 .cse114 v_prenex_1067) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse115) (not (= (_ bv0 32) (select v_prenex_1068 (_ bv4 32)))) (= .cse115 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse114))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse116 .cse114 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse116 .cse114 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse117 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse117))) (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse117 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse117 .cse118)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118))))))) (forall ((v_arrayElimCell_530 (_ BitVec 32)) (v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) v_arrayElimCell_530 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_530))) (= .cse119 (_ bv0 32)) (= .cse119 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse123 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse120 (select (select (store .cse122 .cse123 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse121 (select (select (store .cse122 .cse123 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (= .cse120 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse120 .cse121) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse121))))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse123 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse123)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse124 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse124 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse125 .cse124 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse124))) (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse126 (select (select (store .cse125 .cse124 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse124 .cse126)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse126))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse127 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse127))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse128 .cse127 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse130 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse129 (select (select (store .cse130 .cse127 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse129) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse130 .cse127 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse129))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse128 .cse127 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse133 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse131 (select (select (store .cse132 .cse133 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse131 (_ bv0 32)) (= .cse131 (select (select (store .cse132 .cse133 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_971 (_ bv4 32)) (_ bv0 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_66) .cse133 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (= (_ bv0 1) (select |c_#valid| .cse133)))))))) is different from false [2023-12-02 20:12:00,455 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse1 (select (select (store .cse2 .cse3 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse5 (select (select (store .cse2 .cse3 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 .cse1)) (= (select (select (store .cse2 .cse3 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse5) (= .cse1 .cse5))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse6 (select (select (store .cse7 .cse3 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse6 (_ bv0 32)) (= .cse6 (select (select (store .cse7 .cse3 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse3)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse8 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse8 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse9 .cse8 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse8))) (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse8 (select (select (store .cse9 .cse8 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse10 (select (select (store .cse11 .cse12 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse10 (_ bv0 32)) (= .cse10 (select (select (store .cse11 .cse12 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse12))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse14 (select (select (store .cse15 .cse12 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse13 (select (select (store .cse15 .cse12 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 .cse13)) (= .cse14 (select (select (store .cse15 .cse12 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse14 .cse13)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse17 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse16 (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse17)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse19 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse18 .cse19 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse19 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse18 .cse19 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse19)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse20))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse21 (select (select (store .cse22 .cse20 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse21 (_ bv0 32)) (= .cse21 (select (select (store .cse22 .cse20 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= .cse21 .cse20)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse23 (select (select (store .cse24 .cse25 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse23) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse24 .cse25 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse23) (= .cse23 (select (select (store .cse24 .cse25 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse26 (select (select (store .cse27 .cse25 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse26 (_ bv0 32)) (= .cse26 (select (select (store .cse27 .cse25 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse25)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse28 (select (select (store .cse29 .cse30 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse28 (_ bv0 32)) (= .cse28 (select (select (store .cse29 .cse30 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse30))) (forall ((v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse31 (select (select (store .cse32 .cse30 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_971 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse31) (= (select (select (store .cse32 .cse30 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse31)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 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_65) .cse33 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse33 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse33)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse34 (select (select (store .cse35 .cse36 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse34 (_ bv0 32)) (= .cse34 (select (select (store .cse35 .cse36 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse36))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse37 (select (select (store .cse38 .cse36 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 .cse37)) (= (select (select (store .cse38 .cse36 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse37)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse39 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse39))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse40 .cse39 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse41 (select (select (store .cse42 .cse39 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= .cse41 (select (select (store .cse42 .cse39 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_1068 (_ bv4 32)))) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse40 .cse39 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1099 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse43 (select (select (store .cse44 .cse45 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse43) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse44 .cse45 v_prenex_1099) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse43))))) (not (= (_ bv0 1) (select |c_#valid| .cse45))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse45 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse46 (select (select (store .cse47 .cse48 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 .cse46)) (= .cse46 (select (select (store .cse47 .cse48 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse49 (select (select (store .cse50 .cse48 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse49 (_ bv0 32)) (= .cse49 (select (select (store .cse50 .cse48 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse48)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse51 (select (select (store .cse52 .cse53 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse54 (select (select (store .cse52 .cse53 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse51) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse52 .cse53 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse54) (= .cse51 .cse54))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse55 (select (select (store .cse56 .cse53 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse55 (_ bv0 32)) (= .cse55 (select (select (store .cse56 .cse53 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse53)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse57 (select (select (store .cse58 .cse59 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse57 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse57 (_ bv0 32)) (= .cse57 (select (select (store .cse58 .cse59 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse59)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse60 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse60))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse61 .cse60 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_1068 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse60 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse61 .cse60 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse64 (select (select (store .cse62 .cse63 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse62 .cse63 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse64) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse64))))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse63 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse63)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse65))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |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_66) .cse65 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse65 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse66 (select (select (store .cse69 .cse67 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse68 (select (select (store .cse69 .cse67 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse67 .cse68)) (= .cse66 .cse68))))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse67 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse67)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse70 (select (select (store .cse71 .cse72 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse70) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse71 .cse72 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse70))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse73 (select (select (store .cse74 .cse72 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse73 (_ bv0 32)) (= .cse73 (select (select (store .cse74 .cse72 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse72)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse75 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse76 (select (select (store .cse77 .cse75 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse76 (_ bv0 32)) (= .cse76 (select (select (store .cse77 .cse75 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse75)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse78 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse78))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse79 (select (select (store .cse80 .cse78 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse78 .cse79)) (= (select (select (store .cse80 .cse78 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse79)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse81 (select (select (store .cse82 .cse83 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse81 (_ bv0 32)) (= .cse81 (select (select (store .cse82 .cse83 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse83))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse85 (select (select (store .cse87 .cse83 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse84 (select (select (store .cse87 .cse83 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse86 (select (select (store .cse87 .cse83 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse84) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= .cse85 .cse86) (= .cse85 .cse84) (= .cse84 .cse86)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse88 (select (select (store .cse89 .cse90 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse88 (_ bv0 32)) (= .cse88 (select (select (store .cse89 .cse90 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse90))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |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_66) .cse90 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse91 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse91))) (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse91 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse91 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1099 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse94 (select (select (store .cse92 .cse93 v_prenex_1100) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (select (select (store .cse92 .cse93 v_prenex_1099) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse94) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_1100 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse93))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse93 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse95))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse95 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse96 (_ bv0 32)) (not (= .cse96 .cse95)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_970 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse98 (select (select (store .cse99 .cse100 v_prenex_970) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse97 (select (select (store .cse99 .cse100 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse97) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= .cse98 (select (select (store .cse99 .cse100 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse98 .cse97))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse101 (select (select (store .cse102 .cse100 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse101 (_ bv0 32)) (= .cse101 (select (select (store .cse102 .cse100 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse100)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse103 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse103))) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse105 (select (select (store .cse104 .cse103 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= (select (select (store .cse104 .cse103 v_prenex_1067) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse105) (= .cse105 (select (select (store .cse104 .cse103 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_1068 (_ bv4 32)))) (= .cse105 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse106 .cse103 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse106 .cse103 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse107 (select (select (store .cse108 .cse109 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse107) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= .cse107 (select (select (store .cse108 .cse109 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse110 (select (select (store .cse111 .cse109 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse110 (_ bv0 32)) (= .cse110 (select (select (store .cse111 .cse109 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse109)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse112))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse112 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse112 v_prenex_1100) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_1100 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse114 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse115 (select (select (store .cse113 .cse114 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (= (select (select (store .cse113 .cse114 v_prenex_1067) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse115) (not (= (_ bv0 32) (select v_prenex_1068 (_ bv4 32)))) (= .cse115 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse114))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse116 .cse114 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse116 .cse114 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse117 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse117))) (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65) .cse117 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse117 .cse118)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118))))))) (forall ((v_arrayElimCell_530 (_ BitVec 32)) (v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) v_arrayElimCell_530 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_530))) (= .cse119 (_ bv0 32)) (= .cse119 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse123 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse120 (select (select (store .cse122 .cse123 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse121 (select (select (store .cse122 .cse123 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (= .cse120 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse120 .cse121) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse121))))) (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse123 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse123)))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse124 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_prenex_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_636 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66) .cse124 v_prenex_636) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse125 .cse124 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse124))) (forall ((v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse126 (select (select (store .cse125 .cse124 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_prenex_635 (_ bv4 32)) (_ bv0 32))) (not (= .cse124 .cse126)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse126))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65)) (.cse127 (select v_arrayElimArr_65 .cse0))) (or (not (= (_ bv0 1) (select |c_#valid| .cse127))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse128 .cse127 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (forall ((v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse130 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_66))) (let ((.cse129 (select (select (store .cse130 .cse127 v_arrayElimArr_64) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse129) (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_64 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse130 .cse127 v_prenex_1068) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse129))))) (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store .cse128 .cse127 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv0 32)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse133 (select v_arrayElimArr_65 .cse0))) (or (forall ((v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_65))) (let ((.cse131 (select (select (store .cse132 .cse133 v_arrayElimArr_63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse131 (_ bv0 32)) (= .cse131 (select (select (store .cse132 .cse133 v_prenex_635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_63 (_ bv4 32)) (_ bv0 32))))))) (forall ((v_prenex_971 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_66 .cse0) (_ bv0 32))) (not (= (select v_prenex_971 (_ bv4 32)) (_ bv0 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_66) .cse133 v_prenex_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (= (_ bv0 1) (select |c_#valid| .cse133)))))))) is different from true [2023-12-02 20:12:11,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:11,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 65 [2023-12-02 20:12:11,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:11,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 20:12:12,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:12,205 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 479 treesize of output 442 [2023-12-02 20:12:12,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:12:12,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2023-12-02 20:12:12,468 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 20:12:12,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-12-02 20:12:12,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:12: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 129 treesize of output 101 [2023-12-02 20:12:12,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:12,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 83 [2023-12-02 20:12:12,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:12,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-12-02 20:12:12,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-12-02 20:12:13,085 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:13,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2023-12-02 20:12:13,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:13,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 20:12:13,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:13,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 175 [2023-12-02 20:12:13,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:13,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 166 treesize of output 156 [2023-12-02 20:12:13,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:13,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 102 [2023-12-02 20:12:15,362 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:15,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 20:12:15,419 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:15,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 20:12:15,431 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:15,486 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:15,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 20:12:15,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:15,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:15,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:15,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:15,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:15,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:15,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:12:16,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:16,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-12-02 20:12:16,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:16,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-12-02 20:12:16,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:16,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 39 treesize of output 37 [2023-12-02 20:12:16,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:16,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 56 [2023-12-02 20:12:19,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:19,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:19,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:19,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 20:12:19,671 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:19,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:19,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:12:20,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:20,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 20 treesize of output 20 [2023-12-02 20:12:20,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:20,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 298 [2023-12-02 20:12:20,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:20,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-12-02 20:12:21,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:21,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 125 treesize of output 105 [2023-12-02 20:12:21,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-12-02 20:12:22,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:22,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:22,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:22,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 20:12:22,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:22,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2023-12-02 20:12:22,892 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:23,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:23,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-12-02 20:12:23,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:23,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 86 [2023-12-02 20:12:23,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:23,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2023-12-02 20:12:23,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:23,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 56 treesize of output 54 [2023-12-02 20:12:25,626 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:25,704 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:25,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 20:12:25,715 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:25,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:25,789 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 51 treesize of output 41 [2023-12-02 20:12:26,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:26,093 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 269 treesize of output 250 [2023-12-02 20:12:26,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:26,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:12:26,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:26,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2023-12-02 20:12:27,460 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:27,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 1 [2023-12-02 20:12:27,513 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:27,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2023-12-02 20:12:27,614 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:27,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 20:12:27,626 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:27,680 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:27,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 20:12:27,756 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:27,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 20:12:27,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:27,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:27,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:27,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 20:12:28,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:28,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-12-02 20:12:28,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:28,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:28,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2023-12-02 20:12:28,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:28,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:12:29,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:29,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 39 treesize of output 37 [2023-12-02 20:12:29,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:29,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 81 [2023-12-02 20:12:30,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:30,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:31,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:31,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:31,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:31,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-12-02 20:12:31,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:31,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:12:31,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:31,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:31,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:12:32,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:32,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2023-12-02 20:12:32,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:32,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 35 treesize of output 33 [2023-12-02 20:12:33,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:33,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:33,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:33,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 20:12:33,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:33,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-12-02 20:12:33,635 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:33,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:33,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:12:34,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:34,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-02 20:12:34,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:34,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2023-12-02 20:12:34,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:34,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-02 20:12:35,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:35,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:35,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:35,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-12-02 20:12:35,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:35,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2023-12-02 20:12:35,941 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:36,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:36,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2023-12-02 20:12:36,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:36,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 93 [2023-12-02 20:12:36,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:36,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2023-12-02 20:12:36,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:36,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2023-12-02 20:12:41,023 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:41,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 140 treesize of output 1 [2023-12-02 20:12:41,034 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:41,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:41,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:41,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:41,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:41,296 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:41,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:41,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:12:41,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:41,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-12-02 20:12:42,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:42,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-12-02 20:12:42,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:42,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-12-02 20:12:42,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:42,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 56 [2023-12-02 20:12:43,629 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:43,639 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:43,708 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:43,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 1 [2023-12-02 20:12:43,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:43,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2023-12-02 20:12:44,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:44,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 298 [2023-12-02 20:12:44,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:44,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2023-12-02 20:12:44,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:44,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 97 [2023-12-02 20:12:46,223 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:46,234 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:46,246 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:46,257 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 20:12:46,300 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:46,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2023-12-02 20:12:46,357 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 20:12:46,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-12-02 20:12:46,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:46,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:12:46,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:46,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2023-12-02 20:12:46,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:46,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2023-12-02 20:12:46,984 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:12:47,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:47,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2023-12-02 20:12:47,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:47,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 93 [2023-12-02 20:12:47,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:47,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2023-12-02 20:12:47,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:12:47,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 56 treesize of output 54 [2023-12-02 20:13:11,646 WARN L293 SmtUtils]: Spent 13.01s on a formula simplification. DAG size of input: 242 DAG size of output: 238 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:14:04,844 WARN L293 SmtUtils]: Spent 13.26s on a formula simplification that was a NOOP. DAG size: 331 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:14:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 20:14:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [980547236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:14:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754378386] [2023-12-02 20:14:31,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:14:31,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:14:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:14:31,088 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:14:31,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9060cd5-bbc2-4be3-820e-ea1a5edde98e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 20:14:31,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 20:14:31,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:14:31,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 20:14:31,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:14:31,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:14:32,777 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 20:14:32,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 20:14:33,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:14:33,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 11 treesize of output 7 [2023-12-02 20:14:33,931 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 20:14:33,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 20:14:34,262 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 20:14:34,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 20:14:34,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:14:34,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:14:34,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:14:35,933 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-02 20:14:35,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 79 [2023-12-02 20:14:36,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:14:36,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 20:14:36,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-02 20:14:38,188 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 20:14:38,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2023-12-02 20:14:38,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2023-12-02 20:14:38,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-02 20:14:40,058 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:14:40,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2023-12-02 20:14:40,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:14:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:14:40,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:14:41,160 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_707) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2023-12-02 20:14:41,374 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_702 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (or (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_703 .cse0)) v_ArrVal_703)) (= (_ bv1 32) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_707) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) is different from false [2023-12-02 20:14:41,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:41,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-12-02 20:14:41,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:41,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 266 [2023-12-02 20:14:41,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 190 [2023-12-02 20:14:41,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2023-12-02 20:14:42,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 160 treesize of output 142 [2023-12-02 20:14:42,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-12-02 20:14:42,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimCell_674 (_ BitVec 32)) (v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_702 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_674))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_702) v_arrayElimCell_674 v_ArrVal_706) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_arrayElimArr_104 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_104 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse1))) (forall ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_104) .cse1 v_ArrVal_708) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_104 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_104 .cse2))) (or (forall ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_104) .cse3 v_ArrVal_708) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse3))) (not (= (_ bv0 1) (select |c_#valid| .cse3)))))))) is different from false [2023-12-02 20:14:43,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:43,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 20:14:43,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:43,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 198 [2023-12-02 20:14:43,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:43,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 69 [2023-12-02 20:14:43,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-12-02 20:14:44,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:44,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 20:14:44,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:14:44,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:44,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:14:45,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:45,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-12-02 20:14:45,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:45,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 20:14:45,463 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:14:45,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:14:45,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 20:14:45,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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