./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/tree-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E --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 ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:00:55,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:00:55,531 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:00:55,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:00:55,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:00:55,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:00:55,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:00:55,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:00:55,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:00:55,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:00:55,563 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:00:55,564 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:00:55,564 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:00:55,564 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:00:55,564 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:00:55,564 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:00:55,564 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:00:55,565 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:00:55,565 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:00:55,565 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:00:55,565 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:00:55,565 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:00:55,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:00:55,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:00:55,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:00:55,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:00:55,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:00:55,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:00:55,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:00:55,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:00:55,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:00:55,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:00:55,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:00:55,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:00:55,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:00:55,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:00:55,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:00:55,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:00:55,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:00:55,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:00:55,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:00:55,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:00:55,569 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:00:55,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:00:55,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:00:55,573 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:00:55,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:00:55,573 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E 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 -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2024-11-14 05:00:55,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:00:55,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:00:55,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:00:55,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:00:55,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:00:55,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/heap-manipulation/tree-2.i Unable to find full path for "g++" [2024-11-14 05:00:57,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:00:58,038 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:00:58,039 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/sv-benchmarks/c/heap-manipulation/tree-2.i [2024-11-14 05:00:58,055 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/data/eeeffc246/c04563b95d3b4a6b8c7d23800831da56/FLAG88e97e512 [2024-11-14 05:00:58,070 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/data/eeeffc246/c04563b95d3b4a6b8c7d23800831da56 [2024-11-14 05:00:58,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:00:58,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:00:58,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:00:58,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:00:58,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:00:58,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391300f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58, skipping insertion in model container [2024-11-14 05:00:58,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:00:58,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2024-11-14 05:00:58,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:00:58,437 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:00:58,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2024-11-14 05:00:58,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:00:58,508 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:00:58,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58 WrapperNode [2024-11-14 05:00:58,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:00:58,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:00:58,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:00:58,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:00:58,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,571 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2024-11-14 05:00:58,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:00:58,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:00:58,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:00:58,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:00:58,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:00:58,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:00:58,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:00:58,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:00:58,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (1/1) ... [2024-11-14 05:00:58,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:00:58,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:00:58,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:00:58,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:00:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:00:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-14 05:00:58,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-14 05:00:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:00:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:00:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:00:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:00:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:00:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:00:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:00:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:00:58,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:00:58,819 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:00:58,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:00:59,131 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-14 05:00:59,131 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:00:59,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:00:59,250 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-14 05:00:59,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:00:59 BoogieIcfgContainer [2024-11-14 05:00:59,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:00:59,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:00:59,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:00:59,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:00:59,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:00:58" (1/3) ... [2024-11-14 05:00:59,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87b4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:00:59, skipping insertion in model container [2024-11-14 05:00:59,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:58" (2/3) ... [2024-11-14 05:00:59,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87b4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:00:59, skipping insertion in model container [2024-11-14 05:00:59,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:00:59" (3/3) ... [2024-11-14 05:00:59,262 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-2.i [2024-11-14 05:00:59,280 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:00:59,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-2.i that has 2 procedures, 27 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2024-11-14 05:00:59,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:00:59,363 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@408af0c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:00:59,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:00:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:00:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:00:59,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:00:59,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:00:59,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:00:59,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:00:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1098570353, now seen corresponding path program 1 times [2024-11-14 05:00:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:00:59,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455673432] [2024-11-14 05:00:59,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:00:59,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:00:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:00:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:00:59,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:00:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455673432] [2024-11-14 05:00:59,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455673432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:00:59,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:00:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:00:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622984944] [2024-11-14 05:00:59,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:00:59,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:00:59,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:00:59,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:00:59,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:00:59,559 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:00:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:00:59,634 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2024-11-14 05:00:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:00:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 05:00:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:00:59,643 INFO L225 Difference]: With dead ends: 50 [2024-11-14 05:00:59,644 INFO L226 Difference]: Without dead ends: 21 [2024-11-14 05:00:59,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:00:59,651 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:00:59,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:00:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-14 05:00:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-14 05:00:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:00:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-14 05:00:59,686 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 7 [2024-11-14 05:00:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:00:59,687 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-14 05:00:59,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:00:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-11-14 05:00:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:00:59,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:00:59,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:00:59,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:00:59,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:00:59,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:00:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1772535042, now seen corresponding path program 1 times [2024-11-14 05:00:59,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:00:59,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791243665] [2024-11-14 05:00:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:00:59,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:00:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:00:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:00:59,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:00:59,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791243665] [2024-11-14 05:00:59,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791243665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:00:59,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:00:59,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:00:59,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817394392] [2024-11-14 05:00:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:00:59,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:00:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:00:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:00:59,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:00:59,872 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:00,028 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-14 05:01:00,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:01:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 05:01:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:00,030 INFO L225 Difference]: With dead ends: 41 [2024-11-14 05:01:00,030 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 05:01:00,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:00,031 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:00,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 05:01:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-14 05:01:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-14 05:01:00,039 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 8 [2024-11-14 05:01:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-14 05:01:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-14 05:01:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:01:00,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:00,040 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:00,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:01:00,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:00,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:00,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1574937634, now seen corresponding path program 1 times [2024-11-14 05:01:00,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:00,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370860252] [2024-11-14 05:01:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:00,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:00,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370860252] [2024-11-14 05:01:00,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370860252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:00,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:00,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:00,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686004746] [2024-11-14 05:01:00,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:00,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:00,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:00,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:00,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:00,213 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:00,291 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-14 05:01:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 05:01:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:00,295 INFO L225 Difference]: With dead ends: 41 [2024-11-14 05:01:00,295 INFO L226 Difference]: Without dead ends: 24 [2024-11-14 05:01:00,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:00,297 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:00,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-14 05:01:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-14 05:01:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-14 05:01:00,305 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 10 [2024-11-14 05:01:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:00,305 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-14 05:01:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-14 05:01:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:01:00,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:00,307 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:01:00,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1309038320, now seen corresponding path program 1 times [2024-11-14 05:01:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:00,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214166913] [2024-11-14 05:01:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:00,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:01:00,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:00,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214166913] [2024-11-14 05:01:00,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214166913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:00,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:00,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:01:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797090318] [2024-11-14 05:01:00,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:00,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:01:00,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:01:00,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:00,653 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:00,807 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-11-14 05:01:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:01:00,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 05:01:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:00,808 INFO L225 Difference]: With dead ends: 37 [2024-11-14 05:01:00,808 INFO L226 Difference]: Without dead ends: 34 [2024-11-14 05:01:00,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:00,810 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:00,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 48 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-14 05:01:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2024-11-14 05:01:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-14 05:01:00,815 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 11 [2024-11-14 05:01:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:00,815 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-14 05:01:00,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-14 05:01:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:01:00,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:00,816 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:01:00,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:00,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1733245180, now seen corresponding path program 1 times [2024-11-14 05:01:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:00,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466951266] [2024-11-14 05:01:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:03,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:03,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466951266] [2024-11-14 05:01:03,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466951266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:03,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401945825] [2024-11-14 05:01:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:03,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:03,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:03,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:01:03,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:01:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:03,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-14 05:01:03,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:03,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:01:03,667 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:03,700 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:03,722 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:03,749 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:03,776 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:03,791 INFO L378 Elim1Store]: Elim1 eliminated variable 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 0 case distinctions, treesize of input 1544 treesize of output 1431 [2024-11-14 05:01:03,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:03,806 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:03,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:03,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:03,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:03,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:03,822 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 955 treesize of output 657 [2024-11-14 05:01:03,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:03,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:03,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 234 [2024-11-14 05:01:03,891 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-14 05:01:03,892 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 2 case distinctions, treesize of input 988 treesize of output 841 [2024-11-14 05:01:03,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 182 [2024-11-14 05:01:03,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 219 [2024-11-14 05:01:04,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 186 [2024-11-14 05:01:04,112 INFO L349 Elim1Store]: treesize reduction 102, result has 20.3 percent of original size [2024-11-14 05:01:04,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 255 treesize of output 302 [2024-11-14 05:01:04,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 157 [2024-11-14 05:01:04,205 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:01:04,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 05:01:04,315 INFO L349 Elim1Store]: treesize reduction 107, result has 10.1 percent of original size [2024-11-14 05:01:04,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 710 treesize of output 608 [2024-11-14 05:01:04,436 INFO L349 Elim1Store]: treesize reduction 104, result has 10.3 percent of original size [2024-11-14 05:01:04,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 55 [2024-11-14 05:01:04,515 INFO L349 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2024-11-14 05:01:04,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 55 [2024-11-14 05:01:04,636 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 15 treesize of output 11 [2024-11-14 05:01:04,709 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 15 treesize of output 11 [2024-11-14 05:01:04,749 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 15 treesize of output 11 [2024-11-14 05:01:04,782 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:04,927 INFO L349 Elim1Store]: treesize reduction 60, result has 11.8 percent of original size [2024-11-14 05:01:04,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 23 [2024-11-14 05:01:04,944 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 20 treesize of output 16 [2024-11-14 05:01:04,975 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:04,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1544 treesize of output 1431 [2024-11-14 05:01:04,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:04,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:05,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:05,016 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:05,019 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 955 treesize of output 657 [2024-11-14 05:01:05,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 224 [2024-11-14 05:01:05,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,138 INFO L349 Elim1Store]: treesize reduction 536, result has 0.2 percent of original size [2024-11-14 05:01:05,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 2612 treesize of output 2421 [2024-11-14 05:01:05,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:05,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:05,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:05,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:05,308 WARN L200 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:05,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,361 INFO L349 Elim1Store]: treesize reduction 326, result has 0.3 percent of original size [2024-11-14 05:01:05,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1713 treesize of output 1657 [2024-11-14 05:01:05,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 304 treesize of output 256 [2024-11-14 05:01:05,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:05,475 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 30 treesize of output 1 [2024-11-14 05:01:05,553 INFO L349 Elim1Store]: treesize reduction 668, result has 0.1 percent of original size [2024-11-14 05:01:05,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 3882 treesize of output 3718 [2024-11-14 05:01:05,791 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:05,861 INFO L349 Elim1Store]: treesize reduction 311, result has 0.3 percent of original size [2024-11-14 05:01:05,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 3964 treesize of output 3631 [2024-11-14 05:01:06,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1626 treesize of output 1504 [2024-11-14 05:01:06,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1536 treesize of output 1408 [2024-11-14 05:01:06,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1115 treesize of output 1033 [2024-11-14 05:01:06,217 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:06,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:06,232 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:06,241 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:01:06,254 INFO L349 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2024-11-14 05:01:06,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 454 treesize of output 456 [2024-11-14 05:01:06,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 191 [2024-11-14 05:01:06,289 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:06,301 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:01:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:06,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:01:06,897 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2024-11-14 05:01:06,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 1230 treesize of output 766 [2024-11-14 05:01:11,782 INFO L349 Elim1Store]: treesize reduction 56, result has 48.1 percent of original size [2024-11-14 05:01:11,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22274 treesize of output 21695 [2024-11-14 05:01:26,240 WARN L286 SmtUtils]: Spent 14.37s on a formula simplification. DAG size of input: 57 DAG size of output: 47 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:01:26,240 INFO L349 Elim1Store]: treesize reduction 50, result has 59.7 percent of original size [2024-11-14 05:01:26,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39289 treesize of output 30383 [2024-11-14 05:01:43,987 WARN L286 SmtUtils]: Spent 17.50s on a formula simplification. DAG size of input: 31 DAG size of output: 15 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:01:43,987 INFO L349 Elim1Store]: treesize reduction 55, result has 26.7 percent of original size [2024-11-14 05:01:43,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 102516 treesize of output 100822 [2024-11-14 05:02:01,189 WARN L286 SmtUtils]: Spent 16.86s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:02:01,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:02:01,192 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 373150 treesize of output 356746 [2024-11-14 05:02:43,350 WARN L286 SmtUtils]: Spent 39.76s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:02:43,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:02:43,366 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 37570511 treesize of output 35438387 [2024-11-14 05:02:57,631 WARN L286 SmtUtils]: Spent 11.98s on a formula simplification. DAG size of input: 810 DAG size of output: 413 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:02:57,632 INFO L349 Elim1Store]: treesize reduction 3100, result has 37.2 percent of original size [2024-11-14 05:02:57,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 231 case distinctions, treesize of input 54545 treesize of output 53262 [2024-11-14 05:03:01,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24081 treesize of output 23199 [2024-11-14 05:03:02,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:03:02,586 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 23393 treesize of output 21691 [2024-11-14 05:03:03,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:03:03,812 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 32317 treesize of output 28323 [2024-11-14 05:03:06,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27161 treesize of output 26301 [2024-11-14 05:03:07,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:03:07,798 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 26327 treesize of output 25251 [2024-11-14 05:03:09,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:03:09,292 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 25342 treesize of output 24370 [2024-11-14 05:03:11,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 6 treesize of output 4 [2024-11-14 05:03:11,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:08:02,168 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 05:08:02,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 05:08:02,169 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 05:08:02,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2063744818] [2024-11-14 05:08:02,185 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 05:08:02,185 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:08:02,188 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:08:02,193 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:08:02,193 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:08:02,217 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-14 05:08:02,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:08:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-14 05:08:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784694087] [2024-11-14 05:08:02,224 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 05:08:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:08:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:08:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:08:02,226 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:02,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:08:02,230 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:02,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:08:02,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:08:02,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:08:02,431 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_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/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:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-14 05:08:02,436 INFO L158 Benchmark]: Toolchain (without parser) took 424361.62ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 118.2MB in the beginning and 1.0GB in the end (delta: -928.8MB). Peak memory consumption was 565.1MB. Max. memory is 16.1GB. [2024-11-14 05:08:02,436 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:08:02,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.04ms. Allocated memory is still 142.6MB. Free memory was 118.0MB in the beginning and 100.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:08:02,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.71ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:08:02,437 INFO L158 Benchmark]: Boogie Preprocessor took 46.90ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:08:02,437 INFO L158 Benchmark]: RCFGBuilder took 631.33ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 71.6MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 05:08:02,438 INFO L158 Benchmark]: TraceAbstraction took 423182.48ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.0MB in the beginning and 1.0GB in the end (delta: -976.0MB). Peak memory consumption was 523.1MB. Max. memory is 16.1GB. [2024-11-14 05:08:02,439 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.28ms. Allocated memory is still 142.6MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.04ms. Allocated memory is still 142.6MB. Free memory was 118.0MB in the beginning and 100.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.71ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.90ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 631.33ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 71.6MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 423182.48ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.0MB in the beginning and 1.0GB in the end (delta: -976.0MB). Peak memory consumption was 523.1MB. 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_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/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_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E --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 ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:08:04,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:08:05,047 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 05:08:05,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:08:05,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:08:05,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:08:05,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:08:05,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:08:05,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:08:05,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:08:05,099 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:08:05,099 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:08:05,099 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:08:05,099 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:08:05,100 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:08:05,100 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:08:05,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:08:05,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:08:05,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:08:05,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:08:05,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:08:05,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:08:05,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:08:05,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:08:05,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:08:05,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:08:05,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:08:05,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:08:05,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:08:05,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:08:05,103 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:08:05,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:08:05,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:08:05,103 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:08:05,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E 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 -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2024-11-14 05:08:05,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:08:05,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:08:05,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:08:05,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:08:05,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:08:05,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/heap-manipulation/tree-2.i Unable to find full path for "g++" [2024-11-14 05:08:07,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:08:07,712 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:08:07,714 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/sv-benchmarks/c/heap-manipulation/tree-2.i [2024-11-14 05:08:07,736 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/data/d5ace3f02/6b92c37d32d94ae58b8e749d9282d852/FLAG9a0bb7eb1 [2024-11-14 05:08:07,757 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/data/d5ace3f02/6b92c37d32d94ae58b8e749d9282d852 [2024-11-14 05:08:07,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:08:07,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:08:07,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:08:07,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:08:07,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:08:07,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:08:07" (1/1) ... [2024-11-14 05:08:07,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d755fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:07, skipping insertion in model container [2024-11-14 05:08:07,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:08:07" (1/1) ... [2024-11-14 05:08:07,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:08:08,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2024-11-14 05:08:08,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:08:08,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:08:08,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2024-11-14 05:08:08,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:08:08,357 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:08:08,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08 WrapperNode [2024-11-14 05:08:08,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:08:08,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:08:08,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:08:08,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:08:08,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,422 INFO L138 Inliner]: procedures = 125, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-11-14 05:08:08,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:08:08,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:08:08,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:08:08,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:08:08,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:08:08,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:08:08,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:08:08,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:08:08,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (1/1) ... [2024-11-14 05:08:08,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:08:08,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:08:08,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:08:08,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:08:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:08:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-14 05:08:08,568 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-14 05:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:08:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:08:08,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:08:08,719 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:08:08,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:08:09,659 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-14 05:08:09,659 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:08:09,672 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:08:09,672 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-14 05:08:09,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:08:09 BoogieIcfgContainer [2024-11-14 05:08:09,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:08:09,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:08:09,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:08:09,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:08:09,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:08:07" (1/3) ... [2024-11-14 05:08:09,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b382971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:08:09, skipping insertion in model container [2024-11-14 05:08:09,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:08" (2/3) ... [2024-11-14 05:08:09,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b382971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:08:09, skipping insertion in model container [2024-11-14 05:08:09,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:08:09" (3/3) ... [2024-11-14 05:08:09,690 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-2.i [2024-11-14 05:08:09,707 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:08:09,710 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-2.i that has 2 procedures, 45 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2024-11-14 05:08:09,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:08:09,785 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3460ec4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:08:09,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:08:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 43 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:08:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:08:09,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:09,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:09,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:08:09,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1247895556, now seen corresponding path program 1 times [2024-11-14 05:08:09,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:08:09,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000445159] [2024-11-14 05:08:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:09,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:09,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:08:09,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:08:09,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 05:08:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:09,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 05:08:09,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:08:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:09,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:08:09,930 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:08:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000445159] [2024-11-14 05:08:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000445159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:08:09,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027018348] [2024-11-14 05:08:09,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:09,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:08:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:08:09,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:08:09,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:08:09,959 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 43 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:09,979 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2024-11-14 05:08:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:08:09,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 05:08:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:09,988 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:08:09,988 INFO L226 Difference]: Without dead ends: 30 [2024-11-14 05:08:09,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:08:09,994 INFO L432 NwaCegarLoop]: 54 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, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:09,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:08:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-14 05:08:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-14 05:08:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-14 05:08:10,031 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 10 [2024-11-14 05:08:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:10,032 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-14 05:08:10,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-14 05:08:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:08:10,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:10,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:10,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 05:08:10,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:10,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:08:10,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1739317625, now seen corresponding path program 1 times [2024-11-14 05:08:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:08:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778477005] [2024-11-14 05:08:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:10,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:10,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:08:10,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:08:10,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 05:08:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:10,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:08:10,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:08:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:10,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:08:10,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:08:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778477005] [2024-11-14 05:08:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778477005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:08:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365671053] [2024-11-14 05:08:10,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:08:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:08:10,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:08:10,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:08:10,482 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:10,604 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-11-14 05:08:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:08:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 05:08:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:10,605 INFO L225 Difference]: With dead ends: 69 [2024-11-14 05:08:10,606 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 05:08:10,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:08:10,607 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:10,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 122 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:08:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 05:08:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-14 05:08:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-14 05:08:10,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 11 [2024-11-14 05:08:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:10,615 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-14 05:08:10,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-14 05:08:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:08:10,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:10,616 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:10,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 05:08:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:10,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:08:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1448339952, now seen corresponding path program 1 times [2024-11-14 05:08:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:08:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487619218] [2024-11-14 05:08:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:10,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:08:10,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:08:10,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 05:08:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:10,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:08:10,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:08:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:10,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:08:10,986 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:08:10,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487619218] [2024-11-14 05:08:10,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487619218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:10,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:10,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:08:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181227671] [2024-11-14 05:08:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:10,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:08:10,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:08:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:08:10,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:10,988 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:12,305 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-14 05:08:12,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:08:12,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 05:08:12,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:12,308 INFO L225 Difference]: With dead ends: 57 [2024-11-14 05:08:12,308 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 05:08:12,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:12,310 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:12,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:08:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 05:08:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-14 05:08:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-14 05:08:12,320 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 17 [2024-11-14 05:08:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:12,320 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-14 05:08:12,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-14 05:08:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:08:12,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:12,321 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:12,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 05:08:12,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:12,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:08:12,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1312536378, now seen corresponding path program 1 times [2024-11-14 05:08:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:08:12,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112867333] [2024-11-14 05:08:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:12,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:12,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:08:12,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:08:12,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 05:08:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:12,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:08:12,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:08:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:08:12,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:08:12,825 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:08:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112867333] [2024-11-14 05:08:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112867333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:12,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:12,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:08:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707859064] [2024-11-14 05:08:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:12,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:08:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:08:12,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:08:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:08:12,827 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:14,864 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2024-11-14 05:08:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:08:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-14 05:08:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:14,867 INFO L225 Difference]: With dead ends: 77 [2024-11-14 05:08:14,867 INFO L226 Difference]: Without dead ends: 48 [2024-11-14 05:08:14,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:08:14,868 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:14,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 05:08:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-14 05:08:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2024-11-14 05:08:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-14 05:08:14,878 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2024-11-14 05:08:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:14,878 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-14 05:08:14,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-14 05:08:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:08:14,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:14,879 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:14,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 05:08:15,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:15,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:08:15,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1054997254, now seen corresponding path program 1 times [2024-11-14 05:08:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:08:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216874463] [2024-11-14 05:08:15,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:15,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:08:15,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:08:15,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:08:15,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27e471e0-9aee-44b9-a649-cff101552322/bin/utaipan-verify-sOmjnqqW8E/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)] Waiting until timeout for monitored process [2024-11-14 05:08:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:15,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:08:15,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:08:15,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:08:15,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:08:15,552 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-14 05:08:15,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-14 05:08:15,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:08:15,758 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2024-11-14 05:08:15,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 5349 treesize of output 4155 [2024-11-14 05:08:15,882 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2024-11-14 05:08:15,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 5571 treesize of output 4309 [2024-11-14 05:08:16,955 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-14 05:08:16,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 4561 treesize of output 3493 [2024-11-14 05:08:17,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:08:26,236 WARN L286 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 34 DAG size of output: 16 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:08:26,237 INFO L349 Elim1Store]: treesize reduction 92, result has 24.6 percent of original size [2024-11-14 05:08:26,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 2289 treesize of output 1724 [2024-11-14 05:08:27,554 INFO L349 Elim1Store]: treesize reduction 191, result has 36.3 percent of original size [2024-11-14 05:08:27,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 448 [2024-11-14 05:08:27,668 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 18 treesize of output 17 [2024-11-14 05:08:29,048 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 0 case distinctions, treesize of input 738 treesize of output 716 [2024-11-14 05:08:41,966 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2024-11-14 05:08:41,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 6566 treesize of output 5167 [2024-11-14 05:08:42,010 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2024-11-14 05:08:42,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 9378 treesize of output 7104 [2024-11-14 05:08:42,073 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2024-11-14 05:08:42,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 8809 treesize of output 6711 [2024-11-14 05:08:42,300 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-14 05:08:42,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 3564 treesize of output 2682 [2024-11-14 05:08:42,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:08:52,007 WARN L286 SmtUtils]: Spent 9.63s on a formula simplification. DAG size of input: 34 DAG size of output: 16 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:08:52,007 INFO L349 Elim1Store]: treesize reduction 92, result has 24.6 percent of original size [2024-11-14 05:08:52,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 2283 treesize of output 1722 [2024-11-14 05:08:53,800 INFO L349 Elim1Store]: treesize reduction 191, result has 36.3 percent of original size [2024-11-14 05:08:53,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 448 [2024-11-14 05:08:53,883 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 18 treesize of output 17 [2024-11-14 05:08:54,317 INFO L349 Elim1Store]: treesize reduction 217, result has 15.9 percent of original size [2024-11-14 05:08:54,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 371 treesize of output 277 [2024-11-14 05:08:54,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 83 [2024-11-14 05:08:54,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:08:54,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 276 [2024-11-14 05:08:54,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 155 [2024-11-14 05:08:55,099 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2024-11-14 05:08:55,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 5828 treesize of output 4500 [2024-11-14 05:08:55,129 INFO L349 Elim1Store]: treesize reduction 213, result has 0.5 percent of original size [2024-11-14 05:08:55,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 5606 treesize of output 4346 [2024-11-14 05:08:57,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse74 (select |c_#memory_int| (_ bv0 32)))) (let ((.cse24 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse191 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse192 (select .cse191 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse182 (select .cse192 (_ bv0 32)))) (let ((.cse183 (store (select |c_#memory_$Pointer$.offset| .cse182) (_ bv0 32) (_ bv0 32))) (.cse181 (select .cse192 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= v_DerPreprocessor_1 .cse181) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse182)) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse181 v_DerPreprocessor_3) .cse182 .cse183) .cse181)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse190 (store .cse191 (_ bv0 32) v_ArrVal_126))) (let ((.cse187 (select (select .cse190 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse184 (select (select (store .cse190 .cse187 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (and (let ((.cse185 (bvadd (_ bv8 32) (select (select (store (let ((.cse186 (store |c_#memory_$Pointer$.offset| .cse182 .cse183))) (store .cse186 (_ bv0 32) (store (select .cse186 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse187 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse184) .cse185) (select v_DerPreprocessor_7 .cse185))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse189 (store (store (store |c_#memory_int| .cse181 v_DerPreprocessor_5) .cse187 v_DerPreprocessor_6) .cse184 v_DerPreprocessor_7))) (let ((.cse188 (select .cse189 .cse187))) (and (= (select .cse188 (_ bv12 32)) (_ bv42 32)) (= (select .cse189 .cse181) v_DerPreprocessor_5) (= v_DerPreprocessor_6 .cse188)))))))))) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse181)) (= (select (select |c_#memory_int| .cse181) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse191 .cse181) (_ bv0 32)) (_ bv0 32))))))))) (.cse49 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse180 (select .cse179 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse172 (select .cse180 (_ bv0 32)))) (let ((.cse173 (store (select |c_#memory_$Pointer$.offset| .cse172) (_ bv0 32) (_ bv0 32))) (.cse171 (select .cse180 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= v_DerPreprocessor_1 .cse171) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse172)) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse171 v_DerPreprocessor_3) .cse172 .cse173) .cse171)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse171)) (= (select (select |c_#memory_int| .cse171) (_ bv12 32)) (_ bv42 32)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse177 (store .cse179 (_ bv0 32) v_ArrVal_126))) (let ((.cse176 (select (select .cse177 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (and (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse175 (select (select (store .cse177 .cse176 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse174 (store (store (store |c_#memory_int| .cse171 v_DerPreprocessor_5) .cse176 v_DerPreprocessor_6) .cse175 v_DerPreprocessor_7))) (and (= (select .cse174 .cse171) v_DerPreprocessor_5) (= (select (select |c_#memory_int| .cse175) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= v_DerPreprocessor_6 (select .cse174 .cse176)) (= .cse175 .cse176))))) (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (let ((.cse178 (store |c_#memory_$Pointer$.offset| .cse172 .cse173))) (store .cse178 (_ bv0 32) (store (select .cse178 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse176 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))))))) (= (select (select .cse179 .cse171) (_ bv0 32)) (_ bv0 32))))))))) (.cse0 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse168 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse170 (store .cse168 (_ bv0 32) v_ArrVal_126))) (let ((.cse165 (select (select .cse170 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse169 (select .cse168 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse161 (select .cse169 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse162 (select (select (store .cse170 .cse165 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse167 (store (store (store |c_#memory_int| .cse161 v_prenex_9) .cse165 v_prenex_10) .cse162 v_prenex_11))) (let ((.cse160 (select .cse169 (_ bv0 32))) (.cse166 (select .cse167 .cse165))) (and (= .cse160 .cse161) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (let ((.cse163 (bvadd (_ bv8 32) (select (select (store (let ((.cse164 (store |c_#memory_$Pointer$.offset| .cse160 v_arrayElimArr_16))) (store .cse164 (_ bv0 32) (store (select .cse164 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse165 v_prenex_12) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse162) .cse163) (select v_prenex_11 .cse163))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse161 v_DerPreprocessor_3) .cse160 v_arrayElimArr_16) .cse161) v_DerPreprocessor_3) (= (_ bv42 32) (select .cse166 (_ bv12 32))) (= v_DerPreprocessor_1 .cse161) (= .cse166 v_prenex_10) (= (select .cse167 .cse161) v_prenex_9) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse161)) (= (select (select |c_#memory_int| .cse161) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse168 .cse161) (_ bv0 32)) (_ bv0 32))))))))))) (.cse1 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse157 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse159 (store .cse157 (_ bv0 32) v_ArrVal_126))) (let ((.cse154 (select (select .cse159 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse158 (select .cse157 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse150 (select .cse158 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse151 (select (select (store .cse159 .cse154 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse156 (store (store (store |c_#memory_int| .cse150 v_prenex_9) .cse154 v_prenex_10) .cse151 v_prenex_11))) (let ((.cse149 (select .cse158 (_ bv0 32))) (.cse155 (select .cse156 .cse154))) (and (= .cse149 .cse150) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (let ((.cse152 (bvadd (_ bv8 32) (select (select (store (let ((.cse153 (store |c_#memory_$Pointer$.offset| .cse149 v_arrayElimArr_16))) (store .cse153 (_ bv0 32) (store (select .cse153 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse154 v_prenex_12) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse151) .cse152) (select v_prenex_11 .cse152))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse150 v_DerPreprocessor_3) .cse149 v_arrayElimArr_16) .cse150) v_DerPreprocessor_3) (= (_ bv42 32) (select .cse155 (_ bv12 32))) (= v_DerPreprocessor_1 .cse150) (= .cse155 v_prenex_10) (= (select .cse156 .cse150) v_prenex_9) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse150)) (= (select (select |c_#memory_int| .cse150) (_ bv12 32)) (_ bv42 32)) (= .cse151 .cse154) (= (select (select .cse157 .cse150) (_ bv0 32)) (_ bv0 32))))))))))) (.cse2 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse146 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse148 (store .cse146 (_ bv0 32) v_ArrVal_126))) (let ((.cse143 (select (select .cse148 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse147 (select .cse146 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse141 (select .cse147 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse145 (select (select (store .cse148 .cse143 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse140 (select .cse147 (_ bv0 32))) (.cse144 (store (store (store |c_#memory_int| .cse141 v_DerPreprocessor_5) .cse143 v_DerPreprocessor_6) .cse145 v_DerPreprocessor_7))) (and (= .cse140 .cse141) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (select (select (store (let ((.cse142 (store |c_#memory_$Pointer$.offset| .cse140 v_arrayElimArr_16))) (store .cse142 (_ bv0 32) (store (select .cse142 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse143 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)) (_ bv4 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse141 v_DerPreprocessor_3) .cse140 v_arrayElimArr_16) .cse141) v_DerPreprocessor_3) (= (select .cse144 .cse141) v_DerPreprocessor_5) (= (select (select |c_#memory_int| .cse145) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= v_DerPreprocessor_1 .cse141) (= v_DerPreprocessor_6 (select .cse144 .cse143)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse141)) (= (select (select |c_#memory_int| .cse141) (_ bv12 32)) (_ bv42 32)) (= .cse145 .cse143) (= (select (select .cse146 .cse141) (_ bv0 32)) (_ bv0 32)))))))))) (.cse89 (select .cse74 (_ bv12 32))) (.cse50 (not (= (_ bv0 32) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (.cse3 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (or (and (or (and (or .cse0 .cse1 .cse2) .cse3) (and .cse3 (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse5 (select .cse13 (_ bv0 32)))) (let ((.cse6 (store (select |c_#memory_$Pointer$.offset| .cse5) (_ bv0 32) (_ bv0 32))) (.cse4 (select .cse13 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= v_DerPreprocessor_1 .cse4) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_DerPreprocessor_3) .cse5 .cse6) .cse4)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse4)) (= (select (select |c_#memory_int| .cse4) (_ bv12 32)) (_ bv42 32)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse12 (_ bv0 32) v_ArrVal_126))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (and (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store .cse10 .cse9 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse7 (store (store (store |c_#memory_int| .cse4 v_DerPreprocessor_5) .cse9 v_DerPreprocessor_6) .cse8 v_DerPreprocessor_7))) (and (= (select .cse7 .cse4) v_DerPreprocessor_5) (= (select (select |c_#memory_int| .cse8) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= v_DerPreprocessor_6 (select .cse7 .cse9)) (= .cse8 .cse9))))) (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse5 .cse6))) (store .cse11 (_ bv0 32) (store (select .cse11 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse9 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))))))) (= (select (select .cse12 .cse4) (_ bv0 32)) (_ bv0 32)))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse23 (store .cse21 (_ bv0 32) v_ArrVal_126))) (let ((.cse17 (select (select .cse23 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse22 (select .cse21 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse20 (select (select (store .cse23 .cse17 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse15 (select .cse22 (_ bv0 32)))) (let ((.cse16 (store (select |c_#memory_$Pointer$.offset| .cse15) (_ bv0 32) (_ bv0 32))) (.cse18 (store (store (store |c_#memory_int| .cse19 v_DerPreprocessor_5) .cse17 v_DerPreprocessor_6) .cse20 v_DerPreprocessor_7))) (and (= (_ bv4 32) (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse15 .cse16))) (store .cse14 (_ bv0 32) (store (select .cse14 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse17 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select .cse18 .cse19) v_DerPreprocessor_5) (= (select (select |c_#memory_int| .cse20) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= v_DerPreprocessor_1 .cse19) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse19 v_DerPreprocessor_3) .cse15 .cse16) .cse19)) (= v_DerPreprocessor_6 (select .cse18 .cse17)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse19)) (= (select (select |c_#memory_int| .cse19) (_ bv12 32)) (_ bv42 32)) (= .cse20 .cse17) (= (select (select .cse21 .cse19) (_ bv0 32)) (_ bv0 32))))))))) .cse24 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse36 (store .cse34 (_ bv0 32) v_ArrVal_126))) (let ((.cse33 (select (select .cse36 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse35 (select .cse34 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse27 (select .cse35 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse28 (select (select (store .cse36 .cse33 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse26 (store (store (store |c_#memory_int| .cse27 v_DerPreprocessor_5) .cse33 v_DerPreprocessor_6) .cse28 v_DerPreprocessor_7)) (.cse31 (select .cse35 (_ bv0 32)))) (let ((.cse32 (store (select |c_#memory_$Pointer$.offset| .cse31) (_ bv0 32) (_ bv0 32))) (.cse25 (select .cse26 .cse33))) (and (= (select .cse25 (_ bv12 32)) (_ bv42 32)) (= (select .cse26 .cse27) v_DerPreprocessor_5) (let ((.cse29 (bvadd (_ bv8 32) (select (select (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| .cse31 .cse32))) (store .cse30 (_ bv0 32) (store (select .cse30 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse33 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse28) .cse29) (select v_DerPreprocessor_7 .cse29))) (= v_DerPreprocessor_1 .cse27) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse27 v_DerPreprocessor_3) .cse31 .cse32) .cse27)) (= v_DerPreprocessor_6 .cse25) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse27)) (= (select (select |c_#memory_int| .cse27) (_ bv12 32)) (_ bv42 32)) (= .cse28 .cse33) (= (select (select .cse34 .cse27) (_ bv0 32)) (_ bv0 32)))))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse38 (select .cse48 (_ bv0 32)))) (let ((.cse39 (store (select |c_#memory_$Pointer$.offset| .cse38) (_ bv0 32) (_ bv0 32))) (.cse37 (select .cse48 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= v_DerPreprocessor_1 .cse37) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse37 v_DerPreprocessor_3) .cse38 .cse39) .cse37)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store .cse47 (_ bv0 32) v_ArrVal_126))) (let ((.cse43 (select (select .cse46 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse40 (select (select (store .cse46 .cse43 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (and (let ((.cse41 (bvadd (_ bv8 32) (select (select (store (let ((.cse42 (store |c_#memory_$Pointer$.offset| .cse38 .cse39))) (store .cse42 (_ bv0 32) (store (select .cse42 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse43 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse40) .cse41) (select v_DerPreprocessor_7 .cse41))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store (store |c_#memory_int| .cse37 v_DerPreprocessor_5) .cse43 v_DerPreprocessor_6) .cse40 v_DerPreprocessor_7))) (let ((.cse44 (select .cse45 .cse43))) (and (= (select .cse44 (_ bv12 32)) (_ bv42 32)) (= (select .cse45 .cse37) v_DerPreprocessor_5) (= v_DerPreprocessor_6 .cse44)))))))))) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse37)) (= (select (select |c_#memory_int| .cse37) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse47 .cse37) (_ bv0 32)) (_ bv0 32)))))))) .cse49))) .cse50) (and (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse60 (store .cse58 (_ bv0 32) v_ArrVal_126))) (let ((.cse54 (select (select .cse60 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse59 (select .cse58 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse56 (select .cse59 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse57 (select (select (store .cse60 .cse54 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse52 (select .cse59 (_ bv0 32)))) (let ((.cse53 (store (select |c_#memory_$Pointer$.offset| .cse52) (_ bv0 32) (_ bv0 32))) (.cse55 (store (store (store |c_#memory_int| .cse56 v_DerPreprocessor_5) .cse54 v_DerPreprocessor_6) .cse57 v_DerPreprocessor_7))) (and (= (_ bv4 32) (select (select (store (let ((.cse51 (store |c_#memory_$Pointer$.offset| .cse52 .cse53))) (store .cse51 (_ bv0 32) (store (select .cse51 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse54 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select .cse55 .cse56) v_DerPreprocessor_5) (= (select (select |c_#memory_int| .cse57) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= v_DerPreprocessor_1 .cse56) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse52)) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse56 v_DerPreprocessor_3) .cse52 .cse53) .cse56)) (= v_DerPreprocessor_6 (select .cse55 .cse54)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse56)) (= (select (select |c_#memory_int| .cse56) (_ bv12 32)) (_ bv42 32)) (= .cse57 .cse54) (= (select (select .cse58 .cse56) (_ bv0 32)) (_ bv0 32))))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse72 (store .cse70 (_ bv0 32) v_ArrVal_126))) (let ((.cse69 (select (select .cse72 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (.cse71 (select .cse70 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse63 (select .cse71 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse64 (select (select (store .cse72 .cse69 v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse62 (store (store (store |c_#memory_int| .cse63 v_DerPreprocessor_5) .cse69 v_DerPreprocessor_6) .cse64 v_DerPreprocessor_7)) (.cse67 (select .cse71 (_ bv0 32)))) (let ((.cse68 (store (select |c_#memory_$Pointer$.offset| .cse67) (_ bv0 32) (_ bv0 32))) (.cse61 (select .cse62 .cse69))) (and (= (select .cse61 (_ bv12 32)) (_ bv42 32)) (= (select .cse62 .cse63) v_DerPreprocessor_5) (let ((.cse65 (bvadd (_ bv8 32) (select (select (store (let ((.cse66 (store |c_#memory_$Pointer$.offset| .cse67 .cse68))) (store .cse66 (_ bv0 32) (store (select .cse66 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse69 v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse64) .cse65) (select v_DerPreprocessor_7 .cse65))) (= v_DerPreprocessor_1 .cse63) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse67)) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse63 v_DerPreprocessor_3) .cse67 .cse68) .cse63)) (= v_DerPreprocessor_6 .cse61) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse63)) (= (select (select |c_#memory_int| .cse63) (_ bv12 32)) (_ bv42 32)) (= .cse64 .cse69) (= (select (select .cse70 .cse63) (_ bv0 32)) (_ bv0 32)))))))))) .cse24 (and (or .cse24 .cse49) .cse50) .cse49) .cse3) (and (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse79 (select .cse73 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse76 (select .cse79 (_ bv0 32)))) (let ((.cse77 (store (select |c_#memory_$Pointer$.offset| .cse76) (_ bv0 32) (_ bv0 32))) (.cse78 (select .cse79 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= (_ bv42 32) (select v_DerPreprocessor_6 (_ bv12 32))) (= (_ bv0 32) (select (select (store .cse73 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (let ((.cse75 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse76 .cse77) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select .cse74 .cse75) (select v_DerPreprocessor_6 .cse75))) (= v_DerPreprocessor_1 .cse78) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse78 v_DerPreprocessor_3) .cse76 .cse77) .cse78)) (= (select (store (store |c_#memory_int| .cse78 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse78) v_DerPreprocessor_5) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse78)) (= (_ bv0 32) (select (select (store .cse73 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse78) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse73 .cse78) (_ bv0 32)) (_ bv0 32)))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse88 (select .cse87 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse82 (select .cse88 (_ bv0 32)))) (let ((.cse83 (store (select |c_#memory_$Pointer$.offset| .cse82) (_ bv0 32) (_ bv0 32))) (.cse85 (select .cse88 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select (select (store .cse87 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (and (let ((.cse81 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse82 .cse83) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse80) .cse81) (select v_DerPreprocessor_7 .cse81))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store (store (store |c_#memory_int| .cse85 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse80 v_DerPreprocessor_7))) (let ((.cse86 (select .cse84 (_ bv0 32)))) (and (= v_DerPreprocessor_5 (select .cse84 .cse85)) (= .cse86 v_DerPreprocessor_6) (= (_ bv42 32) (select .cse86 (_ bv12 32)))))))))) (= v_DerPreprocessor_1 .cse85) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse82)) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse85 v_DerPreprocessor_3) .cse82 .cse83) .cse85)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse85)) (= (_ bv0 32) (select (select (store .cse87 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse85) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse87 .cse85) (_ bv0 32)) (_ bv0 32)))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse94 (select .cse92 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse90 (select .cse94 (_ bv0 32)))) (let ((.cse91 (store (select |c_#memory_$Pointer$.offset| .cse90) (_ bv0 32) (_ bv0 32))) (.cse93 (select .cse94 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse89) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse90 .cse91) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (_ bv0 32) (select (select (store .cse92 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= v_DerPreprocessor_1 .cse93) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse93 v_DerPreprocessor_3) .cse90 .cse91) .cse93)) (= (select (store (store |c_#memory_int| .cse93 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse93) v_DerPreprocessor_5) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse93)) (= (_ bv0 32) (select (select (store .cse92 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse93) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse92 .cse93) (_ bv0 32)) (_ bv0 32)))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse99 (select .cse97 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse95 (select .cse99 (_ bv0 32)))) (let ((.cse96 (store (select |c_#memory_$Pointer$.offset| .cse95) (_ bv0 32) (_ bv0 32))) (.cse98 (select .cse99 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse95 .cse96) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store .cse97 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse89) (= (select (store (store |c_#memory_int| .cse98 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse98) v_DerPreprocessor_5))) (= v_DerPreprocessor_1 .cse98) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse95)) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse98 v_DerPreprocessor_3) .cse95 .cse96) .cse98)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse98)) (= (_ bv0 32) (select (select (store .cse97 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse98) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse97 .cse98) (_ bv0 32)) (_ bv0 32)))))))) (and (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse108 (select .cse107 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse102 (select .cse108 (_ bv0 32)))) (let ((.cse103 (store (select |c_#memory_$Pointer$.offset| .cse102) (_ bv0 32) (_ bv0 32))) (.cse105 (select .cse108 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (select (select (store .cse107 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (and (let ((.cse101 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse102 .cse103) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse100) .cse101) (select v_DerPreprocessor_7 .cse101))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store (store (store |c_#memory_int| .cse105 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse100 v_DerPreprocessor_7))) (let ((.cse106 (select .cse104 (_ bv0 32)))) (and (= v_DerPreprocessor_5 (select .cse104 .cse105)) (= .cse106 v_DerPreprocessor_6) (= (_ bv42 32) (select .cse106 (_ bv12 32)))))))))) (= v_DerPreprocessor_1 .cse105) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse105 v_DerPreprocessor_3) .cse102 .cse103) .cse105)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse105)) (= (_ bv0 32) (select (select (store .cse107 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse105) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse107 .cse105) (_ bv0 32)) (_ bv0 32)))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse113 (select .cse111 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse109 (select .cse113 (_ bv0 32)))) (let ((.cse110 (store (select |c_#memory_$Pointer$.offset| .cse109) (_ bv0 32) (_ bv0 32))) (.cse112 (select .cse113 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse109 .cse110) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store .cse111 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse89) (= (select (store (store |c_#memory_int| .cse112 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse112) v_DerPreprocessor_5))) (= v_DerPreprocessor_1 .cse112) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse112 v_DerPreprocessor_3) .cse109 .cse110) .cse112)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse112)) (= (_ bv0 32) (select (select (store .cse111 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse112) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse111 .cse112) (_ bv0 32)) (_ bv0 32))))))))) .cse50)) .cse3) (and (or .cse0 (and .cse0 .cse50) .cse1 .cse2) .cse3) (and (let ((.cse119 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse130 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse131 (select .cse130 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse125 (select .cse131 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse127 (select (select (store .cse130 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)))) (let ((.cse129 (store (store (store |c_#memory_int| .cse125 v_prenex_9) (_ bv0 32) v_prenex_10) .cse127 v_prenex_11))) (let ((.cse126 (select .cse129 (_ bv0 32))) (.cse124 (select .cse131 (_ bv0 32)))) (and (= .cse124 .cse125) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= .cse126 v_prenex_10) (let ((.cse128 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse124 v_arrayElimArr_16) (_ bv0 32) v_prenex_12) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)) (_ bv8 32)))) (= (select (select |c_#memory_int| .cse127) .cse128) (select v_prenex_11 .cse128))) (= (select .cse129 .cse125) v_prenex_9) (= (_ bv42 32) (select .cse126 (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse125 v_DerPreprocessor_3) .cse124 v_arrayElimArr_16) .cse125) v_DerPreprocessor_3) (= v_DerPreprocessor_1 .cse125) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse125)) (= (_ bv0 32) (select (select (store .cse130 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse125) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse130 .cse125) (_ bv0 32)) (_ bv0 32))))))))))) (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse118 (select .cse117 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse114 (select .cse118 (_ bv0 32))) (.cse115 (select .cse118 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= .cse114 .cse115) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (let ((.cse116 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse114 v_arrayElimArr_16) (_ bv0 32) v_prenex_12) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32)) (_ bv8 32)))) (= (select .cse74 .cse116) (select v_prenex_10 .cse116))) (= (_ bv0 32) (select (select (store .cse117 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse115 v_DerPreprocessor_3) .cse114 v_arrayElimArr_16) .cse115) v_DerPreprocessor_3) (= (select (store (store |c_#memory_int| .cse115 v_prenex_9) (_ bv0 32) v_prenex_10) .cse115) v_prenex_9) (= v_DerPreprocessor_1 .cse115) (= (select v_prenex_10 (_ bv12 32)) (_ bv42 32)) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse115)) (= (_ bv0 32) (select (select (store .cse117 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse115) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse117 .cse115) (_ bv0 32)) (_ bv0 32))))))) .cse119 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse123 (select .cse122 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse120 (select .cse123 (_ bv0 32))) (.cse121 (select .cse123 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= .cse120 .cse121) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse89) (= (_ bv0 32) (select (select (store .cse122 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse121 v_DerPreprocessor_3) .cse120 v_arrayElimArr_16) .cse121) v_DerPreprocessor_3) (= v_DerPreprocessor_1 .cse121) (= (select (store (store |c_#memory_int| .cse121 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse121) v_DerPreprocessor_5) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse121)) (= (_ bv0 32) (select (select (store .cse122 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse120 v_arrayElimArr_16) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| .cse121) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse122 .cse121) (_ bv0 32)) (_ bv0 32))))))) (and .cse119 .cse50))) .cse3) (and (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse132 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_8 v_DerPreprocessor_9))) (let ((.cse135 (select .cse132 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse133 (select .cse135 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= (_ bv0 32) (select (select .cse132 .cse133) (_ bv0 32))) (= v_DerPreprocessor_8 .cse133) (= (_ bv42 32) (select (select |c_#memory_int| .cse133) (_ bv12 32))) (= (select (let ((.cse134 (select .cse135 (_ bv0 32)))) (store (store |c_#memory_$Pointer$.offset| .cse133 v_DerPreprocessor_10) .cse134 (store (select |c_#memory_$Pointer$.offset| .cse134) (_ bv0 32) (_ bv0 32)))) .cse133) v_DerPreprocessor_10) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse133))))))) .cse3) (and (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse136 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_8 v_DerPreprocessor_9))) (let ((.cse139 (select .cse136 |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|))) (let ((.cse138 (select .cse139 (_ bv0 32))) (.cse137 (select .cse139 |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (and (= (_ bv0 32) (select (select .cse136 .cse137) (_ bv0 32))) (= .cse138 .cse137) (= v_DerPreprocessor_10 (select (store (store |c_#memory_$Pointer$.offset| .cse137 v_DerPreprocessor_10) .cse138 v_arrayElimArr_38) .cse137)) (= v_DerPreprocessor_8 .cse137) (= (_ bv42 32) (select (select |c_#memory_int| .cse137) (_ bv12 32))) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse137)) (= (_ bv0 32) (select v_arrayElimArr_38 (_ bv0 32)))))))) .cse3)))) is different from false [2024-11-14 05:09:23,460 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| (_ bv0 32)))) (let ((.cse41 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse182 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse192 (select .cse182 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse189 (select .cse192 (_ bv0 32)))) (let ((.cse190 (store (select |c_#memory_$Pointer$.offset| .cse189) (_ bv0 32) (_ bv0 32))) (.cse181 (select .cse192 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_1 .cse181) (= (_ bv42 32) (select (select |c_#memory_int| .cse181) (_ bv12 32))) (= (select (select .cse182 .cse181) (_ bv0 32)) (_ bv0 32)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse191 (store .cse182 (_ bv0 32) v_ArrVal_126))) (let ((.cse185 (select (select .cse191 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse186 (select (select (store .cse191 .cse185 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse184 (store (store (store |c_#memory_int| .cse181 v_DerPreprocessor_5) .cse185 v_DerPreprocessor_6) .cse186 v_DerPreprocessor_7))) (let ((.cse183 (select .cse184 .cse185))) (and (= .cse183 v_DerPreprocessor_6) (= (_ bv42 32) (select .cse183 (_ bv12 32))) (= (select .cse184 .cse181) v_DerPreprocessor_5))))) (let ((.cse187 (bvadd (_ bv8 32) (select (select (store (let ((.cse188 (store |c_#memory_$Pointer$.offset| .cse189 .cse190))) (store .cse188 (_ bv0 32) (store (select .cse188 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse185 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse187) (select (select |c_#memory_int| .cse186) .cse187)))))))) (not (= .cse189 |c_ULTIMATE.start_create_tree_#res#1.base|)) (not (= .cse181 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse181 v_DerPreprocessor_3) .cse189 .cse190) .cse181) v_DerPreprocessor_3)))))))) (.cse42 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse172 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse180 (select .cse172 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse173 (select .cse180 (_ bv0 32)))) (let ((.cse175 (store (select |c_#memory_$Pointer$.offset| .cse173) (_ bv0 32) (_ bv0 32))) (.cse171 (select .cse180 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_1 .cse171) (= (_ bv42 32) (select (select |c_#memory_int| .cse171) (_ bv12 32))) (= (select (select .cse172 .cse171) (_ bv0 32)) (_ bv0 32)) (not (= .cse173 |c_ULTIMATE.start_create_tree_#res#1.base|)) (not (= .cse171 |c_ULTIMATE.start_create_tree_#res#1.base|)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (store .cse172 (_ bv0 32) v_ArrVal_126))) (let ((.cse176 (select (select .cse179 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (and (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (let ((.cse174 (store |c_#memory_$Pointer$.offset| .cse173 .cse175))) (store .cse174 (_ bv0 32) (store (select .cse174 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse176 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse178 (select (select (store .cse179 .cse176 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse177 (store (store (store |c_#memory_int| .cse171 v_DerPreprocessor_5) .cse176 v_DerPreprocessor_6) .cse178 v_DerPreprocessor_7))) (and (= (select .cse177 .cse176) v_DerPreprocessor_6) (= (select (select |c_#memory_int| .cse178) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (select .cse177 .cse171) v_DerPreprocessor_5) (= .cse176 .cse178))))))))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse171 v_DerPreprocessor_3) .cse173 .cse175) .cse171) v_DerPreprocessor_3)))))))) (.cse1 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse170 (store .cse162 (_ bv0 32) v_ArrVal_126))) (let ((.cse167 (select (select .cse170 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse169 (select .cse162 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse160 (select .cse169 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse164 (select (select (store .cse170 .cse167 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse168 (store (store (store |c_#memory_int| .cse160 v_prenex_9) .cse167 v_prenex_10) .cse164 v_prenex_11))) (let ((.cse163 (select .cse168 .cse167)) (.cse161 (select .cse169 (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse160) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse160) (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse160 v_DerPreprocessor_3) .cse161 v_arrayElimArr_16) .cse160) v_DerPreprocessor_3) (= (select (select .cse162 .cse160) (_ bv0 32)) (_ bv0 32)) (= .cse161 .cse160) (not (= .cse160 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (_ bv42 32) (select .cse163 (_ bv12 32))) (= .cse163 v_prenex_10) (let ((.cse165 (bvadd (_ bv8 32) (select (select (store (let ((.cse166 (store |c_#memory_$Pointer$.offset| .cse161 v_arrayElimArr_16))) (store .cse166 (_ bv0 32) (store (select .cse166 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse167 v_prenex_12) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse164) .cse165) (select v_prenex_11 .cse165))) (= .cse167 .cse164) (= (select .cse168 .cse160) v_prenex_9)))))))))) (.cse2 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse159 (store .cse153 (_ bv0 32) v_ArrVal_126))) (let ((.cse155 (select (select .cse159 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse158 (select .cse153 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse151 (select .cse158 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse157 (select (select (store .cse159 .cse155 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse152 (select .cse158 (_ bv0 32))) (.cse156 (store (store (store |c_#memory_int| .cse151 v_DerPreprocessor_5) .cse155 v_DerPreprocessor_6) .cse157 v_DerPreprocessor_7))) (and (= v_DerPreprocessor_1 .cse151) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse151) (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse151 v_DerPreprocessor_3) .cse152 v_arrayElimArr_16) .cse151) v_DerPreprocessor_3) (= (select (select .cse153 .cse151) (_ bv0 32)) (_ bv0 32)) (= (_ bv4 32) (select (select (store (let ((.cse154 (store |c_#memory_$Pointer$.offset| .cse152 v_arrayElimArr_16))) (store .cse154 (_ bv0 32) (store (select .cse154 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse155 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (= (select .cse156 .cse155) v_DerPreprocessor_6) (= .cse152 .cse151) (not (= .cse151 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select |c_#memory_int| .cse157) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (select .cse156 .cse151) v_DerPreprocessor_5) (= .cse155 .cse157))))))))) (.cse3 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse150 (store .cse142 (_ bv0 32) v_ArrVal_126))) (let ((.cse147 (select (select .cse150 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse149 (select .cse142 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse140 (select .cse149 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse144 (select (select (store .cse150 .cse147 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse148 (store (store (store |c_#memory_int| .cse140 v_prenex_9) .cse147 v_prenex_10) .cse144 v_prenex_11))) (let ((.cse143 (select .cse148 .cse147)) (.cse141 (select .cse149 (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse140) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse140) (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse140 v_DerPreprocessor_3) .cse141 v_arrayElimArr_16) .cse140) v_DerPreprocessor_3) (= (select (select .cse142 .cse140) (_ bv0 32)) (_ bv0 32)) (= .cse141 .cse140) (not (= .cse140 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (_ bv42 32) (select .cse143 (_ bv12 32))) (= .cse143 v_prenex_10) (let ((.cse145 (bvadd (_ bv8 32) (select (select (store (let ((.cse146 (store |c_#memory_$Pointer$.offset| .cse141 v_arrayElimArr_16))) (store .cse146 (_ bv0 32) (store (select .cse146 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse147 v_prenex_12) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse144) .cse145) (select v_prenex_11 .cse145))) (= (select .cse148 .cse140) v_prenex_9)))))))))) (.cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#res#1.base|) |c_ULTIMATE.start_create_tree_#res#1.offset|) (_ bv0 32))) (.cse4 (not (= (_ bv0 32) |c_ULTIMATE.start_create_tree_#res#1.offset|))) (.cse7 (select .cse14 (_ bv12 32)))) (or (and .cse0 (or .cse1 .cse2 .cse3 (and .cse3 .cse4))) (and .cse0 (let ((.cse5 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse24 (select .cse19 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse17 (select .cse24 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse22 (select (select (store .cse19 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse23 (store (store (store |c_#memory_int| .cse17 v_prenex_9) (_ bv0 32) v_prenex_10) .cse22 v_prenex_11))) (let ((.cse18 (select .cse24 (_ bv0 32))) (.cse20 (select .cse23 (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse17) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse17) (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse17 v_DerPreprocessor_3) .cse18 v_arrayElimArr_16) .cse17) v_DerPreprocessor_3) (= (select (select .cse19 .cse17) (_ bv0 32)) (_ bv0 32)) (= (_ bv42 32) (select .cse20 (_ bv12 32))) (let ((.cse21 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse18 v_arrayElimArr_16) (_ bv0 32) v_prenex_12) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select v_prenex_11 .cse21) (select (select |c_#memory_int| .cse22) .cse21))) (= .cse18 .cse17) (= (select .cse23 .cse17) v_prenex_9) (not (= .cse17 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse19 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= .cse20 v_prenex_10)))))))))) (or .cse5 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse8 (select .cse10 (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse6) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse7) (= (_ bv42 32) (select (select |c_#memory_int| .cse6) (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_3) .cse8 v_arrayElimArr_16) .cse6) v_DerPreprocessor_3) (= v_DerPreprocessor_5 (select (store (store |c_#memory_int| .cse6 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse6)) (= (select (select .cse9 .cse6) (_ bv0 32)) (_ bv0 32)) (= .cse8 .cse6) (= (_ bv0 32) (select (select (store .cse9 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (not (= .cse6 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse9 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse8 v_arrayElimArr_16) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))))))) (and .cse5 .cse4) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse16 (select .cse13 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse11 (select .cse16 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse12 (select .cse16 (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse11) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= v_prenex_9 (select (store (store |c_#memory_int| .cse11 v_prenex_9) (_ bv0 32) v_prenex_10) .cse11)) (= (_ bv42 32) (select (select |c_#memory_int| .cse11) (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_3) .cse12 v_arrayElimArr_16) .cse11) v_DerPreprocessor_3) (= (select (select .cse13 .cse11) (_ bv0 32)) (_ bv0 32)) (= .cse12 .cse11) (= (_ bv0 32) (select (select (store .cse13 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (not (= .cse11 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse13 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select v_prenex_10 (_ bv12 32)) (_ bv42 32)) (let ((.cse15 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse12 v_arrayElimArr_16) (_ bv0 32) v_prenex_12) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select .cse14 .cse15) (select v_prenex_10 .cse15))))))))))) (and .cse0 (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse26 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_8 v_DerPreprocessor_9))) (let ((.cse28 (select .cse26 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (not (= .cse25 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (_ bv0 32) (select (select .cse26 .cse25) (_ bv0 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse25) (_ bv12 32))) (= v_DerPreprocessor_10 (select (let ((.cse27 (select .cse28 (_ bv0 32)))) (store (store |c_#memory_$Pointer$.offset| .cse25 v_DerPreprocessor_10) .cse27 (store (select |c_#memory_$Pointer$.offset| .cse27) (_ bv0 32) (_ bv0 32)))) .cse25)) (= v_DerPreprocessor_8 .cse25))))))) (and .cse0 (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse40 (store .cse30 (_ bv0 32) v_ArrVal_126))) (let ((.cse37 (select (select .cse40 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse39 (select .cse30 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse29 (select .cse39 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse34 (select (select (store .cse40 .cse37 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse32 (select .cse39 (_ bv0 32))) (.cse38 (store (store (store |c_#memory_int| .cse29 v_DerPreprocessor_5) .cse37 v_DerPreprocessor_6) .cse34 v_DerPreprocessor_7))) (let ((.cse31 (select .cse38 .cse37)) (.cse36 (store (select |c_#memory_$Pointer$.offset| .cse32) (_ bv0 32) (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse29) (= (_ bv42 32) (select (select |c_#memory_int| .cse29) (_ bv12 32))) (= (select (select .cse30 .cse29) (_ bv0 32)) (_ bv0 32)) (= .cse31 v_DerPreprocessor_6) (not (= .cse32 |c_ULTIMATE.start_create_tree_#res#1.base|)) (not (= .cse29 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (_ bv42 32) (select .cse31 (_ bv12 32))) (let ((.cse33 (bvadd (_ bv8 32) (select (select (store (let ((.cse35 (store |c_#memory_$Pointer$.offset| .cse32 .cse36))) (store .cse35 (_ bv0 32) (store (select .cse35 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse37 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse33) (select (select |c_#memory_int| .cse34) .cse33))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse29 v_DerPreprocessor_3) .cse32 .cse36) .cse29) v_DerPreprocessor_3) (= (select .cse38 .cse29) v_DerPreprocessor_5) (= .cse37 .cse34))))))))) .cse41 (and (or .cse41 .cse42) .cse4) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse52 (store .cse44 (_ bv0 32) v_ArrVal_126))) (let ((.cse46 (select (select .cse52 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse51 (select .cse44 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse43 (select .cse51 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse50 (select (select (store .cse52 .cse46 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse48 (select .cse51 (_ bv0 32)))) (let ((.cse49 (store (select |c_#memory_$Pointer$.offset| .cse48) (_ bv0 32) (_ bv0 32))) (.cse45 (store (store (store |c_#memory_int| .cse43 v_DerPreprocessor_5) .cse46 v_DerPreprocessor_6) .cse50 v_DerPreprocessor_7))) (and (= v_DerPreprocessor_1 .cse43) (= (_ bv42 32) (select (select |c_#memory_int| .cse43) (_ bv12 32))) (= (select (select .cse44 .cse43) (_ bv0 32)) (_ bv0 32)) (= (select .cse45 .cse46) v_DerPreprocessor_6) (= (_ bv4 32) (select (select (store (let ((.cse47 (store |c_#memory_$Pointer$.offset| .cse48 .cse49))) (store .cse47 (_ bv0 32) (store (select .cse47 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse46 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (not (= .cse48 |c_ULTIMATE.start_create_tree_#res#1.base|)) (not (= .cse43 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select |c_#memory_int| .cse50) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse43 v_DerPreprocessor_3) .cse48 .cse49) .cse43) v_DerPreprocessor_3) (= (select .cse45 .cse43) v_DerPreprocessor_5) (= .cse46 .cse50)))))))) .cse42)) (and .cse0 (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse55 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_8 v_DerPreprocessor_9))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse54 (select .cse56 (_ bv0 32))) (.cse53 (select .cse56 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_10 (select (store (store |c_#memory_$Pointer$.offset| .cse53 v_DerPreprocessor_10) .cse54 v_arrayElimArr_38) .cse53)) (not (= .cse53 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (_ bv0 32) (select (select .cse55 .cse53) (_ bv0 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse53) (_ bv12 32))) (= (_ bv0 32) (select v_arrayElimArr_38 (_ bv0 32))) (= v_DerPreprocessor_8 .cse53) (= .cse54 .cse53))))))) (and (or (and .cse0 (or .cse41 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse66 (select .cse58 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse60 (select .cse66 (_ bv0 32)))) (let ((.cse61 (store (select |c_#memory_$Pointer$.offset| .cse60) (_ bv0 32) (_ bv0 32))) (.cse57 (select .cse66 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_1 .cse57) (= (_ bv42 32) (select (select |c_#memory_int| .cse57) (_ bv12 32))) (= (select (select .cse58 .cse57) (_ bv0 32)) (_ bv0 32)) (not (= .cse57 |c_ULTIMATE.start_create_tree_#res#1.base|)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store .cse58 (_ bv0 32) v_ArrVal_126))) (let ((.cse62 (select (select .cse65 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (and (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (let ((.cse59 (store |c_#memory_$Pointer$.offset| .cse60 .cse61))) (store .cse59 (_ bv0 32) (store (select .cse59 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse62 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select (select (store .cse65 .cse62 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse63 (store (store (store |c_#memory_int| .cse57 v_DerPreprocessor_5) .cse62 v_DerPreprocessor_6) .cse64 v_DerPreprocessor_7))) (and (= (select .cse63 .cse62) v_DerPreprocessor_6) (= (select (select |c_#memory_int| .cse64) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (select .cse63 .cse57) v_DerPreprocessor_5) (= .cse62 .cse64))))))))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse57 v_DerPreprocessor_3) .cse60 .cse61) .cse57) v_DerPreprocessor_3))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse76 (store .cse68 (_ bv0 32) v_ArrVal_126))) (let ((.cse70 (select (select .cse76 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse75 (select .cse68 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse67 (select .cse75 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse74 (select (select (store .cse76 .cse70 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse72 (select .cse75 (_ bv0 32)))) (let ((.cse73 (store (select |c_#memory_$Pointer$.offset| .cse72) (_ bv0 32) (_ bv0 32))) (.cse69 (store (store (store |c_#memory_int| .cse67 v_DerPreprocessor_5) .cse70 v_DerPreprocessor_6) .cse74 v_DerPreprocessor_7))) (and (= v_DerPreprocessor_1 .cse67) (= (_ bv42 32) (select (select |c_#memory_int| .cse67) (_ bv12 32))) (= (select (select .cse68 .cse67) (_ bv0 32)) (_ bv0 32)) (= (select .cse69 .cse70) v_DerPreprocessor_6) (= (_ bv4 32) (select (select (store (let ((.cse71 (store |c_#memory_$Pointer$.offset| .cse72 .cse73))) (store .cse71 (_ bv0 32) (store (select .cse71 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse70 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (not (= .cse67 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select |c_#memory_int| .cse74) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse67 v_DerPreprocessor_3) .cse72 .cse73) .cse67) v_DerPreprocessor_3) (= (select .cse69 .cse67) v_DerPreprocessor_5) (= .cse70 .cse74)))))))) .cse42 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse88 (store .cse78 (_ bv0 32) v_ArrVal_126))) (let ((.cse85 (select (select .cse88 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (.cse87 (select .cse78 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse77 (select .cse87 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse81 (select (select (store .cse88 .cse85 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse83 (select .cse87 (_ bv0 32))) (.cse86 (store (store (store |c_#memory_int| .cse77 v_DerPreprocessor_5) .cse85 v_DerPreprocessor_6) .cse81 v_DerPreprocessor_7))) (let ((.cse79 (select .cse86 .cse85)) (.cse84 (store (select |c_#memory_$Pointer$.offset| .cse83) (_ bv0 32) (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse77) (= (_ bv42 32) (select (select |c_#memory_int| .cse77) (_ bv12 32))) (= (select (select .cse78 .cse77) (_ bv0 32)) (_ bv0 32)) (= .cse79 v_DerPreprocessor_6) (not (= .cse77 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (_ bv42 32) (select .cse79 (_ bv12 32))) (let ((.cse80 (bvadd (_ bv8 32) (select (select (store (let ((.cse82 (store |c_#memory_$Pointer$.offset| .cse83 .cse84))) (store .cse82 (_ bv0 32) (store (select .cse82 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse85 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse80) (select (select |c_#memory_int| .cse81) .cse80))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse77 v_DerPreprocessor_3) .cse83 .cse84) .cse77) v_DerPreprocessor_3) (= (select .cse86 .cse77) v_DerPreprocessor_5) (= .cse85 .cse81))))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse100 (select .cse90 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse97 (select .cse100 (_ bv0 32)))) (let ((.cse98 (store (select |c_#memory_$Pointer$.offset| .cse97) (_ bv0 32) (_ bv0 32))) (.cse89 (select .cse100 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_1 .cse89) (= (_ bv42 32) (select (select |c_#memory_int| .cse89) (_ bv12 32))) (= (select (select .cse90 .cse89) (_ bv0 32)) (_ bv0 32)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (store .cse90 (_ bv0 32) v_ArrVal_126))) (let ((.cse93 (select (select .cse99 |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (let ((.cse94 (select (select (store .cse99 .cse93 v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (store (store (store |c_#memory_int| .cse89 v_DerPreprocessor_5) .cse93 v_DerPreprocessor_6) .cse94 v_DerPreprocessor_7))) (let ((.cse91 (select .cse92 .cse93))) (and (= .cse91 v_DerPreprocessor_6) (= (_ bv42 32) (select .cse91 (_ bv12 32))) (= (select .cse92 .cse89) v_DerPreprocessor_5))))) (let ((.cse95 (bvadd (_ bv8 32) (select (select (store (let ((.cse96 (store |c_#memory_$Pointer$.offset| .cse97 .cse98))) (store .cse96 (_ bv0 32) (store (select .cse96 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse93 v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse95) (select (select |c_#memory_int| .cse94) .cse95)))))))) (not (= .cse89 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse89 v_DerPreprocessor_3) .cse97 .cse98) .cse89) v_DerPreprocessor_3))))))))) (and .cse0 (or .cse1 .cse2 .cse3))) .cse4) (and .cse0 (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse106 (select .cse105 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse103 (select .cse106 (_ bv0 32)))) (let ((.cse104 (store (select |c_#memory_$Pointer$.offset| .cse103) (_ bv0 32) (_ bv0 32))) (.cse101 (select .cse106 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_1 .cse101) (let ((.cse102 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse103 .cse104) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_6 .cse102) (select .cse14 .cse102))) (= (_ bv42 32) (select (select |c_#memory_int| .cse101) (_ bv12 32))) (= v_DerPreprocessor_5 (select (store (store |c_#memory_int| .cse101 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse101)) (= (select (select .cse105 .cse101) (_ bv0 32)) (_ bv0 32)) (= (_ bv42 32) (select v_DerPreprocessor_6 (_ bv12 32))) (= (_ bv0 32) (select (select (store .cse105 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (not (= .cse101 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse105 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse101 v_DerPreprocessor_3) .cse103 .cse104) .cse101) v_DerPreprocessor_3))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse115 (select .cse108 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse109 (select .cse115 (_ bv0 32)))) (let ((.cse107 (select .cse115 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse110 (store (select |c_#memory_$Pointer$.offset| .cse109) (_ bv0 32) (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse107) (= (_ bv42 32) (select (select |c_#memory_int| .cse107) (_ bv12 32))) (= (select (select .cse108 .cse107) (_ bv0 32)) (_ bv0 32)) (not (= .cse109 |c_ULTIMATE.start_create_tree_#res#1.base|)) (not (= .cse107 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse108 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse107 v_DerPreprocessor_3) .cse109 .cse110) .cse107) v_DerPreprocessor_3) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (select (select (store .cse108 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store (store (store |c_#memory_int| .cse107 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse113 v_DerPreprocessor_7))) (let ((.cse112 (select .cse111 (_ bv0 32)))) (and (= v_DerPreprocessor_5 (select .cse111 .cse107)) (= (_ bv42 32) (select .cse112 (_ bv12 32))) (= .cse112 v_DerPreprocessor_6))))) (let ((.cse114 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse109 .cse110) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse114) (select (select |c_#memory_int| .cse113) .cse114)))))))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse120 (select .cse119 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse117 (select .cse120 (_ bv0 32)))) (let ((.cse118 (store (select |c_#memory_$Pointer$.offset| .cse117) (_ bv0 32) (_ bv0 32))) (.cse116 (select .cse120 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_1 .cse116) (= (_ bv42 32) (select (select |c_#memory_int| .cse116) (_ bv12 32))) (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse117 .cse118) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (= (select (select .cse119 .cse116) (_ bv0 32)) (_ bv0 32)) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse7) (= v_DerPreprocessor_5 (select (store (store |c_#memory_int| .cse116 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse116)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store .cse119 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (not (= .cse117 |c_ULTIMATE.start_create_tree_#res#1.base|)) (not (= .cse116 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse119 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse116 v_DerPreprocessor_3) .cse117 .cse118) .cse116) v_DerPreprocessor_3))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse125 (select .cse122 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse123 (select .cse125 (_ bv0 32)))) (let ((.cse124 (store (select |c_#memory_$Pointer$.offset| .cse123) (_ bv0 32) (_ bv0 32))) (.cse121 (select .cse125 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_1 .cse121) (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse7) (= (_ bv42 32) (select (select |c_#memory_int| .cse121) (_ bv12 32))) (= v_DerPreprocessor_5 (select (store (store |c_#memory_int| .cse121 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse121)) (= (select (select .cse122 .cse121) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select (store .cse122 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (not (= .cse121 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse122 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse123 .cse124) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse121 v_DerPreprocessor_3) .cse123 .cse124) .cse121) v_DerPreprocessor_3))))))) (and .cse4 (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse129 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse130 (select .cse129 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse127 (select .cse130 (_ bv0 32)))) (let ((.cse128 (store (select |c_#memory_$Pointer$.offset| .cse127) (_ bv0 32) (_ bv0 32))) (.cse126 (select .cse130 |c_ULTIMATE.start_create_tree_#res#1.offset|))) (and (= v_DerPreprocessor_1 .cse126) (= (_ bv42 32) (select (select |c_#memory_int| .cse126) (_ bv12 32))) (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse127 .cse128) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (= (select (select .cse129 .cse126) (_ bv0 32)) (_ bv0 32)) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse7) (= v_DerPreprocessor_5 (select (store (store |c_#memory_int| .cse126 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse126)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store .cse129 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (not (= .cse126 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse129 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse126 v_DerPreprocessor_3) .cse127 .cse128) .cse126) v_DerPreprocessor_3))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse139 (select .cse132 |c_ULTIMATE.start_create_tree_#res#1.base|))) (let ((.cse133 (select .cse139 (_ bv0 32)))) (let ((.cse131 (select .cse139 |c_ULTIMATE.start_create_tree_#res#1.offset|)) (.cse134 (store (select |c_#memory_$Pointer$.offset| .cse133) (_ bv0 32) (_ bv0 32)))) (and (= v_DerPreprocessor_1 .cse131) (= (_ bv42 32) (select (select |c_#memory_int| .cse131) (_ bv12 32))) (= (select (select .cse132 .cse131) (_ bv0 32)) (_ bv0 32)) (not (= .cse131 |c_ULTIMATE.start_create_tree_#res#1.base|)) (= (select (select (store .cse132 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse131 v_DerPreprocessor_3) .cse133 .cse134) .cse131) v_DerPreprocessor_3) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse137 (select (select (store .cse132 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32)))) (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse135 (store (store (store |c_#memory_int| .cse131 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse137 v_DerPreprocessor_7))) (let ((.cse136 (select .cse135 (_ bv0 32)))) (and (= v_DerPreprocessor_5 (select .cse135 .cse131)) (= (_ bv42 32) (select .cse136 (_ bv12 32))) (= .cse136 v_DerPreprocessor_6))))) (let ((.cse138 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse133 .cse134) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_create_tree_#res#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse138) (select (select |c_#memory_int| .cse137) .cse138))))))))))))))))))) is different from false [2024-11-14 05:09:37,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse54 (select |c_#memory_int| (_ bv0 32)))) (let ((.cse26 (select .cse54 (_ bv12 32))) (.cse22 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse191 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse192 (select .cse191 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse184 (select .cse192 (_ bv0 32)))) (let ((.cse185 (store (select |c_#memory_$Pointer$.offset| .cse184) (_ bv0 32) (_ bv0 32))) (.cse189 (select .cse192 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse190 (store .cse191 (_ bv0 32) v_ArrVal_126))) (let ((.cse186 (select (select .cse190 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse181 (select (select (store .cse190 .cse186 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (and (let ((.cse182 (bvadd (_ bv8 32) (select (select (store (let ((.cse183 (store |c_#memory_$Pointer$.offset| .cse184 .cse185))) (store .cse183 (_ bv0 32) (store (select .cse183 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse186 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse181) .cse182) (select v_DerPreprocessor_7 .cse182))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse188 (store (store (store |c_#memory_int| .cse189 v_DerPreprocessor_5) .cse186 v_DerPreprocessor_6) .cse181 v_DerPreprocessor_7))) (let ((.cse187 (select .cse188 .cse186))) (and (= .cse187 v_DerPreprocessor_6) (= (_ bv42 32) (select .cse187 (_ bv12 32))) (= (select .cse188 .cse189) v_DerPreprocessor_5)))))))))) (= (_ bv42 32) (select (select |c_#memory_int| .cse189) (_ bv12 32))) (not (= .cse189 |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= .cse184 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse191 .cse189) (_ bv0 32))) (= v_DerPreprocessor_1 .cse189) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse189 v_DerPreprocessor_3) .cse184 .cse185) .cse189))))))))) (.cse23 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse180 (select .cse179 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse172 (select .cse180 (_ bv0 32)))) (let ((.cse174 (store (select |c_#memory_$Pointer$.offset| .cse172) (_ bv0 32) (_ bv0 32))) (.cse171 (select .cse180 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (_ bv42 32) (select (select |c_#memory_int| .cse171) (_ bv12 32))) (not (= .cse171 |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= .cse172 |c_ULTIMATE.start_main_~data~0#1.base|)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse178 (store .cse179 (_ bv0 32) v_ArrVal_126))) (let ((.cse175 (select (select .cse178 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (and (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (let ((.cse173 (store |c_#memory_$Pointer$.offset| .cse172 .cse174))) (store .cse173 (_ bv0 32) (store (select .cse173 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse175 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse176 (select (select (store .cse178 .cse175 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse177 (store (store (store |c_#memory_int| .cse171 v_DerPreprocessor_5) .cse175 v_DerPreprocessor_6) .cse176 v_DerPreprocessor_7))) (and (= (select v_DerPreprocessor_7 (_ bv12 32)) (select (select |c_#memory_int| .cse176) (_ bv12 32))) (= (select .cse177 .cse175) v_DerPreprocessor_6) (= (select .cse177 .cse171) v_DerPreprocessor_5) (= .cse175 .cse176))))))))) (= (_ bv0 32) (select (select .cse179 .cse171) (_ bv0 32))) (= v_DerPreprocessor_1 .cse171) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse171 v_DerPreprocessor_3) .cse172 .cse174) .cse171))))))))) (.cse89 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse167 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse170 (store .cse167 (_ bv0 32) v_ArrVal_126))) (let ((.cse165 (select (select .cse170 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse169 (select .cse167 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse162 (select .cse169 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse166 (select (select (store .cse170 .cse165 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse163 (select .cse169 (_ bv0 32))) (.cse168 (store (store (store |c_#memory_int| .cse162 v_DerPreprocessor_5) .cse165 v_DerPreprocessor_6) .cse166 v_DerPreprocessor_7))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse162 v_DerPreprocessor_3) .cse163 v_arrayElimArr_16) .cse162) v_DerPreprocessor_3) (= (_ bv4 32) (select (select (store (let ((.cse164 (store |c_#memory_$Pointer$.offset| .cse163 v_arrayElimArr_16))) (store .cse164 (_ bv0 32) (store (select .cse164 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse165 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= (select v_DerPreprocessor_7 (_ bv12 32)) (select (select |c_#memory_int| .cse166) (_ bv12 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse162) (_ bv12 32))) (not (= .cse162 |c_ULTIMATE.start_main_~data~0#1.base|)) (= .cse162 .cse163) (= (_ bv0 32) (select (select .cse167 .cse162) (_ bv0 32))) (= v_DerPreprocessor_1 .cse162) (= (select .cse168 .cse165) v_DerPreprocessor_6) (= (select .cse168 .cse162) v_DerPreprocessor_5) (= .cse165 .cse166))))))))) (.cse24 (not (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)))) (.cse90 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse161 (store .cse158 (_ bv0 32) v_ArrVal_126))) (let ((.cse155 (select (select .cse161 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse160 (select .cse158 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse157 (select .cse160 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse152 (select (select (store .cse161 .cse155 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse159 (store (store (store |c_#memory_int| .cse157 v_prenex_9) .cse155 v_prenex_10) .cse152 v_prenex_11))) (let ((.cse156 (select .cse159 .cse155)) (.cse154 (select .cse160 (_ bv0 32)))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (let ((.cse151 (bvadd (_ bv8 32) (select (select (store (let ((.cse153 (store |c_#memory_$Pointer$.offset| .cse154 v_arrayElimArr_16))) (store .cse153 (_ bv0 32) (store (select .cse153 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse155 v_prenex_12) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))))) (= (select v_prenex_11 .cse151) (select (select |c_#memory_int| .cse152) .cse151))) (= (_ bv42 32) (select .cse156 (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse157 v_DerPreprocessor_3) .cse154 v_arrayElimArr_16) .cse157) v_DerPreprocessor_3) (= (_ bv42 32) (select (select |c_#memory_int| .cse157) (_ bv12 32))) (= .cse156 v_prenex_10) (not (= .cse157 |c_ULTIMATE.start_main_~data~0#1.base|)) (= .cse157 .cse154) (= (_ bv0 32) (select (select .cse158 .cse157) (_ bv0 32))) (= v_DerPreprocessor_1 .cse157) (= (select .cse159 .cse157) v_prenex_9)))))))))) (.cse91 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse147 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse150 (store .cse147 (_ bv0 32) v_ArrVal_126))) (let ((.cse144 (select (select .cse150 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse149 (select .cse147 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse146 (select .cse149 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse141 (select (select (store .cse150 .cse144 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse148 (store (store (store |c_#memory_int| .cse146 v_prenex_9) .cse144 v_prenex_10) .cse141 v_prenex_11))) (let ((.cse145 (select .cse148 .cse144)) (.cse143 (select .cse149 (_ bv0 32)))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (let ((.cse140 (bvadd (_ bv8 32) (select (select (store (let ((.cse142 (store |c_#memory_$Pointer$.offset| .cse143 v_arrayElimArr_16))) (store .cse142 (_ bv0 32) (store (select .cse142 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse144 v_prenex_12) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))))) (= (select v_prenex_11 .cse140) (select (select |c_#memory_int| .cse141) .cse140))) (= (_ bv42 32) (select .cse145 (_ bv12 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse146 v_DerPreprocessor_3) .cse143 v_arrayElimArr_16) .cse146) v_DerPreprocessor_3) (= (_ bv42 32) (select (select |c_#memory_int| .cse146) (_ bv12 32))) (= .cse145 v_prenex_10) (not (= .cse146 |c_ULTIMATE.start_main_~data~0#1.base|)) (= .cse146 .cse143) (= (_ bv0 32) (select (select .cse147 .cse146) (_ bv0 32))) (= v_DerPreprocessor_1 .cse146) (= (select .cse148 .cse146) v_prenex_9) (= .cse144 .cse141)))))))))) (.cse25 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)))) (or (and (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse9 (store .cse3 (_ bv0 32) v_ArrVal_126))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse8 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse0 (select (select (store .cse9 .cse5 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse2 (select .cse8 (_ bv0 32)))) (let ((.cse7 (store (select |c_#memory_$Pointer$.offset| .cse2) (_ bv0 32) (_ bv0 32))) (.cse4 (store (store (store |c_#memory_int| .cse1 v_DerPreprocessor_5) .cse5 v_DerPreprocessor_6) .cse0 v_DerPreprocessor_7))) (and (= (select v_DerPreprocessor_7 (_ bv12 32)) (select (select |c_#memory_int| .cse0) (_ bv12 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse1) (_ bv12 32))) (not (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse3 .cse1) (_ bv0 32))) (= v_DerPreprocessor_1 .cse1) (= (select .cse4 .cse5) v_DerPreprocessor_6) (= (_ bv4 32) (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse2 .cse7))) (store .cse6 (_ bv0 32) (store (select .cse6 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse5 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_3) .cse2 .cse7) .cse1)) (= (select .cse4 .cse1) v_DerPreprocessor_5) (= .cse5 .cse0)))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse21 (store .cse12 (_ bv0 32) v_ArrVal_126))) (let ((.cse17 (select (select .cse21 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse20 (select .cse12 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse10 (select .cse20 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse13 (select (select (store .cse21 .cse17 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse11 (select .cse20 (_ bv0 32))) (.cse19 (store (store (store |c_#memory_int| .cse10 v_DerPreprocessor_5) .cse17 v_DerPreprocessor_6) .cse13 v_DerPreprocessor_7))) (let ((.cse18 (select .cse19 .cse17)) (.cse16 (store (select |c_#memory_$Pointer$.offset| .cse11) (_ bv0 32) (_ bv0 32)))) (and (= (_ bv42 32) (select (select |c_#memory_int| .cse10) (_ bv12 32))) (not (= .cse10 |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= .cse11 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse12 .cse10) (_ bv0 32))) (let ((.cse14 (bvadd (_ bv8 32) (select (select (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse11 .cse16))) (store .cse15 (_ bv0 32) (store (select .cse15 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse17 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse13) .cse14) (select v_DerPreprocessor_7 .cse14))) (= v_DerPreprocessor_1 .cse10) (= .cse18 v_DerPreprocessor_6) (= (_ bv42 32) (select .cse18 (_ bv12 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_3) .cse11 .cse16) .cse10)) (= (select .cse19 .cse10) v_DerPreprocessor_5) (= .cse17 .cse13))))))))) .cse22 .cse23 (and (or .cse22 .cse23) .cse24)) .cse25) (and .cse25 (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse31 (select .cse28 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse29 (select .cse31 (_ bv0 32)))) (let ((.cse27 (select .cse31 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse30 (store (select |c_#memory_$Pointer$.offset| .cse29) (_ bv0 32) (_ bv0 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse26) (= (select (store (store |c_#memory_int| .cse27 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse27) v_DerPreprocessor_5) (= (_ bv42 32) (select (select |c_#memory_int| .cse27) (_ bv12 32))) (= (_ bv0 32) (select (select (store .cse28 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (not (= .cse27 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse28 .cse27) (_ bv0 32))) (= v_DerPreprocessor_1 .cse27) (= (_ bv0 32) (select (select (store .cse28 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse27 v_DerPreprocessor_3) .cse29 .cse30) .cse27)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse29 .cse30) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv4 32)))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse36 (select .cse34 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse33 (select .cse36 (_ bv0 32)))) (let ((.cse35 (store (select |c_#memory_$Pointer$.offset| .cse33) (_ bv0 32) (_ bv0 32))) (.cse32 (select .cse36 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse26) (= (select (store (store |c_#memory_int| .cse32 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse32) v_DerPreprocessor_5))) (= (_ bv42 32) (select (select |c_#memory_int| .cse32) (_ bv12 32))) (not (= .cse32 |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= .cse33 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse34 .cse32) (_ bv0 32))) (= v_DerPreprocessor_1 .cse32) (= (_ bv0 32) (select (select (store .cse34 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse33 .cse35) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv4 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse32 v_DerPreprocessor_3) .cse33 .cse35) .cse32)) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store .cse34 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))))))))) (and (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse41 (select .cse38 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse39 (select .cse41 (_ bv0 32)))) (let ((.cse40 (store (select |c_#memory_$Pointer$.offset| .cse39) (_ bv0 32) (_ bv0 32))) (.cse37 (select .cse41 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse26) (= (select (store (store |c_#memory_int| .cse37 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse37) v_DerPreprocessor_5))) (= (_ bv42 32) (select (select |c_#memory_int| .cse37) (_ bv12 32))) (not (= .cse37 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse38 .cse37) (_ bv0 32))) (= v_DerPreprocessor_1 .cse37) (= (_ bv0 32) (select (select (store .cse38 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse39 .cse40) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv4 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse37 v_DerPreprocessor_3) .cse39 .cse40) .cse37)) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store .cse38 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse50 (select .cse43 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse44 (select .cse50 (_ bv0 32)))) (let ((.cse42 (select .cse50 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse45 (store (select |c_#memory_$Pointer$.offset| .cse44) (_ bv0 32) (_ bv0 32)))) (and (= (_ bv42 32) (select (select |c_#memory_int| .cse42) (_ bv12 32))) (not (= .cse42 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse43 .cse42) (_ bv0 32))) (= v_DerPreprocessor_1 .cse42) (= (_ bv0 32) (select (select (store .cse43 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse42 v_DerPreprocessor_3) .cse44 .cse45) .cse42)) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select (select (store .cse43 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store (store (store |c_#memory_int| .cse42 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse48 v_DerPreprocessor_7))) (let ((.cse47 (select .cse46 (_ bv0 32)))) (and (= (select .cse46 .cse42) v_DerPreprocessor_5) (= v_DerPreprocessor_6 .cse47) (= (_ bv42 32) (select .cse47 (_ bv12 32))))))) (let ((.cse49 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse44 .cse45) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv8 32)))) (= (select v_DerPreprocessor_7 .cse49) (select (select |c_#memory_int| .cse48) .cse49))))))))))))) .cse24) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse57 (select .cse52 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse55 (select .cse57 (_ bv0 32)))) (let ((.cse56 (store (select |c_#memory_$Pointer$.offset| .cse55) (_ bv0 32) (_ bv0 32))) (.cse51 (select .cse57 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (store (store |c_#memory_int| .cse51 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse51) v_DerPreprocessor_5) (= (_ bv42 32) (select v_DerPreprocessor_6 (_ bv12 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse51) (_ bv12 32))) (= (_ bv0 32) (select (select (store .cse52 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (not (= .cse51 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse52 .cse51) (_ bv0 32))) (let ((.cse53 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse55 .cse56) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv8 32)))) (= (select v_DerPreprocessor_6 .cse53) (select .cse54 .cse53))) (= v_DerPreprocessor_1 .cse51) (= (_ bv0 32) (select (select (store .cse52 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse51 v_DerPreprocessor_3) .cse55 .cse56) .cse51)))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse66 (select .cse60 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse59 (select .cse66 (_ bv0 32)))) (let ((.cse58 (select .cse66 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse61 (store (select |c_#memory_$Pointer$.offset| .cse59) (_ bv0 32) (_ bv0 32)))) (and (= (_ bv42 32) (select (select |c_#memory_int| .cse58) (_ bv12 32))) (not (= .cse58 |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= .cse59 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse60 .cse58) (_ bv0 32))) (= v_DerPreprocessor_1 .cse58) (= (_ bv0 32) (select (select (store .cse60 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse58 v_DerPreprocessor_3) .cse59 .cse61) .cse58)) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select (select (store .cse60 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (and (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store (store (store |c_#memory_int| .cse58 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse64 v_DerPreprocessor_7))) (let ((.cse63 (select .cse62 (_ bv0 32)))) (and (= (select .cse62 .cse58) v_DerPreprocessor_5) (= v_DerPreprocessor_6 .cse63) (= (_ bv42 32) (select .cse63 (_ bv12 32))))))) (let ((.cse65 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse59 .cse61) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv8 32)))) (= (select v_DerPreprocessor_7 .cse65) (select (select |c_#memory_int| .cse64) .cse65)))))))))))))) (and (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse70 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_8 v_DerPreprocessor_9))) (let ((.cse69 (select .cse70 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse67 (select .cse69 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= v_DerPreprocessor_8 .cse67) (= (_ bv42 32) (select (select |c_#memory_int| .cse67) (_ bv12 32))) (= (select (let ((.cse68 (select .cse69 (_ bv0 32)))) (store (store |c_#memory_$Pointer$.offset| .cse67 v_DerPreprocessor_10) .cse68 (store (select |c_#memory_$Pointer$.offset| .cse68) (_ bv0 32) (_ bv0 32)))) .cse67) v_DerPreprocessor_10) (not (= |c_ULTIMATE.start_main_~data~0#1.base| .cse67)) (= (_ bv0 32) (select (select .cse70 .cse67) (_ bv0 32)))))))) .cse25) (and .cse25 (let ((.cse76 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse88 (select .cse84 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse81 (select .cse88 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse86 (select (select (store .cse84 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse83 (store (store (store |c_#memory_int| .cse81 v_prenex_9) (_ bv0 32) v_prenex_10) .cse86 v_prenex_11))) (let ((.cse82 (select .cse88 (_ bv0 32))) (.cse85 (select .cse83 (_ bv0 32)))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse81 v_DerPreprocessor_3) .cse82 v_arrayElimArr_16) .cse81) v_DerPreprocessor_3) (= (select .cse83 .cse81) v_prenex_9) (= (_ bv42 32) (select (select |c_#memory_int| .cse81) (_ bv12 32))) (not (= .cse81 |c_ULTIMATE.start_main_~data~0#1.base|)) (= .cse81 .cse82) (= (_ bv0 32) (select (select .cse84 .cse81) (_ bv0 32))) (= v_DerPreprocessor_1 .cse81) (= (_ bv42 32) (select .cse85 (_ bv12 32))) (= (_ bv0 32) (select (select (store .cse84 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (let ((.cse87 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse82 v_arrayElimArr_16) (_ bv0 32) v_prenex_12) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse86) .cse87) (select v_prenex_11 .cse87))) (= .cse85 v_prenex_10)))))))))) (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse72 (select .cse75 (_ bv0 32))) (.cse73 (select .cse75 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (let ((.cse71 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse72 v_arrayElimArr_16) (_ bv0 32) v_prenex_12) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))))) (= (select .cse54 .cse71) (select v_prenex_10 .cse71))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse73 v_DerPreprocessor_3) .cse72 v_arrayElimArr_16) .cse73) v_DerPreprocessor_3) (= (_ bv42 32) (select (select |c_#memory_int| .cse73) (_ bv12 32))) (= (_ bv0 32) (select (select (store .cse74 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (not (= .cse73 |c_ULTIMATE.start_main_~data~0#1.base|)) (= .cse73 .cse72) (= (_ bv0 32) (select (select .cse74 .cse73) (_ bv0 32))) (= (select (store (store |c_#memory_int| .cse73 v_prenex_9) (_ bv0 32) v_prenex_10) .cse73) v_prenex_9) (= v_DerPreprocessor_1 .cse73) (= (_ bv0 32) (select (select (store .cse74 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= (select v_prenex_10 (_ bv12 32)) (_ bv42 32))))))) (and .cse76 .cse24) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse78 (select .cse80 (_ bv0 32))) (.cse77 (select .cse80 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse26) (= (select (store (store |c_#memory_int| .cse77 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse77) v_DerPreprocessor_5) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse78 v_arrayElimArr_16) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse77 v_DerPreprocessor_3) .cse78 v_arrayElimArr_16) .cse77) v_DerPreprocessor_3) (= (_ bv42 32) (select (select |c_#memory_int| .cse77) (_ bv12 32))) (= (_ bv0 32) (select (select (store .cse79 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (not (= .cse77 |c_ULTIMATE.start_main_~data~0#1.base|)) (= .cse77 .cse78) (= (_ bv0 32) (select (select .cse79 .cse77) (_ bv0 32))) (= v_DerPreprocessor_1 .cse77) (= (_ bv0 32) (select (select (store .cse79 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))))))) .cse76))) (and (or (and (or .cse89 .cse90 .cse91) .cse25) (and (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse101 (store .cse94 (_ bv0 32) v_ArrVal_126))) (let ((.cse96 (select (select .cse101 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse100 (select .cse94 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse93 (select .cse100 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse92 (select (select (store .cse101 .cse96 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse98 (select .cse100 (_ bv0 32)))) (let ((.cse99 (store (select |c_#memory_$Pointer$.offset| .cse98) (_ bv0 32) (_ bv0 32))) (.cse95 (store (store (store |c_#memory_int| .cse93 v_DerPreprocessor_5) .cse96 v_DerPreprocessor_6) .cse92 v_DerPreprocessor_7))) (and (= (select v_DerPreprocessor_7 (_ bv12 32)) (select (select |c_#memory_int| .cse92) (_ bv12 32))) (= (_ bv42 32) (select (select |c_#memory_int| .cse93) (_ bv12 32))) (not (= .cse93 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse94 .cse93) (_ bv0 32))) (= v_DerPreprocessor_1 .cse93) (= (select .cse95 .cse96) v_DerPreprocessor_6) (= (_ bv4 32) (select (select (store (let ((.cse97 (store |c_#memory_$Pointer$.offset| .cse98 .cse99))) (store .cse97 (_ bv0 32) (store (select .cse97 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse96 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse93 v_DerPreprocessor_3) .cse98 .cse99) .cse93)) (= (select .cse95 .cse93) v_DerPreprocessor_5) (= .cse96 .cse92)))))))) .cse22 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse113 (store .cse103 (_ bv0 32) v_ArrVal_126))) (let ((.cse109 (select (select .cse113 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))) (.cse112 (select .cse103 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse102 (select .cse112 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse104 (select (select (store .cse113 .cse109 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse107 (select .cse112 (_ bv0 32))) (.cse111 (store (store (store |c_#memory_int| .cse102 v_DerPreprocessor_5) .cse109 v_DerPreprocessor_6) .cse104 v_DerPreprocessor_7))) (let ((.cse110 (select .cse111 .cse109)) (.cse108 (store (select |c_#memory_$Pointer$.offset| .cse107) (_ bv0 32) (_ bv0 32)))) (and (= (_ bv42 32) (select (select |c_#memory_int| .cse102) (_ bv12 32))) (not (= .cse102 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse103 .cse102) (_ bv0 32))) (let ((.cse105 (bvadd (_ bv8 32) (select (select (store (let ((.cse106 (store |c_#memory_$Pointer$.offset| .cse107 .cse108))) (store .cse106 (_ bv0 32) (store (select .cse106 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse109 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse104) .cse105) (select v_DerPreprocessor_7 .cse105))) (= v_DerPreprocessor_1 .cse102) (= .cse110 v_DerPreprocessor_6) (= (_ bv42 32) (select .cse110 (_ bv12 32))) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse102 v_DerPreprocessor_3) .cse107 .cse108) .cse102)) (= (select .cse111 .cse102) v_DerPreprocessor_5) (= .cse109 .cse104))))))))) .cse23 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse123 (select .cse122 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse116 (select .cse123 (_ bv0 32)))) (let ((.cse117 (store (select |c_#memory_$Pointer$.offset| .cse116) (_ bv0 32) (_ bv0 32))) (.cse114 (select .cse123 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (_ bv42 32) (select (select |c_#memory_int| .cse114) (_ bv12 32))) (not (= .cse114 |c_ULTIMATE.start_main_~data~0#1.base|)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse121 (store .cse122 (_ bv0 32) v_ArrVal_126))) (let ((.cse118 (select (select .cse121 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (and (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (let ((.cse115 (store |c_#memory_$Pointer$.offset| .cse116 .cse117))) (store .cse115 (_ bv0 32) (store (select .cse115 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse118 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (select (select (store .cse121 .cse118 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse120 (store (store (store |c_#memory_int| .cse114 v_DerPreprocessor_5) .cse118 v_DerPreprocessor_6) .cse119 v_DerPreprocessor_7))) (and (= (select v_DerPreprocessor_7 (_ bv12 32)) (select (select |c_#memory_int| .cse119) (_ bv12 32))) (= (select .cse120 .cse118) v_DerPreprocessor_6) (= (select .cse120 .cse114) v_DerPreprocessor_5) (= .cse118 .cse119))))))))) (= (_ bv0 32) (select (select .cse122 .cse114) (_ bv0 32))) (= v_DerPreprocessor_1 .cse114) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse114 v_DerPreprocessor_3) .cse116 .cse117) .cse114)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse134 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse135 (select .cse134 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse127 (select .cse135 (_ bv0 32)))) (let ((.cse128 (store (select |c_#memory_$Pointer$.offset| .cse127) (_ bv0 32) (_ bv0 32))) (.cse132 (select .cse135 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse133 (store .cse134 (_ bv0 32) v_ArrVal_126))) (let ((.cse129 (select (select .cse133 |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (let ((.cse124 (select (select (store .cse133 .cse129 v_ArrVal_131) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (and (let ((.cse125 (bvadd (_ bv8 32) (select (select (store (let ((.cse126 (store |c_#memory_$Pointer$.offset| .cse127 .cse128))) (store .cse126 (_ bv0 32) (store (select .cse126 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse129 v_ArrVal_127) |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32))))) (= (select (select |c_#memory_int| .cse124) .cse125) (select v_DerPreprocessor_7 .cse125))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse131 (store (store (store |c_#memory_int| .cse132 v_DerPreprocessor_5) .cse129 v_DerPreprocessor_6) .cse124 v_DerPreprocessor_7))) (let ((.cse130 (select .cse131 .cse129))) (and (= .cse130 v_DerPreprocessor_6) (= (_ bv42 32) (select .cse130 (_ bv12 32))) (= (select .cse131 .cse132) v_DerPreprocessor_5)))))))))) (= (_ bv42 32) (select (select |c_#memory_int| .cse132) (_ bv12 32))) (not (= .cse132 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select .cse134 .cse132) (_ bv0 32))) (= v_DerPreprocessor_1 .cse132) (= v_DerPreprocessor_3 (select (store (store |c_#memory_$Pointer$.offset| .cse132 v_DerPreprocessor_3) .cse127 .cse128) .cse132))))))))) .cse25)) .cse24) (and (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse138 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_8 v_DerPreprocessor_9))) (let ((.cse139 (select .cse138 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse137 (select .cse139 (_ bv0 32))) (.cse136 (select .cse139 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= v_DerPreprocessor_8 .cse136) (= (select (store (store |c_#memory_$Pointer$.offset| .cse136 v_DerPreprocessor_10) .cse137 v_arrayElimArr_38) .cse136) v_DerPreprocessor_10) (= (_ bv42 32) (select (select |c_#memory_int| .cse136) (_ bv12 32))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| .cse136)) (= .cse137 .cse136) (= (_ bv0 32) (select (select .cse138 .cse136) (_ bv0 32))) (= (_ bv0 32) (select v_arrayElimArr_38 (_ bv0 32)))))))) .cse25) (and (or .cse89 (and .cse90 .cse24) .cse90 .cse91) .cse25)))) is different from false [2024-11-14 05:09:53,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse70 (select |c_#memory_int| (_ bv0 32)))) (let ((.cse2 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse188 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse192 (store .cse188 (_ bv0 32) v_ArrVal_126))) (let ((.cse186 (select (select .cse192 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse191 (select .cse188 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse189 (select .cse191 |c_ULTIMATE.start_inspect_~node#1.offset|)) (.cse183 (select (select (store .cse192 .cse186 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse190 (store (store (store |c_#memory_int| .cse189 v_prenex_9) .cse186 v_prenex_10) .cse183 v_prenex_11))) (let ((.cse187 (select .cse190 .cse186)) (.cse185 (select .cse191 (_ bv0 32)))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (let ((.cse182 (bvadd (_ bv8 32) (select (select (store (let ((.cse184 (store |c_#memory_$Pointer$.offset| .cse185 v_arrayElimArr_16))) (store .cse184 (_ bv0 32) (store (select .cse184 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse186 v_prenex_12) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select v_prenex_11 .cse182) (select (select |c_#memory_int| .cse183) .cse182))) (= (_ bv42 32) (select .cse187 (_ bv12 32))) (= (_ bv0 32) (select (select .cse188 .cse189) (_ bv0 32))) (= .cse187 v_prenex_10) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse189)) (= .cse185 .cse189) (= (select (select |c_#memory_int| .cse189) (_ bv12 32)) (_ bv42 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse189 v_DerPreprocessor_3) .cse185 v_arrayElimArr_16) .cse189) v_DerPreprocessor_3) (= (select .cse190 .cse189) v_prenex_9) (= .cse186 .cse183) (= v_DerPreprocessor_1 .cse189)))))))))) (.cse3 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse181 (store .cse173 (_ bv0 32) v_ArrVal_126))) (let ((.cse176 (select (select .cse181 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse180 (select .cse173 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse174 (select .cse180 |c_ULTIMATE.start_inspect_~node#1.offset|)) (.cse179 (select (select (store .cse181 .cse176 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse177 (select .cse180 (_ bv0 32))) (.cse175 (store (store (store |c_#memory_int| .cse174 v_DerPreprocessor_5) .cse176 v_DerPreprocessor_6) .cse179 v_DerPreprocessor_7))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (_ bv0 32) (select (select .cse173 .cse174) (_ bv0 32))) (= (select .cse175 .cse176) v_DerPreprocessor_6) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse174)) (= .cse177 .cse174) (= (select (select |c_#memory_int| .cse174) (_ bv12 32)) (_ bv42 32)) (= (_ bv4 32) (select (select (store (let ((.cse178 (store |c_#memory_$Pointer$.offset| .cse177 v_arrayElimArr_16))) (store .cse178 (_ bv0 32) (store (select .cse178 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse176 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse174 v_DerPreprocessor_3) .cse177 v_arrayElimArr_16) .cse174) v_DerPreprocessor_3) (= .cse176 .cse179) (= (select (select |c_#memory_int| .cse179) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (select .cse175 .cse174) v_DerPreprocessor_5) (= v_DerPreprocessor_1 .cse174))))))))) (.cse4 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse168 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse172 (store .cse168 (_ bv0 32) v_ArrVal_126))) (let ((.cse166 (select (select .cse172 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse171 (select .cse168 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse169 (select .cse171 |c_ULTIMATE.start_inspect_~node#1.offset|)) (.cse163 (select (select (store .cse172 .cse166 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse170 (store (store (store |c_#memory_int| .cse169 v_prenex_9) .cse166 v_prenex_10) .cse163 v_prenex_11))) (let ((.cse167 (select .cse170 .cse166)) (.cse165 (select .cse171 (_ bv0 32)))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (let ((.cse162 (bvadd (_ bv8 32) (select (select (store (let ((.cse164 (store |c_#memory_$Pointer$.offset| .cse165 v_arrayElimArr_16))) (store .cse164 (_ bv0 32) (store (select .cse164 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse166 v_prenex_12) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select v_prenex_11 .cse162) (select (select |c_#memory_int| .cse163) .cse162))) (= (_ bv42 32) (select .cse167 (_ bv12 32))) (= (_ bv0 32) (select (select .cse168 .cse169) (_ bv0 32))) (= .cse167 v_prenex_10) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse169)) (= .cse165 .cse169) (= (select (select |c_#memory_int| .cse169) (_ bv12 32)) (_ bv42 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse169 v_DerPreprocessor_3) .cse165 v_arrayElimArr_16) .cse169) v_DerPreprocessor_3) (= (select .cse170 .cse169) v_prenex_9) (= v_DerPreprocessor_1 .cse169)))))))))) (.cse27 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse160 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse161 (select .cse160 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse153 (select .cse161 (_ bv0 32)))) (let ((.cse154 (store (select |c_#memory_$Pointer$.offset| .cse153) (_ bv0 32) (_ bv0 32))) (.cse158 (select .cse161 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse159 (store .cse160 (_ bv0 32) v_ArrVal_126))) (let ((.cse155 (select (select .cse159 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse151 (select (select (store .cse159 .cse155 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (and (let ((.cse150 (bvadd (_ bv8 32) (select (select (store (let ((.cse152 (store |c_#memory_$Pointer$.offset| .cse153 .cse154))) (store .cse152 (_ bv0 32) (store (select .cse152 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse155 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse150) (select (select |c_#memory_int| .cse151) .cse150))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse157 (store (store (store |c_#memory_int| .cse158 v_DerPreprocessor_5) .cse155 v_DerPreprocessor_6) .cse151 v_DerPreprocessor_7))) (let ((.cse156 (select .cse157 .cse155))) (and (= .cse156 v_DerPreprocessor_6) (= (select .cse157 .cse158) v_DerPreprocessor_5) (= (_ bv42 32) (select .cse156 (_ bv12 32)))))))))))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse158 v_DerPreprocessor_3) .cse153 .cse154) .cse158) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse160 .cse158) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse153)) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse158)) (= (select (select |c_#memory_int| .cse158) (_ bv12 32)) (_ bv42 32)) (= v_DerPreprocessor_1 .cse158)))))))) (.cse50 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse143 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse149 (select .cse143 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse141 (select .cse149 (_ bv0 32)))) (let ((.cse142 (store (select |c_#memory_$Pointer$.offset| .cse141) (_ bv0 32) (_ bv0 32))) (.cse140 (select .cse149 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse140 v_DerPreprocessor_3) .cse141 .cse142) .cse140) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse143 .cse140) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse141)) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse140)) (= (select (select |c_#memory_int| .cse140) (_ bv12 32)) (_ bv42 32)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse148 (store .cse143 (_ bv0 32) v_ArrVal_126))) (let ((.cse145 (select (select .cse148 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (and (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (let ((.cse144 (store |c_#memory_$Pointer$.offset| .cse141 .cse142))) (store .cse144 (_ bv0 32) (store (select .cse144 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse145 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse147 (select (select (store .cse148 .cse145 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse146 (store (store (store |c_#memory_int| .cse140 v_DerPreprocessor_5) .cse145 v_DerPreprocessor_6) .cse147 v_DerPreprocessor_7))) (and (= (select .cse146 .cse145) v_DerPreprocessor_6) (= .cse145 .cse147) (= (select (select |c_#memory_int| .cse147) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (select .cse146 .cse140) v_DerPreprocessor_5))))))))) (= v_DerPreprocessor_1 .cse140)))))))) (.cse1 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_inspect_~node#1.base|) |c_ULTIMATE.start_inspect_~node#1.offset|))) (.cse64 (select .cse70 (_ bv12 32))) (.cse0 (not (= (_ bv0 32) |c_ULTIMATE.start_inspect_~node#1.offset|)))) (or (and .cse0 (or (and .cse1 (or .cse2 .cse3 .cse4)) (and (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse14 (store .cse8 (_ bv0 32) v_ArrVal_126))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse13 (select .cse8 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_inspect_~node#1.offset|)) (.cse11 (select (select (store .cse14 .cse10 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse6 (select .cse13 (_ bv0 32)))) (let ((.cse7 (store (select |c_#memory_$Pointer$.offset| .cse6) (_ bv0 32) (_ bv0 32))) (.cse9 (store (store (store |c_#memory_int| .cse5 v_DerPreprocessor_5) .cse10 v_DerPreprocessor_6) .cse11 v_DerPreprocessor_7))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_3) .cse6 .cse7) .cse5) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse8 .cse5) (_ bv0 32))) (= (select .cse9 .cse10) v_DerPreprocessor_6) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse5)) (= (select (select |c_#memory_int| .cse5) (_ bv12 32)) (_ bv42 32)) (= .cse10 .cse11) (= (select (select |c_#memory_int| .cse11) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (_ bv4 32) (select (select (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse6 .cse7))) (store .cse12 (_ bv0 32) (store (select .cse12 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse10 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (select .cse9 .cse5) v_DerPreprocessor_5) (= v_DerPreprocessor_1 .cse5)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse18 (select .cse26 (_ bv0 32)))) (let ((.cse19 (store (select |c_#memory_$Pointer$.offset| .cse18) (_ bv0 32) (_ bv0 32))) (.cse23 (select .cse26 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store .cse25 (_ bv0 32) v_ArrVal_126))) (let ((.cse20 (select (select .cse24 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse16 (select (select (store .cse24 .cse20 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (and (let ((.cse15 (bvadd (_ bv8 32) (select (select (store (let ((.cse17 (store |c_#memory_$Pointer$.offset| .cse18 .cse19))) (store .cse17 (_ bv0 32) (store (select .cse17 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse20 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse15) (select (select |c_#memory_int| .cse16) .cse15))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store (store (store |c_#memory_int| .cse23 v_DerPreprocessor_5) .cse20 v_DerPreprocessor_6) .cse16 v_DerPreprocessor_7))) (let ((.cse21 (select .cse22 .cse20))) (and (= .cse21 v_DerPreprocessor_6) (= (select .cse22 .cse23) v_DerPreprocessor_5) (= (_ bv42 32) (select .cse21 (_ bv12 32)))))))))))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse23 v_DerPreprocessor_3) .cse18 .cse19) .cse23) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse25 .cse23) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse23)) (= (select (select |c_#memory_int| .cse23) (_ bv12 32)) (_ bv42 32)) (= v_DerPreprocessor_1 .cse23))))))) .cse27 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse39 (store .cse31 (_ bv0 32) v_ArrVal_126))) (let ((.cse36 (select (select .cse39 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse38 (select .cse31 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse28 (select .cse38 |c_ULTIMATE.start_inspect_~node#1.offset|)) (.cse34 (select (select (store .cse39 .cse36 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse37 (store (store (store |c_#memory_int| .cse28 v_DerPreprocessor_5) .cse36 v_DerPreprocessor_6) .cse34 v_DerPreprocessor_7)) (.cse29 (select .cse38 (_ bv0 32)))) (let ((.cse30 (store (select |c_#memory_$Pointer$.offset| .cse29) (_ bv0 32) (_ bv0 32))) (.cse32 (select .cse37 .cse36))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse28 v_DerPreprocessor_3) .cse29 .cse30) .cse28) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse31 .cse28) (_ bv0 32))) (= .cse32 v_DerPreprocessor_6) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse28)) (let ((.cse33 (bvadd (_ bv8 32) (select (select (store (let ((.cse35 (store |c_#memory_$Pointer$.offset| .cse29 .cse30))) (store .cse35 (_ bv0 32) (store (select .cse35 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse36 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse33) (select (select |c_#memory_int| .cse34) .cse33))) (= (select (select |c_#memory_int| .cse28) (_ bv12 32)) (_ bv42 32)) (= .cse36 .cse34) (= (select .cse37 .cse28) v_DerPreprocessor_5) (= v_DerPreprocessor_1 .cse28) (= (_ bv42 32) (select .cse32 (_ bv12 32))))))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse49 (select .cse43 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse41 (select .cse49 (_ bv0 32)))) (let ((.cse42 (store (select |c_#memory_$Pointer$.offset| .cse41) (_ bv0 32) (_ bv0 32))) (.cse40 (select .cse49 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse40 v_DerPreprocessor_3) .cse41 .cse42) .cse40) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse43 .cse40) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse40)) (= (select (select |c_#memory_int| .cse40) (_ bv12 32)) (_ bv42 32)) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store .cse43 (_ bv0 32) v_ArrVal_126))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (and (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (let ((.cse44 (store |c_#memory_$Pointer$.offset| .cse41 .cse42))) (store .cse44 (_ bv0 32) (store (select .cse44 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse45 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select (select (store .cse48 .cse45 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse46 (store (store (store |c_#memory_int| .cse40 v_DerPreprocessor_5) .cse45 v_DerPreprocessor_6) .cse47 v_DerPreprocessor_7))) (and (= (select .cse46 .cse45) v_DerPreprocessor_6) (= .cse45 .cse47) (= (select (select |c_#memory_int| .cse47) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (select .cse46 .cse40) v_DerPreprocessor_5))))))))) (= v_DerPreprocessor_1 .cse40))))))) .cse50) .cse1))) (and .cse1 (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse59 (select .cse54 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse52 (select .cse59 (_ bv0 32)))) (let ((.cse53 (store (select |c_#memory_$Pointer$.offset| .cse52) (_ bv0 32) (_ bv0 32))) (.cse51 (select .cse59 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse51 v_DerPreprocessor_3) .cse52 .cse53) .cse51) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse54 .cse51) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse52)) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse51)) (= (select (select |c_#memory_int| .cse51) (_ bv12 32)) (_ bv42 32)) (= (_ bv0 32) (select (select (store .cse54 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select (select (store .cse54 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (and (let ((.cse55 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse52 .cse53) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse55) (select (select |c_#memory_int| .cse56) .cse55))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store (store (store |c_#memory_int| .cse51 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse56 v_DerPreprocessor_7))) (let ((.cse57 (select .cse58 (_ bv0 32)))) (and (= (_ bv42 32) (select .cse57 (_ bv12 32))) (= v_DerPreprocessor_6 .cse57) (= v_DerPreprocessor_5 (select .cse58 .cse51))))))))) (= v_DerPreprocessor_1 .cse51))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse65 (select .cse63 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse61 (select .cse65 (_ bv0 32)))) (let ((.cse62 (store (select |c_#memory_$Pointer$.offset| .cse61) (_ bv0 32) (_ bv0 32))) (.cse60 (select .cse65 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse60 v_DerPreprocessor_3) .cse61 .cse62) .cse60) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse63 .cse60) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse61)) (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse61 .cse62) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse60)) (= (select (select |c_#memory_int| .cse60) (_ bv12 32)) (_ bv42 32)) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse64) (= (select (store (store |c_#memory_int| .cse60 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse60) v_DerPreprocessor_5))) (= (_ bv0 32) (select (select (store .cse63 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store .cse63 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (= v_DerPreprocessor_1 .cse60))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse72 (select .cse66 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse68 (select .cse72 (_ bv0 32)))) (let ((.cse69 (store (select |c_#memory_$Pointer$.offset| .cse68) (_ bv0 32) (_ bv0 32))) (.cse67 (select .cse72 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (_ bv0 32) (select (select (store .cse66 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (select (store (store |c_#memory_$Pointer$.offset| .cse67 v_DerPreprocessor_3) .cse68 .cse69) .cse67) v_DerPreprocessor_3) (= (_ bv42 32) (select v_DerPreprocessor_6 (_ bv12 32))) (= (_ bv0 32) (select (select .cse66 .cse67) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse67)) (let ((.cse71 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse68 .cse69) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select .cse70 .cse71) (select v_DerPreprocessor_6 .cse71))) (= (select (select |c_#memory_int| .cse67) (_ bv12 32)) (_ bv42 32)) (= (select (store (store |c_#memory_int| .cse67 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse67) v_DerPreprocessor_5) (= (_ bv0 32) (select (select (store .cse66 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= v_DerPreprocessor_1 .cse67))))))) (and .cse0 (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse77 (select .cse76 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse74 (select .cse77 (_ bv0 32)))) (let ((.cse75 (store (select |c_#memory_$Pointer$.offset| .cse74) (_ bv0 32) (_ bv0 32))) (.cse73 (select .cse77 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse73 v_DerPreprocessor_3) .cse74 .cse75) .cse73) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse76 .cse73) (_ bv0 32))) (exists ((v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse74 .cse75) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse73)) (= (select (select |c_#memory_int| .cse73) (_ bv12 32)) (_ bv42 32)) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse64) (= (select (store (store |c_#memory_int| .cse73 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse73) v_DerPreprocessor_5))) (= (_ bv0 32) (select (select (store .cse76 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store .cse76 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (= v_DerPreprocessor_1 .cse73))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse86 (select .cse81 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse79 (select .cse86 (_ bv0 32)))) (let ((.cse80 (store (select |c_#memory_$Pointer$.offset| .cse79) (_ bv0 32) (_ bv0 32))) (.cse78 (select .cse86 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse78 v_DerPreprocessor_3) .cse79 .cse80) .cse78) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse81 .cse78) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse78)) (= (select (select |c_#memory_int| .cse78) (_ bv12 32)) (_ bv42 32)) (= (_ bv0 32) (select (select (store .cse81 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (exists ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select (select (store .cse81 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (and (let ((.cse82 (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse79 .cse80) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse82) (select (select |c_#memory_int| .cse83) .cse82))) (exists ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (store (store (store |c_#memory_int| .cse78 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse83 v_DerPreprocessor_7))) (let ((.cse84 (select .cse85 (_ bv0 32)))) (and (= (_ bv42 32) (select .cse84 (_ bv12 32))) (= v_DerPreprocessor_6 .cse84) (= v_DerPreprocessor_5 (select .cse85 .cse78))))))))) (= v_DerPreprocessor_1 .cse78))))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse91 (select .cse87 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse89 (select .cse91 (_ bv0 32)))) (let ((.cse90 (store (select |c_#memory_$Pointer$.offset| .cse89) (_ bv0 32) (_ bv0 32))) (.cse88 (select .cse91 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (_ bv0 32) (select (select (store .cse87 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse64) (= (select (store (store |c_#memory_$Pointer$.offset| .cse88 v_DerPreprocessor_3) .cse89 .cse90) .cse88) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse87 .cse88) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse88)) (= (select (select |c_#memory_int| .cse88) (_ bv12 32)) (_ bv42 32)) (= (select (store (store |c_#memory_int| .cse88 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse88) v_DerPreprocessor_5) (= (_ bv0 32) (select (select (store .cse87 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse89 .cse90) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= v_DerPreprocessor_1 .cse88))))))))) (and .cse1 (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse94 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_8 v_DerPreprocessor_9))) (let ((.cse95 (select .cse94 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse93 (select .cse95 (_ bv0 32))) (.cse92 (select .cse95 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= v_DerPreprocessor_10 (select (store (store |c_#memory_$Pointer$.offset| .cse92 v_DerPreprocessor_10) .cse93 v_arrayElimArr_38) .cse92)) (= .cse93 .cse92) (= (select (select |c_#memory_int| .cse92) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse94 .cse92) (_ bv0 32)) (_ bv0 32)) (= v_DerPreprocessor_8 .cse92) (= (_ bv0 32) (select v_arrayElimArr_38 (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse92)))))))) (and .cse1 (or .cse2 .cse3 (and .cse0 .cse4) .cse4)) (and .cse1 (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse99 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_8 v_DerPreprocessor_9))) (let ((.cse98 (select .cse99 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse96 (select .cse98 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= v_DerPreprocessor_10 (select (let ((.cse97 (select .cse98 (_ bv0 32)))) (store (store |c_#memory_$Pointer$.offset| .cse96 v_DerPreprocessor_10) .cse97 (store (select |c_#memory_$Pointer$.offset| .cse97) (_ bv0 32) (_ bv0 32)))) .cse96)) (= (select (select |c_#memory_int| .cse96) (_ bv12 32)) (_ bv42 32)) (= (select (select .cse99 .cse96) (_ bv0 32)) (_ bv0 32)) (= v_DerPreprocessor_8 .cse96) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse96)))))))) (and .cse1 (or (and .cse0 (or .cse27 .cse50)) .cse27 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse111 (store .cse103 (_ bv0 32) v_ArrVal_126))) (let ((.cse108 (select (select .cse111 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse110 (select .cse103 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse100 (select .cse110 |c_ULTIMATE.start_inspect_~node#1.offset|)) (.cse106 (select (select (store .cse111 .cse108 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse109 (store (store (store |c_#memory_int| .cse100 v_DerPreprocessor_5) .cse108 v_DerPreprocessor_6) .cse106 v_DerPreprocessor_7)) (.cse101 (select .cse110 (_ bv0 32)))) (let ((.cse102 (store (select |c_#memory_$Pointer$.offset| .cse101) (_ bv0 32) (_ bv0 32))) (.cse104 (select .cse109 .cse108))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse100 v_DerPreprocessor_3) .cse101 .cse102) .cse100) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse103 .cse100) (_ bv0 32))) (= .cse104 v_DerPreprocessor_6) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse101)) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse100)) (let ((.cse105 (bvadd (_ bv8 32) (select (select (store (let ((.cse107 (store |c_#memory_$Pointer$.offset| .cse101 .cse102))) (store .cse107 (_ bv0 32) (store (select .cse107 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse108 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))))) (= (select v_DerPreprocessor_7 .cse105) (select (select |c_#memory_int| .cse106) .cse105))) (= (select (select |c_#memory_int| .cse100) (_ bv12 32)) (_ bv42 32)) (= .cse108 .cse106) (= (select .cse109 .cse100) v_DerPreprocessor_5) (= v_DerPreprocessor_1 .cse100) (= (_ bv42 32) (select .cse104 (_ bv12 32))))))))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse115 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse121 (store .cse115 (_ bv0 32) v_ArrVal_126))) (let ((.cse117 (select (select .cse121 |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse120 (select .cse115 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse112 (select .cse120 |c_ULTIMATE.start_inspect_~node#1.offset|)) (.cse118 (select (select (store .cse121 .cse117 v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (.cse113 (select .cse120 (_ bv0 32)))) (let ((.cse114 (store (select |c_#memory_$Pointer$.offset| .cse113) (_ bv0 32) (_ bv0 32))) (.cse116 (store (store (store |c_#memory_int| .cse112 v_DerPreprocessor_5) .cse117 v_DerPreprocessor_6) .cse118 v_DerPreprocessor_7))) (and (= (select (store (store |c_#memory_$Pointer$.offset| .cse112 v_DerPreprocessor_3) .cse113 .cse114) .cse112) v_DerPreprocessor_3) (= (_ bv0 32) (select (select .cse115 .cse112) (_ bv0 32))) (= (select .cse116 .cse117) v_DerPreprocessor_6) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse113)) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse112)) (= (select (select |c_#memory_int| .cse112) (_ bv12 32)) (_ bv42 32)) (= .cse117 .cse118) (= (select (select |c_#memory_int| .cse118) (_ bv12 32)) (select v_DerPreprocessor_7 (_ bv12 32))) (= (_ bv4 32) (select (select (store (let ((.cse119 (store |c_#memory_$Pointer$.offset| .cse113 .cse114))) (store .cse119 (_ bv0 32) (store (select .cse119 (_ bv0 32)) (_ bv4 32) (_ bv0 32)))) .cse117 v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (select .cse116 .cse112) v_DerPreprocessor_5) (= v_DerPreprocessor_1 .cse112)))))))) .cse50)) (and .cse1 (let ((.cse131 (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse139 (select .cse132 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse133 (select .cse139 |c_ULTIMATE.start_inspect_~node#1.offset|)) (.cse138 (select (select (store .cse132 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)))) (let ((.cse136 (store (store (store |c_#memory_int| .cse133 v_prenex_9) (_ bv0 32) v_prenex_10) .cse138 v_prenex_11))) (let ((.cse134 (select .cse136 (_ bv0 32))) (.cse135 (select .cse139 (_ bv0 32)))) (and (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (_ bv0 32) (select (select .cse132 .cse133) (_ bv0 32))) (= (_ bv42 32) (select .cse134 (_ bv12 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse133)) (= .cse135 .cse133) (= (select (select |c_#memory_int| .cse133) (_ bv12 32)) (_ bv42 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse133 v_DerPreprocessor_3) .cse135 v_arrayElimArr_16) .cse133) v_DerPreprocessor_3) (= (_ bv0 32) (select (select (store .cse132 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= v_prenex_10 .cse134) (= (select .cse136 .cse133) v_prenex_9) (let ((.cse137 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse135 v_arrayElimArr_16) (_ bv0 32) v_prenex_12) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)) (_ bv8 32)))) (= (select v_prenex_11 .cse137) (select (select |c_#memory_int| .cse138) .cse137))) (= v_DerPreprocessor_1 .cse133)))))))))) (or (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse126 (select .cse122 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse125 (select .cse126 (_ bv0 32))) (.cse123 (select .cse126 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (_ bv0 32) (select (select (store .cse122 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (_ bv0 32) (select (select .cse122 .cse123) (_ bv0 32))) (let ((.cse124 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse125 v_arrayElimArr_16) (_ bv0 32) v_prenex_12) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32)) (_ bv8 32)))) (= (select .cse70 .cse124) (select v_prenex_10 .cse124))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse123)) (= .cse125 .cse123) (= (select (select |c_#memory_int| .cse123) (_ bv12 32)) (_ bv42 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse123 v_DerPreprocessor_3) .cse125 v_arrayElimArr_16) .cse123) v_DerPreprocessor_3) (= (_ bv0 32) (select (select (store .cse122 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (select v_prenex_10 (_ bv12 32)) (_ bv42 32)) (= (select (store (store |c_#memory_int| .cse123 v_prenex_9) (_ bv0 32) v_prenex_10) .cse123) v_prenex_9) (= v_DerPreprocessor_1 .cse123)))))) (exists ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse127 (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_DerPreprocessor_2))) (let ((.cse130 (select .cse127 |c_ULTIMATE.start_inspect_~node#1.base|))) (let ((.cse129 (select .cse130 (_ bv0 32))) (.cse128 (select .cse130 |c_ULTIMATE.start_inspect_~node#1.offset|))) (and (= (_ bv0 32) (select (select (store .cse127 (_ bv0 32) v_ArrVal_131) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= (_ bv0 32) (select v_arrayElimArr_16 (_ bv0 32))) (= (select v_DerPreprocessor_6 (_ bv12 32)) .cse64) (= (_ bv0 32) (select (select .cse127 .cse128) (_ bv0 32))) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse128)) (= (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse129 v_arrayElimArr_16) (_ bv0 32) v_ArrVal_127) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= .cse129 .cse128) (= (select (select |c_#memory_int| .cse128) (_ bv12 32)) (_ bv42 32)) (= (select (store (store |c_#memory_$Pointer$.offset| .cse128 v_DerPreprocessor_3) .cse129 v_arrayElimArr_16) .cse128) v_DerPreprocessor_3) (= (select (store (store |c_#memory_int| .cse128 v_DerPreprocessor_5) (_ bv0 32) v_DerPreprocessor_6) .cse128) v_DerPreprocessor_5) (= (_ bv0 32) (select (select (store .cse127 (_ bv0 32) v_ArrVal_126) |c_ULTIMATE.start_inspect_~node#1.base|) (_ bv0 32))) (= v_DerPreprocessor_1 .cse128)))))) .cse131 (and .cse0 .cse131))))))) is different from false