./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a00615dde165ef79502be50d436d5b7101f564051a4b91f339855b18841d9599 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:11:35,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:11:35,474 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 19:11:35,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:11:35,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:11:35,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:11:35,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:11:35,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:11:35,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:11:35,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:11:35,513 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:11:35,513 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:11:35,514 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:11:35,514 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:11:35,515 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:11:35,516 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:11:35,516 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:11:35,517 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:11:35,517 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:11:35,518 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:11:35,519 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:11:35,520 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:11:35,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:11:35,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:11:35,522 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:11:35,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:11:35,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:11:35,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:11:35,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:11:35,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:11:35,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:11:35,525 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:11:35,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:11:35,526 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:11:35,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:11:35,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:11:35,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:11:35,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:11:35,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:11:35,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:11:35,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:11:35,528 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:11:35,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:11:35,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:11:35,529 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:11:35,529 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:11:35,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:11:35,529 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a00615dde165ef79502be50d436d5b7101f564051a4b91f339855b18841d9599 [2023-12-02 19:11:35,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:11:35,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:11:35,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:11:35,806 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:11:35,807 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:11:35,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i [2023-12-02 19:11:38,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:11:39,001 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:11:39,002 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i [2023-12-02 19:11:39,011 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/data/e235fee0d/1dc5ec20e4c34dddb1d98ad50de76d9a/FLAGdbcfe186e [2023-12-02 19:11:39,029 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/data/e235fee0d/1dc5ec20e4c34dddb1d98ad50de76d9a [2023-12-02 19:11:39,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:11:39,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:11:39,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:11:39,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:11:39,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:11:39,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268bb425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39, skipping insertion in model container [2023-12-02 19:11:39,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,074 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:11:39,256 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i[1800,1813] [2023-12-02 19:11:39,274 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:11:39,287 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:11:39,304 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i[1800,1813] [2023-12-02 19:11:39,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:11:39,332 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:11:39,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39 WrapperNode [2023-12-02 19:11:39,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:11:39,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:11:39,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:11:39,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:11:39,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,378 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2023-12-02 19:11:39,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:11:39,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:11:39,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:11:39,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:11:39,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:11:39,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:11:39,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:11:39,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:11:39,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (1/1) ... [2023-12-02 19:11:39,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:11:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:11:39,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:11:39,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:11:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:11:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:11:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:11:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:11:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2023-12-02 19:11:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2023-12-02 19:11:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2023-12-02 19:11:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2023-12-02 19:11:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:11:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:11:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:11:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:11:39,578 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:11:39,581 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:11:39,759 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:11:39,815 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:11:39,815 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 19:11:39,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:11:39 BoogieIcfgContainer [2023-12-02 19:11:39,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:11:39,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:11:39,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:11:39,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:11:39,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:11:39" (1/3) ... [2023-12-02 19:11:39,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24367046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:11:39, skipping insertion in model container [2023-12-02 19:11:39,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:11:39" (2/3) ... [2023-12-02 19:11:39,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24367046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:11:39, skipping insertion in model container [2023-12-02 19:11:39,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:11:39" (3/3) ... [2023-12-02 19:11:39,827 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_2.i [2023-12-02 19:11:39,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:11:39,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 19:11:39,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:11:39,898 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7019546e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:11:39,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 19:11:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 19:11:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 19:11:39,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:39,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:39,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:11:39,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash 290853727, now seen corresponding path program 1 times [2023-12-02 19:11:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204466333] [2023-12-02 19:11:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:11:40,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204466333] [2023-12-02 19:11:40,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204466333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:11:40,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:11:40,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:11:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489034915] [2023-12-02 19:11:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:11:40,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:11:40,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:40,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:11:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:11:40,560 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:11:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:40,699 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2023-12-02 19:11:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:11:40,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-02 19:11:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:40,711 INFO L225 Difference]: With dead ends: 38 [2023-12-02 19:11:40,712 INFO L226 Difference]: Without dead ends: 18 [2023-12-02 19:11:40,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:11:40,719 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:40,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:11:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-02 19:11:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-02 19:11:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 19:11:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-02 19:11:40,760 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2023-12-02 19:11:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:40,760 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-02 19:11:40,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:11:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-02 19:11:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:11:40,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:40,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:40,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:11:40,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:11:40,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:40,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1069718888, now seen corresponding path program 1 times [2023-12-02 19:11:40,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:40,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122616837] [2023-12-02 19:11:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:40,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:11:41,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:41,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122616837] [2023-12-02 19:11:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122616837] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:11:41,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617008025] [2023-12-02 19:11:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:41,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:11:41,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:11:41,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:11:41,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:11:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:41,613 WARN L260 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-02 19:11:41,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:11:41,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:11:41,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:11:42,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 19:11:42,019 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 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-02 19:11:42,085 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 29 treesize of output 24 [2023-12-02 19:11:42,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2023-12-02 19:11:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:11:42,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:11:43,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:11:43,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 76 [2023-12-02 19:11:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617008025] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:11:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [272265216] [2023-12-02 19:11:43,153 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 19:11:43,153 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:11:43,158 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:11:43,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:11:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2023-12-02 19:11:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385842567] [2023-12-02 19:11:43,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:11:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 19:11:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 19:11:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2023-12-02 19:11:43,168 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 17 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 19:11:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:43,601 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-02 19:11:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 19:11:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2023-12-02 19:11:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:43,604 INFO L225 Difference]: With dead ends: 29 [2023-12-02 19:11:43,604 INFO L226 Difference]: Without dead ends: 20 [2023-12-02 19:11:43,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2023-12-02 19:11:43,606 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:43,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:11:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-02 19:11:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-02 19:11:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 19:11:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-12-02 19:11:43,615 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2023-12-02 19:11:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:43,616 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-12-02 19:11:43,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 19:11:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-12-02 19:11:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:11:43,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:43,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:43,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:11:43,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-02 19:11:43,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:11:43,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759423, now seen corresponding path program 2 times [2023-12-02 19:11:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:43,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016136873] [2023-12-02 19:11:43,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:43,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 19:11:44,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:44,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016136873] [2023-12-02 19:11:44,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016136873] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:11:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479121010] [2023-12-02 19:11:44,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:11:44,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:11:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:11:44,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:11:44,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:11:44,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 19:11:44,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:11:44,891 WARN L260 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 95 conjunts are in the unsatisfiable core [2023-12-02 19:11:44,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:11:44,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:11:44,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:11:45,595 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 0 case distinctions, treesize of input 51 treesize of output 61 [2023-12-02 19:11:45,637 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 8 treesize of output 1 [2023-12-02 19:11:45,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:11:45,812 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 0 case distinctions, treesize of input 88 treesize of output 82 [2023-12-02 19:11:45,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2023-12-02 19:11:45,858 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-02 19:11:45,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2023-12-02 19:11:45,919 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 8 treesize of output 7 [2023-12-02 19:11:46,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2023-12-02 19:11:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:11:46,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:11:47,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:11:47,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2023-12-02 19:11:47,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479121010] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:11:47,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1999065127] [2023-12-02 19:11:47,404 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 19:11:47,405 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:11:47,405 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:11:47,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:11:47,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2023-12-02 19:11:47,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907115843] [2023-12-02 19:11:47,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:11:47,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 19:11:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:47,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 19:11:47,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=674, Unknown=4, NotChecked=0, Total=756 [2023-12-02 19:11:47,409 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 22 states, 16 states have (on average 1.75) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 19:11:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:11:48,498 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-02 19:11:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:11:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 1.75) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 22 [2023-12-02 19:11:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:11:48,500 INFO L225 Difference]: With dead ends: 36 [2023-12-02 19:11:48,501 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 19:11:48,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=139, Invalid=1112, Unknown=9, NotChecked=0, Total=1260 [2023-12-02 19:11:48,503 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:11:48,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 107 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 12 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:11:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 19:11:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-02 19:11:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-02 19:11:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-02 19:11:48,511 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2023-12-02 19:11:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:11:48,511 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-02 19:11:48,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 1.75) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 19:11:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-02 19:11:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 19:11:48,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:11:48,512 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:11:48,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:11:48,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:11:48,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:11:48,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:11:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash -272177224, now seen corresponding path program 3 times [2023-12-02 19:11:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:11:48,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447367505] [2023-12-02 19:11:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:11:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:11:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:11:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 19:11:49,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:11:49,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447367505] [2023-12-02 19:11:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447367505] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:11:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974781734] [2023-12-02 19:11:49,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:11:49,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:11:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:11:49,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:11:49,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:11:50,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:11:50,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:11:50,008 WARN L260 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 107 conjunts are in the unsatisfiable core [2023-12-02 19:11:50,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:11:50,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:11:50,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:11:55,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:11:55,376 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 0 case distinctions, treesize of input 66 treesize of output 76 [2023-12-02 19:11:55,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:11:55,413 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 0 case distinctions, treesize of input 108 treesize of output 83 [2023-12-02 19:11:55,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 108 [2023-12-02 19:11:55,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-12-02 19:11:55,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-12-02 19:11:55,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2023-12-02 19:11:55,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-12-02 19:11:55,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:11:55,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 1 [2023-12-02 19:11:55,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2023-12-02 19:11:55,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-02 19:11:55,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:11:55,811 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 0 case distinctions, treesize of input 85 treesize of output 60 [2023-12-02 19:11:55,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2023-12-02 19:11:55,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-12-02 19:11:55,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-02 19:11:55,973 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 29 treesize of output 24 [2023-12-02 19:11:56,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2023-12-02 19:11:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 4 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 19:11:56,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:11:57,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:11:57,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 176 [2023-12-02 19:11:58,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974781734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:11:58,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [963411922] [2023-12-02 19:11:58,128 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 19:11:58,128 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:11:58,129 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:11:58,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:11:58,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2023-12-02 19:11:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064845572] [2023-12-02 19:11:58,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:11:58,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 19:11:58,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:11:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 19:11:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=945, Unknown=17, NotChecked=0, Total=1056 [2023-12-02 19:11:58,132 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 27 states, 19 states have (on average 1.736842105263158) internal successors, (33), 24 states have internal predecessors, (33), 10 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 19:12:00,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:04,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:06,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:09,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:12,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:19,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:12:20,171 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-12-02 19:12:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:12:20,171 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 19 states have (on average 1.736842105263158) internal successors, (33), 24 states have internal predecessors, (33), 10 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 27 [2023-12-02 19:12:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:12:20,172 INFO L225 Difference]: With dead ends: 40 [2023-12-02 19:12:20,173 INFO L226 Difference]: Without dead ends: 29 [2023-12-02 19:12:20,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=171, Invalid=1522, Unknown=29, NotChecked=0, Total=1722 [2023-12-02 19:12:20,175 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 16 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:12:20,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 160 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 14.6s Time] [2023-12-02 19:12:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-02 19:12:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-02 19:12:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 19:12:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-02 19:12:20,185 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 27 [2023-12-02 19:12:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:12:20,186 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-02 19:12:20,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 19 states have (on average 1.736842105263158) internal successors, (33), 24 states have internal predecessors, (33), 10 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 19:12:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-02 19:12:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 19:12:20,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:12:20,188 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:12:20,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:12:20,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:12:20,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:12:20,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:12:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash -241955809, now seen corresponding path program 4 times [2023-12-02 19:12:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:12:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481404861] [2023-12-02 19:12:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:12:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:12:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:12:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 19:12:21,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:12:21,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481404861] [2023-12-02 19:12:21,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481404861] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:12:21,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755657471] [2023-12-02 19:12:21,581 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 19:12:21,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:12:21,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:12:21,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:12:21,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:12:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:12:21,704 WARN L260 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 129 conjunts are in the unsatisfiable core [2023-12-02 19:12:21,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:12:21,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:12:21,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:12:24,468 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_56 Int) (|v_func_to_recursive_line_38_to_41_0_~array#1.offset_52| Int) (|v_func_to_recursive_line_38_to_41_0_~index#1.offset_49| Int) (v_DerPreprocessor_8 (Array Int Int)) (|func_to_recursive_line_38_to_41_0_~index#1.offset| Int) (|func_to_recursive_line_38_to_41_0_~array#1.offset| Int) (v_z_54 Int) (v_y_54 Int) (v_z_56 Int)) (let ((.cse0 (mod (select (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |func_to_recursive_line_38_to_41_0_~index#1.offset|) 4294967296)) (.cse1 (mod (select v_DerPreprocessor_8 |v_func_to_recursive_line_38_to_41_0_~index#1.offset_49|) 4294967296))) (and (<= v_z_54 4294967295) (<= |func_to_recursive_line_38_to_41_0_~array#1.offset| |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) (<= (+ .cse0 1) v_z_54) (<= .cse1 9999) (<= .cse0 9999) (<= (+ .cse1 1) v_z_56) (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ |func_to_recursive_line_38_to_41_0_~array#1.offset| (* .cse0 4)) (+ v_z_54 (* v_y_54 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| v_DerPreprocessor_8) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ (* .cse1 4) |v_func_to_recursive_line_38_to_41_0_~array#1.offset_52|) (+ v_z_56 (* v_y_56 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (select |c_#memory_int| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (<= v_z_56 4294967295) (<= |v_func_to_recursive_line_38_to_41_0_~array#1.offset_52| |func_to_recursive_line_38_to_41_0_~array#1.offset|)))) is different from true [2023-12-02 19:12:24,632 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_func_to_recursive_line_38_to_41_0_~index#1.offset_50| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|func_to_recursive_line_38_to_41_0_~array#1.offset| Int) (v_z_54 Int) (|v_func_to_recursive_line_38_to_41_0_~array#1.offset_53| Int) (v_y_54 Int) (v_z_56 Int) (v_y_56 Int) (v_y_57 Int) (v_z_57 Int) (|v_func_to_recursive_line_38_to_41_0_~array#1.offset_52| Int) (|v_func_to_recursive_line_38_to_41_0_~index#1.offset_49| Int) (|func_to_recursive_line_38_to_41_0_~index#1.offset| Int)) (let ((.cse0 (mod (select (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |v_func_to_recursive_line_38_to_41_0_~index#1.offset_50|) 4294967296)) (.cse1 (mod (select v_DerPreprocessor_9 |func_to_recursive_line_38_to_41_0_~index#1.offset|) 4294967296)) (.cse2 (mod (select v_DerPreprocessor_8 |v_func_to_recursive_line_38_to_41_0_~index#1.offset_49|) 4294967296))) (and (<= v_z_54 4294967295) (<= .cse0 9999) (<= |v_func_to_recursive_line_38_to_41_0_~array#1.offset_52| |v_func_to_recursive_line_38_to_41_0_~array#1.offset_53|) (<= (+ .cse1 1) v_z_54) (<= .cse1 9999) (<= |func_to_recursive_line_38_to_41_0_~array#1.offset| |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) (<= (+ .cse0 1) v_z_57) (<= .cse2 9999) (<= |v_func_to_recursive_line_38_to_41_0_~array#1.offset_53| |func_to_recursive_line_38_to_41_0_~array#1.offset|) (<= (+ .cse2 1) v_z_56) (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ |func_to_recursive_line_38_to_41_0_~array#1.offset| (* .cse0 4)) (+ (* v_y_57 4294967296) v_z_57))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| v_DerPreprocessor_9) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ |v_func_to_recursive_line_38_to_41_0_~array#1.offset_53| (* .cse1 4)) (+ v_z_54 (* v_y_54 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| v_DerPreprocessor_8) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ (* .cse2 4) |v_func_to_recursive_line_38_to_41_0_~array#1.offset_52|) (+ v_z_56 (* v_y_56 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (select |c_#memory_int| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (<= v_z_57 4294967295) (<= v_z_56 4294967295)))) is different from true [2023-12-02 19:12:27,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:12:27,296 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 0 case distinctions, treesize of input 81 treesize of output 91 [2023-12-02 19:12:27,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 113 [2023-12-02 19:12:27,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:12:27,376 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 0 case distinctions, treesize of input 100 treesize of output 75 [2023-12-02 19:12:27,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 115 [2023-12-02 19:12:27,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2023-12-02 19:12:27,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-12-02 19:12:27,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-12-02 19:12:27,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-12-02 19:12:27,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:12:27,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 [2023-12-02 19:12:27,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-02 19:12:27,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 109 [2023-12-02 19:12:27,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:12:27,844 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 0 case distinctions, treesize of input 77 treesize of output 52 [2023-12-02 19:12:27,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-12-02 19:12:27,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-12-02 19:12:27,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-02 19:12:27,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:12:27,950 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 0 case distinctions, treesize of input 131 treesize of output 106 [2023-12-02 19:12:27,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 149 [2023-12-02 19:12:28,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:12:28,089 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 0 case distinctions, treesize of input 108 treesize of output 83 [2023-12-02 19:12:28,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 108 [2023-12-02 19:12:28,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107 [2023-12-02 19:12:28,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-02 19:12:28,257 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 19:12:28,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:12:28,279 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 0 case distinctions, treesize of input 108 treesize of output 83 [2023-12-02 19:12:28,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 136 [2023-12-02 19:12:28,474 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 29 treesize of output 24 [2023-12-02 19:12:28,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2023-12-02 19:12:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 2 times theorem prover too weak. 14 trivial. 14 not checked. [2023-12-02 19:12:28,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:12:31,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:12:31,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 118 [2023-12-02 19:12:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755657471] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:12:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556790111] [2023-12-02 19:12:31,718 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 19:12:31,719 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:12:31,719 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:12:31,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:12:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2023-12-02 19:12:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613245008] [2023-12-02 19:12:31,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:12:31,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 19:12:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:12:31,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 19:12:31,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=961, Unknown=5, NotChecked=126, Total=1190 [2023-12-02 19:12:31,722 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 29 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 26 states have internal predecessors, (35), 10 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-02 19:12:34,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:38,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:41,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:12:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:12:41,668 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-12-02 19:12:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:12:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 26 states have internal predecessors, (35), 10 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 32 [2023-12-02 19:12:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:12:41,671 INFO L225 Difference]: With dead ends: 42 [2023-12-02 19:12:41,671 INFO L226 Difference]: Without dead ends: 31 [2023-12-02 19:12:41,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=182, Invalid=1619, Unknown=13, NotChecked=166, Total=1980 [2023-12-02 19:12:41,673 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 17 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:12:41,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 178 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 388 Invalid, 17 Unknown, 68 Unchecked, 8.2s Time] [2023-12-02 19:12:41,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-02 19:12:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-02 19:12:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-02 19:12:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-02 19:12:41,682 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 32 [2023-12-02 19:12:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:12:41,682 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-02 19:12:41,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 26 states have internal predecessors, (35), 10 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-02 19:12:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-02 19:12:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 19:12:41,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:12:41,684 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:12:41,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 19:12:41,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:12:41,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:12:41,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:12:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1795691736, now seen corresponding path program 5 times [2023-12-02 19:12:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:12:41,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525815274] [2023-12-02 19:12:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:12:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:12:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:12:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 19:12:43,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:12:43,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525815274] [2023-12-02 19:12:43,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525815274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:12:43,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953492659] [2023-12-02 19:12:43,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:12:43,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:12:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:12:43,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:12:43,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425e7a3e-3aab-4bec-8c20-91d8886d3dd2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:12:45,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-02 19:12:45,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:12:45,135 WARN L260 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 189 conjunts are in the unsatisfiable core [2023-12-02 19:12:45,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:12:45,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:12:45,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:12:53,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (let ((.cse0 (mod (select .cse36 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 4294967296))) (and (<= .cse0 9999) (let ((.cse2 (+ (* .cse0 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse30 (+ .cse0 1)) (.cse1 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse43 (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse42 (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse2))) (or (exists ((v_z_135 Int)) (and (exists ((v_z_134 Int)) (and (exists ((v_y_140 Int) (v_DerPreprocessor_18 Int) (v_ArrVal_341 Int) (v_DerPreprocessor_16 Int) (v_y_135 Int) (v_y_134 Int) (v_z_140 Int)) (let ((.cse16 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse1 .cse2 v_DerPreprocessor_18))) (.cse4 (+ v_z_140 (* v_y_140 4294967296)))) (let ((.cse15 (store (select .cse16 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse4))) (let ((.cse8 (select (store .cse16 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse15) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse9 (+ (* v_z_140 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse7 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse15)) (.cse14 (store .cse8 .cse9 v_DerPreprocessor_16)) (.cse6 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse13 (store (select (store .cse7 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse14) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse6))) (let ((.cse10 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse14) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse13) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse5 (select .cse10 .cse9)) (.cse3 (select .cse8 .cse2))) (and (= (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse1 .cse2 .cse3)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse4) (<= (+ (* (div .cse5 4294967296) 4294967296) v_z_140 1) .cse5) (= .cse6 (+ (select (select (store .cse7 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse8 .cse9 .cse5)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= (+ .cse0 1 (* (div .cse3 4294967296) 4294967296)) .cse3) (= (let ((.cse11 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse11 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse12 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse13) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse11 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse12 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse12 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))) |c_#memory_int|) (<= 0 v_z_140)))))))))) (<= v_z_134 4294967295) (<= (+ v_z_135 1) v_z_134))) (<= v_z_135 9999) (<= 0 v_z_135))) (and (or (let ((.cse17 (div (+ (* (- 1) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 4))) (and (= (mod (+ |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (* 3 |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|)) 4) 0) (<= 0 .cse17) (exists ((v_z_130 Int) (v_y_130 Int) (v_z_134 Int) (v_ArrVal_341 Int) (v_y_148 Int) (v_DerPreprocessor_20 Int) (v_y_134 Int)) (let ((.cse25 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse1 .cse2 v_DerPreprocessor_20)))) (let ((.cse26 (select .cse25 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse19 (+ (* v_y_148 4294967296) .cse17))) (let ((.cse29 (store .cse26 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse19))) (let ((.cse28 (select (store .cse25 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse29) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse27 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse29) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse28 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse17 4)) (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse18 (select .cse28 .cse2)) (.cse20 (mod .cse27 4294967296))) (and (= (+ 1 (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse1 .cse2 .cse18)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|)) .cse19) (<= v_z_134 4294967295) (<= (+ .cse20 1) v_z_134) (<= (+ .cse17 1) v_z_130) (<= .cse20 9999) (<= (+ .cse0 (* (div .cse18 4294967296) 4294967296) 1) .cse18) (<= v_z_130 4294967295) (= |c_#memory_int| (let ((.cse24 (store .cse26 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse27))) (let ((.cse21 (select (store .cse25 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse24) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse22 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse20 4)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse21 .cse22 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse23 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse24) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse21 .cse22 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse23 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse23 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))))))))))))) (<= .cse17 9999))) (and (exists ((v_z_130 Int) (v_z_142 Int) (v_y_130 Int) (v_z_134 Int) (v_ArrVal_341 Int) (v_y_134 Int) (v_y_142 Int)) (let ((.cse41 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse1 .cse2 (+ v_z_142 (* v_y_142 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse39 (mod .cse41 4294967296))) (let ((.cse38 (+ (* .cse39 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse37 (+ (select (select (let ((.cse40 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse36 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse41)))) (store .cse40 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse40 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse38 (+ v_z_130 (* v_y_130 4294967296))))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse35 (mod .cse37 4294967296))) (and (<= .cse30 v_z_142) (= (let ((.cse34 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse36 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse37)))) (let ((.cse31 (select .cse34 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse32 (+ (* .cse35 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse31 .cse32 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse33 (select (store .cse34 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse31 .cse32 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse33 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse33 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) |c_#memory_int|) (<= v_z_134 4294967295) (<= (+ .cse35 1) v_z_134) (<= .cse35 9999) (= .cse38 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) (<= (+ .cse39 1) v_z_130) (<= v_z_130 4294967295) (<= v_z_142 4294967295)))))))) .cse42)) .cse43) (and (exists ((v_z_130 Int) (v_y_130 Int) (v_z_134 Int) (v_z_135 Int) (v_ArrVal_341 Int) (v_DerPreprocessor_16 Int) (v_y_135 Int) (v_y_134 Int)) (let ((.cse55 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse1 .cse2 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse49 (mod .cse55 4294967296)) (.cse45 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse36 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse55)))) (let ((.cse46 (select .cse45 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse47 (+ (* .cse49 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse54 (store .cse46 .cse47 v_DerPreprocessor_16)) (.cse44 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse53 (store (select (store .cse45 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse54) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse44))) (let ((.cse50 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse54) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse53) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse48 (select .cse50 .cse47))) (and (<= v_z_134 4294967295) (= .cse44 (+ (select (select (store .cse45 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse46 .cse47 .cse48)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= (+ (* (div .cse48 4294967296) 4294967296) .cse49 1) .cse48) (<= v_z_135 9999) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (<= .cse30 v_z_130) (= |c_#memory_int| (let ((.cse51 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse50 .cse51 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse52 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse53) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse50 .cse51 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse52 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse52 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) (<= v_z_130 4294967295)))))))))) .cse43 .cse42))))))) is different from false [2023-12-02 19:13:27,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (let ((.cse56 (mod (select .cse20 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 4294967296))) (and (let ((.cse23 (+ (* .cse56 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|)) (.cse46 (div (+ (* (- 1) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 4))) (let ((.cse0 (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse25 (= (mod (+ |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (* 3 |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|)) 4) 0)) (.cse26 (<= 0 .cse46)) (.cse37 (+ .cse46 1)) (.cse44 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse46 4))) (.cse69 (<= .cse46 9999)) (.cse16 (+ .cse56 1)) (.cse22 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse24 (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse23))) (or (and .cse0 (exists ((v_z_130 Int) (v_y_140 Int) (v_y_130 Int) (v_z_134 Int) (v_DerPreprocessor_18 Int) (v_z_135 Int) (v_ArrVal_341 Int) (v_DerPreprocessor_16 Int) (v_y_135 Int) (v_y_134 Int) (v_z_140 Int)) (let ((.cse21 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse11 (mod .cse21 4294967296)) (.cse7 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse20 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse21)))) (let ((.cse8 (select .cse7 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse9 (+ (* .cse11 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse19 (store .cse8 .cse9 v_DerPreprocessor_18)) (.cse6 (+ v_z_140 (* v_y_140 4294967296)))) (let ((.cse18 (store (select (store .cse7 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse19) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse6))) (let ((.cse4 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse19) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse18) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse5 (+ (* v_z_140 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse18)) (.cse17 (store .cse4 .cse5 v_DerPreprocessor_16)) (.cse2 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse15 (store (select (store .cse3 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse17) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse2))) (let ((.cse12 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse17) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse15) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse1 (select .cse12 .cse5)) (.cse10 (select .cse4 .cse9))) (and (<= (+ v_z_140 (* (div .cse1 4294967296) 4294967296) 1) .cse1) (= .cse2 (+ (select (select (store .cse3 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse4 .cse5 .cse1)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (= .cse6 (+ (select (select (store .cse7 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse8 .cse9 .cse10)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= v_z_134 4294967295) (<= (+ (* (div .cse10 4294967296) 4294967296) .cse11 1) .cse10) (<= 0 v_z_140) (= |c_#memory_int| (let ((.cse13 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse12 .cse13 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse14 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse15) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse12 .cse13 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse14 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse14 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) (<= v_z_135 9999) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (<= .cse16 v_z_130) (<= v_z_130 4294967295))))))))))))) .cse24) (and .cse0 (or (and .cse25 .cse26 (or (and (exists ((v_z_130 Int) (v_y_130 Int) (v_z_177 Int) (v_z_134 Int) (v_ArrVal_341 Int) (v_y_148 Int) (v_y_177 Int) (v_DerPreprocessor_20 Int) (v_y_134 Int)) (let ((.cse47 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 (+ (* v_y_177 4294967296) v_z_177))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse29 (mod .cse47 4294967296)) (.cse38 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse20 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse47)))) (let ((.cse39 (select .cse38 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse40 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* 4 .cse29)))) (let ((.cse45 (store .cse39 .cse40 v_DerPreprocessor_20))) (let ((.cse35 (select (store .cse38 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse45) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse41 (+ (* v_y_148 4294967296) .cse46))) (let ((.cse34 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse45)) (.cse43 (store .cse35 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse41))) (let ((.cse42 (select (store .cse34 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse43) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse36 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse43) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse42 .cse44 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse27 (mod .cse36 4294967296)) (.cse28 (select .cse42 .cse40))) (and (<= v_z_177 4294967295) (<= v_z_134 4294967295) (<= (+ .cse27 1) v_z_134) (<= .cse27 9999) (<= (+ (* (div .cse28 4294967296) 4294967296) .cse29 1) .cse28) (= |c_#memory_int| (let ((.cse33 (store .cse35 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse36))) (let ((.cse30 (select (store .cse34 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse33) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse31 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse27 4)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse30 .cse31 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse32 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse33) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse30 .cse31 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse32 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse32 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))))) (<= .cse37 v_z_130) (= (+ (select (select (store .cse38 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse39 .cse40 .cse28)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse41) (<= .cse16 v_z_177) (<= v_z_130 4294967295)))))))))))) .cse24) (exists ((v_z_134 Int)) (and (exists ((v_z_130 Int)) (and (<= .cse37 v_z_130) (exists ((v_y_130 Int) (v_z_176 Int) (v_DerPreprocessor_28 Int) (v_ArrVal_341 Int) (v_y_148 Int) (v_DerPreprocessor_20 Int) (v_y_134 Int) (v_y_176 Int)) (let ((.cse68 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 v_DerPreprocessor_28))) (.cse63 (+ (* v_y_176 4294967296) v_z_176))) (let ((.cse67 (store (select .cse68 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse63))) (let ((.cse59 (select (store .cse68 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse67) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse60 (+ (* v_z_176 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse58 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse67)) (.cse66 (store .cse59 .cse60 v_DerPreprocessor_20))) (let ((.cse54 (select (store .cse58 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse66) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse62 (+ (* v_y_148 4294967296) .cse46))) (let ((.cse53 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse66)) (.cse65 (store .cse54 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse62))) (let ((.cse64 (select (store .cse53 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse65) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse55 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse65) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse64 .cse44 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse57 (select .cse59 .cse23)) (.cse61 (select .cse64 .cse60)) (.cse52 (mod .cse55 4294967296))) (and (= (let ((.cse51 (store .cse54 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse55))) (let ((.cse48 (select (store .cse53 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse51) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse49 (+ (* 4 .cse52) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse48 .cse49 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse50 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse51) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse48 .cse49 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse50 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse50 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) |c_#memory_int|) (<= (+ .cse56 (* (div .cse57 4294967296) 4294967296) 1) .cse57) (<= (+ 1 .cse52) v_z_134) (= (+ (select (select (store .cse58 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse59 .cse60 .cse61)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse62) (= (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 .cse57)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse63) (<= (+ (* (div .cse61 4294967296) 4294967296) v_z_176 1) .cse61) (<= .cse52 9999) (<= 0 v_z_176)))))))))))) (<= v_z_130 4294967295))) (<= v_z_134 4294967295)))) .cse69) (and (exists ((v_y_162 Int) (v_z_130 Int) (v_z_142 Int) (v_y_130 Int) (v_z_134 Int) (v_ArrVal_341 Int) (v_y_134 Int) (v_y_142 Int) (v_z_162 Int)) (let ((.cse83 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 (+ v_z_162 (* v_y_162 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse79 (mod .cse83 4294967296))) (let ((.cse78 (+ (* .cse79 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse81 (+ (select (select (let ((.cse82 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse20 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse83)))) (store .cse82 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse82 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse78 (+ v_z_142 (* v_y_142 4294967296))))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse71 (mod .cse81 4294967296))) (let ((.cse72 (+ (* 4 .cse71) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse77 (+ 1 (select (select (let ((.cse80 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse20 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse81)))) (store .cse80 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse80 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse72 (+ v_z_130 (* v_y_130 4294967296))))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|)))) (let ((.cse70 (mod .cse77 4294967296))) (and (<= (+ .cse70 1) v_z_134) (<= (+ 1 .cse71) v_z_130) (<= v_z_134 4294967295) (= .cse72 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) (<= .cse70 9999) (<= v_z_162 4294967295) (= (let ((.cse76 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse20 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse77)))) (let ((.cse73 (select .cse76 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse74 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* 4 .cse70)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse73 .cse74 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse75 (select (store .cse76 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse73 .cse74 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse75 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse75 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) |c_#memory_int|) (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse78) (<= v_z_130 4294967295) (<= .cse16 v_z_162) (<= v_z_142 4294967295) (<= (+ .cse79 1) v_z_142))))))))))) .cse24))) (exists ((v_z_140 Int)) (and (exists ((v_z_135 Int)) (and (<= v_z_135 9999) (<= 0 v_z_135) (exists ((v_z_134 Int)) (and (<= v_z_134 4294967295) (exists ((v_DerPreprocessor_24 Int) (v_y_140 Int) (v_DerPreprocessor_18 Int) (v_ArrVal_341 Int) (v_z_158 Int) (v_DerPreprocessor_16 Int) (v_y_135 Int) (v_y_158 Int) (v_y_134 Int)) (let ((.cse104 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 v_DerPreprocessor_24))) (.cse94 (+ v_z_158 (* v_y_158 4294967296)))) (let ((.cse103 (store (select .cse104 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse94))) (let ((.cse98 (select (store .cse104 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse103) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse99 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* v_z_158 4)))) (let ((.cse97 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse103)) (.cse102 (store .cse98 .cse99 v_DerPreprocessor_18)) (.cse96 (+ v_z_140 (* v_y_140 4294967296)))) (let ((.cse101 (store (select (store .cse97 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse102) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse96))) (let ((.cse86 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse102) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse101) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse87 (+ (* v_z_140 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse85 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse101)) (.cse100 (store .cse86 .cse87 v_DerPreprocessor_16)) (.cse84 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse92 (store (select (store .cse85 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse100) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse84))) (let ((.cse89 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse100) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse92) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse93 (select .cse98 .cse23)) (.cse95 (select .cse86 .cse99)) (.cse88 (select .cse89 .cse87))) (and (= .cse84 (+ (select (select (store .cse85 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse86 .cse87 .cse88)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (= |c_#memory_int| (let ((.cse90 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse89 .cse90 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse91 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse92) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse89 .cse90 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse91 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse91 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) (<= 0 v_z_158) (= (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 .cse93)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse94) (<= (+ .cse56 (* (div .cse93 4294967296) 4294967296) 1) .cse93) (<= (+ (* 4294967296 (div .cse95 4294967296)) v_z_158 1) .cse95) (= .cse96 (+ (select (select (store .cse97 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse98 .cse99 .cse95)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= (+ (* 4294967296 (div .cse88 4294967296)) v_z_140 1) .cse88))))))))))))) (<= (+ v_z_135 1) v_z_134))))) (<= 0 v_z_140))) (and .cse0 (or (and .cse25 .cse26 (exists ((v_z_130 Int) (v_y_130 Int) (v_DerPreprocessor_22 Int) (v_z_134 Int) (v_z_135 Int) (v_ArrVal_341 Int) (v_DerPreprocessor_16 Int) (v_y_135 Int) (v_y_155 Int) (v_y_134 Int)) (let ((.cse120 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 v_DerPreprocessor_22)))) (let ((.cse121 (select .cse120 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse106 (+ .cse46 (* v_y_155 4294967296)))) (let ((.cse123 (store .cse121 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse106))) (let ((.cse117 (select (store .cse120 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse123) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse122 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse123) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse117 .cse44 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse116 (mod .cse122 4294967296)) (.cse119 (store .cse121 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse122))) (let ((.cse109 (select (store .cse120 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse119) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse110 (+ (* .cse116 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse108 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse119)) (.cse118 (store .cse109 .cse110 v_DerPreprocessor_16)) (.cse107 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse115 (store (select (store .cse108 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse118) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse107))) (let ((.cse112 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse118) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse115) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse105 (select .cse117 .cse23)) (.cse111 (select .cse112 .cse110))) (and (<= v_z_134 4294967295) (= (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 .cse105)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse106) (<= .cse37 v_z_130) (= .cse107 (+ (select (select (store .cse108 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse109 .cse110 .cse111)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= v_z_135 9999) (<= (+ .cse56 (* (div .cse105 4294967296) 4294967296) 1) .cse105) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (<= v_z_130 4294967295) (= |c_#memory_int| (let ((.cse113 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse112 .cse113 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse114 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse115) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse112 .cse113 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse114 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse114 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) (<= (+ .cse116 (* (div .cse111 4294967296) 4294967296) 1) .cse111)))))))))))))) .cse69) (and (exists ((v_z_130 Int) (v_y_130 Int) (v_z_134 Int) (v_z_135 Int) (v_ArrVal_341 Int) (v_DerPreprocessor_16 Int) (v_z_149 Int) (v_y_149 Int) (v_y_135 Int) (v_y_134 Int)) (let ((.cse139 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse23 (+ (* v_y_149 4294967296) v_z_149))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse134 (mod .cse139 4294967296))) (let ((.cse129 (+ (* .cse134 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse137 (+ (select (select (let ((.cse138 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse20 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse139)))) (store .cse138 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse138 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse129 (+ v_z_130 (* v_y_130 4294967296))))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse135 (mod .cse137 4294967296)) (.cse125 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse20 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse137)))) (let ((.cse126 (select .cse125 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse127 (+ (* .cse135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse136 (store .cse126 .cse127 v_DerPreprocessor_16)) (.cse124 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse133 (store (select (store .cse125 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse136) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse124))) (let ((.cse130 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse136) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse133) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse128 (select .cse130 .cse127))) (and (<= .cse16 v_z_149) (<= v_z_134 4294967295) (= .cse124 (+ 1 (select (select (store .cse125 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse126 .cse127 .cse128)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|))) (= .cse129 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) (= (let ((.cse131 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse130 .cse131 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse132 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse133) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse130 .cse131 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse132 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse132 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))) |c_#memory_int|) (<= (+ .cse134 1) v_z_130) (<= v_z_135 9999) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (<= (+ (* (div .cse128 4294967296) 4294967296) .cse135 1) .cse128) (<= v_z_130 4294967295) (<= v_z_149 4294967295))))))))))))) .cse24)))))) (<= .cse56 9999)))) is different from false [2023-12-02 19:17:03,552 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse62 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (let ((.cse0 (mod (select .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 4294967296))) (and (<= .cse0 9999) (let ((.cse20 (+ (* .cse0 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|)) (.cse31 (div (+ (* (- 1) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 4))) (let ((.cse1 (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse34 (= (mod (+ |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (* 3 |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|)) 4) 0)) (.cse35 (<= 0 .cse31)) (.cse36 (<= .cse31 9999)) (.cse29 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse31 4))) (.cse21 (+ .cse31 1)) (.cse19 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse64 (+ .cse0 1)) (.cse37 (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse20))) (or (and .cse1 (or (and (exists ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_34 Int) (v_prenex_109 Int) (v_prenex_107 Int) (v_prenex_108 Int) (v_prenex_105 Int) (v_prenex_106 Int) (v_z_200 Int) (v_prenex_112 Int) (v_prenex_110 Int) (v_prenex_111 Int) (v_y_155 Int) (v_y_200 Int)) (let ((.cse33 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 v_DerPreprocessor_34))) (.cse18 (+ (* v_y_200 4294967296) v_z_200))) (let ((.cse32 (store (select .cse33 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse18))) (let ((.cse15 (select (store .cse33 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse32) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse16 (+ (* v_z_200 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse14 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse32)) (.cse30 (store .cse15 .cse16 v_DerPreprocessor_22))) (let ((.cse26 (select (store .cse14 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse30) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse17 (+ .cse31 (* v_y_155 4294967296)))) (let ((.cse25 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse30)) (.cse28 (store .cse26 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse17))) (let ((.cse22 (select (store .cse25 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse28) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse27 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse28) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse22 .cse29 (+ (* v_prenex_106 4294967296) v_prenex_105))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse9 (mod .cse27 4294967296)) (.cse24 (store .cse26 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse27))) (let ((.cse4 (select (store .cse25 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse24) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse5 (+ (* .cse9 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse24)) (.cse23 (store .cse4 .cse5 v_prenex_110)) (.cse7 (+ (* v_prenex_111 4294967296) v_prenex_108))) (let ((.cse13 (store (select (store .cse3 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse23) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse7))) (let ((.cse10 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse23) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse13) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse6 (select .cse10 .cse5)) (.cse2 (select .cse22 .cse16)) (.cse8 (select .cse15 .cse20))) (and (<= 0 v_prenex_108) (<= (+ v_z_200 (* (div .cse2 4294967296) 4294967296) 1) .cse2) (= (+ (select (select (store .cse3 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse4 .cse5 .cse6)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse7) (<= (+ (* (div .cse8 4294967296) 4294967296) .cse0 1) .cse8) (<= (+ v_prenex_108 1) v_prenex_107) (<= v_prenex_105 4294967295) (<= (+ (* (div .cse6 4294967296) 4294967296) .cse9 1) .cse6) (<= 0 v_z_200) (= (let ((.cse11 (+ (* v_prenex_108 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse11 v_prenex_109)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse12 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse13) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse11 (+ (* v_prenex_112 4294967296) v_prenex_107))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse12 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse12 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))) |c_#memory_int|) (= (+ (select (select (store .cse14 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse15 .cse16 .cse2)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse17) (= .cse18 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 .cse8)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= v_prenex_108 9999) (<= v_prenex_107 4294967295) (<= .cse21 v_prenex_105))))))))))))))))) .cse34 .cse35 .cse36) (and .cse37 (or (exists ((v_z_130 Int)) (and (exists ((v_y_130 Int) (v_DerPreprocessor_22 Int) (v_z_134 Int) (v_z_135 Int) (v_subst_9 Int) (v_ArrVal_341 Int) (v_subst_8 Int) (v_DerPreprocessor_16 Int) (v_y_135 Int) (v_y_155 Int) (v_y_134 Int)) (let ((.cse63 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse39 (mod .cse63 4294967296)) (.cse49 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse63)))) (let ((.cse50 (select .cse49 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse51 (+ (* .cse39 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse61 (store .cse50 .cse51 v_DerPreprocessor_22))) (let ((.cse58 (select (store .cse49 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse61) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse52 (+ .cse31 (* v_y_155 4294967296)))) (let ((.cse57 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse61)) (.cse60 (store .cse58 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse52))) (let ((.cse54 (select (store .cse57 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse60) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse59 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse60) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse54 .cse29 (+ (* 4294967296 v_subst_9) v_subst_8))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse53 (mod .cse59 4294967296)) (.cse56 (store .cse58 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse59))) (let ((.cse46 (select (store .cse57 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse56) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse47 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse53 4)))) (let ((.cse45 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse56)) (.cse55 (store .cse46 .cse47 v_DerPreprocessor_16)) (.cse44 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse43 (store (select (store .cse45 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse55) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse44))) (let ((.cse40 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse55) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse43) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse38 (select .cse54 .cse51)) (.cse48 (select .cse40 .cse47))) (and (<= (+ (* 4294967296 (div .cse38 4294967296)) .cse39 1) .cse38) (<= v_z_134 4294967295) (= (let ((.cse41 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse40 .cse41 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse42 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse43) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse40 .cse41 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse42 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse42 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))) |c_#memory_int|) (<= .cse21 v_subst_8) (<= v_z_135 9999) (= .cse44 (+ (select (select (store .cse45 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse46 .cse47 .cse48)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (= (+ (select (select (store .cse49 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse50 .cse51 .cse38)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse52) (<= v_subst_8 4294967295) (<= (+ .cse53 (* (div .cse48 4294967296) 4294967296) 1) .cse48))))))))))))))))) (<= .cse64 v_z_130) (<= v_z_130 4294967295))) (exists ((v_z_130 Int)) (and (exists ((v_y_130 Int)) (let ((.cse84 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse67 (mod .cse84 4294967296))) (let ((.cse83 (+ (* .cse67 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (and (exists ((v_z_134 Int) (v_z_135 Int) (v_ArrVal_341 Int) (v_subst_7 Int) (v_DerPreprocessor_16 Int) (v_subst_6 Int) (v_z_149 Int) (v_y_149 Int) (v_y_135 Int) (v_y_134 Int)) (let ((.cse81 (+ (select (select (let ((.cse82 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse84)))) (store .cse82 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse82 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse83 (+ (* v_y_149 4294967296) v_z_149)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse69 (mod .cse81 4294967296))) (let ((.cse68 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse69 4)))) (let ((.cse79 (+ (select (select (let ((.cse80 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse81)))) (store .cse80 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse80 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse68 (+ (* 4294967296 v_subst_7) v_subst_6)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse66 (mod .cse79 4294967296)) (.cse71 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse79)))) (let ((.cse72 (select .cse71 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse73 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse66 4)))) (let ((.cse78 (store .cse72 .cse73 v_DerPreprocessor_16)) (.cse70 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse77 (store (select (store .cse71 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse78) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse70))) (let ((.cse74 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse78) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse77) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse65 (select .cse74 .cse73))) (and (<= (+ (* 4294967296 (div .cse65 4294967296)) .cse66 1) .cse65) (<= (+ .cse67 1) v_z_149) (<= v_z_134 4294967295) (= .cse68 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) (<= v_subst_6 4294967295) (<= (+ .cse69 1) v_subst_6) (= .cse70 (+ (select (select (store .cse71 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse72 .cse73 .cse65)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= v_z_135 9999) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (= (let ((.cse75 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse74 .cse75 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse76 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse77) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse74 .cse75 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse76 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse76 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))) |c_#memory_int|) (<= v_z_149 4294967295))))))))))))) (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse83)))))) (<= .cse64 v_z_130) (<= v_z_130 4294967295))))))) (and (or (and (exists ((v_y_140 Int) (v_y_130 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_16 Int) (v_z_140 Int) (v_z_130 Int) (v_z_134 Int) (v_z_178 Int) (v_z_135 Int) (v_ArrVal_341 Int) (v_y_135 Int) (v_y_178 Int) (v_y_134 Int)) (let ((.cse107 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 (+ (* v_y_178 4294967296) v_z_178))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse99 (mod .cse107 4294967296))) (let ((.cse100 (+ (* 4 .cse99) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse105 (+ 1 (select (select (let ((.cse106 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse107)))) (store .cse106 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse106 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse100 (+ v_z_130 (* v_y_130 4294967296))))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|)))) (let ((.cse101 (mod .cse105 4294967296)) (.cse95 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse105)))) (let ((.cse96 (select .cse95 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse97 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* 4 .cse101)))) (let ((.cse104 (store .cse96 .cse97 v_DerPreprocessor_18)) (.cse94 (+ v_z_140 (* v_y_140 4294967296)))) (let ((.cse103 (store (select (store .cse95 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse104) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse94))) (let ((.cse87 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse104) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse103) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse88 (+ (* v_z_140 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse86 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse103)) (.cse102 (store .cse87 .cse88 v_DerPreprocessor_16)) (.cse85 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse93 (store (select (store .cse86 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse102) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse85))) (let ((.cse90 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse102) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse93) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse98 (select .cse87 .cse97)) (.cse89 (select .cse90 .cse88))) (and (= .cse85 (+ (select (select (store .cse86 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse87 .cse88 .cse89)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= v_z_134 4294967295) (= (let ((.cse91 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse90 .cse91 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse92 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse93) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse90 .cse91 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse92 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse92 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))) |c_#memory_int|) (<= .cse64 v_z_178) (= .cse94 (+ (select (select (store .cse95 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse96 .cse97 .cse98)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= 0 v_z_140) (<= v_z_178 4294967295) (<= (+ .cse99 1) v_z_130) (<= v_z_135 9999) (= .cse100 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (<= (+ (* (div .cse98 4294967296) 4294967296) .cse101 1) .cse98) (<= (+ (* (div .cse89 4294967296) 4294967296) v_z_140 1) .cse89) (<= v_z_130 4294967295)))))))))))))))) .cse37) (and (exists ((v_y_140 Int) (v_y_130 Int) (v_y_180 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_30 Int) (v_z_140 Int) (v_z_130 Int) (v_z_134 Int) (v_z_135 Int) (v_ArrVal_341 Int) (v_y_135 Int) (v_y_134 Int)) (let ((.cse130 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 v_DerPreprocessor_30)))) (let ((.cse131 (select .cse130 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse111 (+ (* v_y_180 4294967296) .cse31))) (let ((.cse133 (store .cse131 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse111))) (let ((.cse125 (select (store .cse130 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse133) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse132 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse133) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse125 .cse29 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse109 (mod .cse132 4294967296)) (.cse129 (store .cse131 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse132))) (let ((.cse122 (select (store .cse130 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse129) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse123 (+ (* .cse109 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse121 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse129)) (.cse128 (store .cse122 .cse123 v_DerPreprocessor_18)) (.cse124 (+ v_z_140 (* v_y_140 4294967296)))) (let ((.cse127 (store (select (store .cse121 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse128) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse124))) (let ((.cse115 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse128) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse127) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse116 (+ (* v_z_140 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse114 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse127)) (.cse126 (store .cse115 .cse116 v_DerPreprocessor_16)) (.cse113 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse120 (store (select (store .cse114 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse126) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse113))) (let ((.cse117 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse126) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse120) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse108 (select .cse125 .cse20)) (.cse112 (select .cse117 .cse116)) (.cse110 (select .cse115 .cse123))) (and (<= (+ .cse0 (* (div .cse108 4294967296) 4294967296) 1) .cse108) (<= (+ .cse109 (* 4294967296 (div .cse110 4294967296)) 1) .cse110) (<= v_z_134 4294967295) (= (+ 1 (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 .cse108)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|)) .cse111) (<= .cse21 v_z_130) (<= 0 v_z_140) (<= (+ (* (div .cse112 4294967296) 4294967296) v_z_140 1) .cse112) (= .cse113 (+ (select (select (store .cse114 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse115 .cse116 .cse112)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= v_z_135 9999) (= (let ((.cse118 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse117 .cse118 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse119 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse120) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse117 .cse118 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse119 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse119 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))) |c_#memory_int|) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (<= v_z_130 4294967295) (= (+ (select (select (store .cse121 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse122 .cse123 .cse110)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse124))))))))))))))))) .cse34 .cse35 .cse36)) .cse1) (exists ((v_z_140 Int)) (and (<= 0 v_z_140) (exists ((v_z_158 Int)) (and (<= 0 v_z_158) (exists ((v_z_135 Int)) (and (exists ((v_z_134 Int)) (and (<= v_z_134 4294967295) (exists ((v_DerPreprocessor_24 Int) (v_y_140 Int) (v_DerPreprocessor_18 Int) (v_ArrVal_341 Int) (v_y_190 Int) (v_DerPreprocessor_16 Int) (v_z_190 Int) (v_y_135 Int) (v_y_158 Int) (v_DerPreprocessor_32 Int) (v_y_134 Int)) (let ((.cse161 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 v_DerPreprocessor_32))) (.cse142 (+ (* v_y_190 4294967296) v_z_190))) (let ((.cse160 (store (select .cse161 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse142))) (let ((.cse152 (select (store .cse161 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse160) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse153 (+ (* v_z_190 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse151 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse160)) (.cse159 (store .cse152 .cse153 v_DerPreprocessor_24)) (.cse154 (+ v_z_158 (* v_y_158 4294967296)))) (let ((.cse158 (store (select (store .cse151 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse159) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse154))) (let ((.cse135 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse159) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse158) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse136 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* v_z_158 4)))) (let ((.cse134 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse158)) (.cse157 (store .cse135 .cse136 v_DerPreprocessor_18)) (.cse138 (+ v_z_140 (* v_y_140 4294967296)))) (let ((.cse156 (store (select (store .cse134 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse157) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse138))) (let ((.cse149 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse157) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse156) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse150 (+ (* v_z_140 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse148 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse156)) (.cse155 (store .cse149 .cse150 v_DerPreprocessor_16)) (.cse147 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse146 (store (select (store .cse148 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse155) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse147))) (let ((.cse143 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse155) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse146) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse137 (select .cse149 .cse136)) (.cse141 (select .cse152 .cse20)) (.cse139 (select .cse143 .cse150)) (.cse140 (select .cse135 .cse153))) (and (= (+ (select (select (store .cse134 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse135 .cse136 .cse137)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse138) (<= (+ (* (div .cse139 4294967296) 4294967296) v_z_140 1) .cse139) (<= 0 v_z_190) (<= (+ (* (div .cse140 4294967296) 4294967296) v_z_190 1) .cse140) (= (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 .cse141)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse142) (<= (+ v_z_158 (* (div .cse137 4294967296) 4294967296) 1) .cse137) (= |c_#memory_int| (let ((.cse144 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse143 .cse144 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse145 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse146) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse143 .cse144 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse145 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse145 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) (<= (+ .cse0 (* (div .cse141 4294967296) 4294967296) 1) .cse141) (= .cse147 (+ (select (select (store .cse148 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse149 .cse150 .cse139)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (= (+ (select (select (store .cse151 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse152 .cse153 .cse140)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse154)))))))))))))))) (<= (+ v_z_135 1) v_z_134))) (<= v_z_135 9999) (<= 0 v_z_135))))))) (and .cse1 (exists ((v_DerPreprocessor_24 Int) (v_y_140 Int) (v_y_130 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_16 Int) (v_z_140 Int) (v_z_130 Int) (v_z_134 Int) (v_z_135 Int) (v_ArrVal_341 Int) (v_z_158 Int) (v_y_135 Int) (v_y_158 Int) (v_y_134 Int)) (let ((.cse187 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse181 (mod .cse187 4294967296)) (.cse172 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse187)))) (let ((.cse173 (select .cse172 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse174 (+ (* .cse181 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse186 (store .cse173 .cse174 v_DerPreprocessor_24)) (.cse171 (+ v_z_158 (* v_y_158 4294967296)))) (let ((.cse185 (store (select (store .cse172 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse186) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse171))) (let ((.cse167 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse186) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse185) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse168 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* v_z_158 4)))) (let ((.cse166 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse185)) (.cse184 (store .cse167 .cse168 v_DerPreprocessor_18)) (.cse170 (+ v_z_140 (* v_y_140 4294967296)))) (let ((.cse183 (store (select (store .cse166 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse184) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse170))) (let ((.cse178 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse184) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse183) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse179 (+ (* v_z_140 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse177 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse183)) (.cse182 (store .cse178 .cse179 v_DerPreprocessor_16)) (.cse176 (+ v_z_135 (* v_y_135 4294967296)))) (let ((.cse165 (store (select (store .cse177 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse182) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse176))) (let ((.cse162 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse182) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse165) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse169 (select .cse178 .cse168)) (.cse175 (select .cse167 .cse174)) (.cse180 (select .cse162 .cse179))) (and (= (let ((.cse163 (+ (* v_z_135 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse162 .cse163 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse164 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse165) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse162 .cse163 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse164 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse164 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))))) |c_#memory_int|) (<= 0 v_z_158) (<= v_z_134 4294967295) (= (+ (select (select (store .cse166 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse167 .cse168 .cse169)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse170) (= .cse171 (+ (select (select (store .cse172 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse173 .cse174 .cse175)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (= .cse176 (+ (select (select (store .cse177 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse178 .cse179 .cse180)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= 0 v_z_140) (<= (+ (* (div .cse169 4294967296) 4294967296) v_z_158 1) .cse169) (<= (+ .cse181 (* (div .cse175 4294967296) 4294967296) 1) .cse175) (<= (+ v_z_140 (* (div .cse180 4294967296) 4294967296) 1) .cse180) (<= v_z_135 9999) (<= (+ v_z_135 1) v_z_134) (<= 0 v_z_135) (<= .cse64 v_z_130) (<= v_z_130 4294967295)))))))))))))))) .cse37) (and .cse1 (or (and .cse34 .cse35 (or (exists ((v_DerPreprocessor_36 Int) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_20 Int) (v_prenex_138 Int) (v_z_176 Int) (v_prenex_136 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_135 Int) (v_y_216 Int) (v_y_148 Int) (v_z_216 Int) (v_y_176 Int)) (let ((.cse214 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 v_DerPreprocessor_36))) (.cse194 (+ (* v_y_216 4294967296) v_z_216))) (let ((.cse213 (store (select .cse214 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse194))) (let ((.cse197 (select (store .cse214 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse213) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse198 (+ (* v_z_216 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse196 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse213)) (.cse212 (store .cse197 .cse198 v_DerPreprocessor_28)) (.cse195 (+ (* v_y_176 4294967296) v_z_176))) (let ((.cse211 (store (select (store .cse196 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse212) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse195))) (let ((.cse190 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse212) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse211) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse191 (+ (* v_z_176 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse189 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse211)) (.cse210 (store .cse190 .cse191 v_DerPreprocessor_20))) (let ((.cse206 (select (store .cse189 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse210) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse188 (+ (* v_y_148 4294967296) .cse31))) (let ((.cse205 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse210)) (.cse209 (store .cse206 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse188))) (let ((.cse208 (select (store .cse205 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse209) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse207 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse209) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse208 .cse29 (+ v_prenex_135 (* v_prenex_134 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse193 (select .cse197 .cse20)) (.cse199 (select .cse190 .cse198)) (.cse192 (select .cse208 .cse191)) (.cse200 (mod .cse207 4294967296))) (and (<= v_prenex_135 4294967295) (<= .cse21 v_prenex_135) (= .cse188 (+ (select (select (store .cse189 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse190 .cse191 .cse192)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (= (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 .cse193)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse194) (= .cse195 (+ (select (select (store .cse196 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse197 .cse198 .cse199)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= (+ (* (div .cse193 4294967296) 4294967296) .cse0 1) .cse193) (<= (+ .cse200 1) v_prenex_136) (<= v_prenex_136 4294967295) (<= (+ (* (div .cse199 4294967296) 4294967296) v_z_216 1) .cse199) (= (let ((.cse204 (store .cse206 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse207))) (let ((.cse201 (select (store .cse205 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse204) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse202 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse200 4)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse201 .cse202 v_prenex_137)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse203 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse204) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse201 .cse202 (+ (* v_prenex_138 4294967296) v_prenex_136))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse203 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse203 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) |c_#memory_int|) (<= 0 v_z_216) (<= (+ v_z_176 (* (div .cse192 4294967296) 4294967296) 1) .cse192) (<= .cse200 9999) (<= 0 v_z_176))))))))))))))) (exists ((v_prenex_127 Int) (v_DerPreprocessor_36 Int) (v_prenex_128 Int) (v_z_177 Int) (v_y_207 Int) (v_prenex_132 Int) (v_prenex_133 Int) (v_prenex_130 Int) (v_prenex_131 Int) (v_y_177 Int) (v_prenex_129 Int)) (let ((.cse236 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 v_DerPreprocessor_36)))) (let ((.cse237 (select .cse236 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse219 (+ .cse31 (* v_y_207 4294967296)))) (let ((.cse239 (store .cse237 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse219))) (let ((.cse231 (select (store .cse236 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse239) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse238 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse239) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse231 .cse29 (+ (* v_y_177 4294967296) v_z_177))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse216 (mod .cse238 4294967296)) (.cse235 (store .cse237 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse238))) (let ((.cse222 (select (store .cse236 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse235) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse223 (+ (* .cse216 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse221 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse235)) (.cse234 (store .cse222 .cse223 v_prenex_132))) (let ((.cse229 (select (store .cse221 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse234) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse220 (+ .cse31 (* v_prenex_131 4294967296)))) (let ((.cse228 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse234)) (.cse233 (store .cse229 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse220))) (let ((.cse232 (select (store .cse228 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse233) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse230 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse233) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse232 .cse29 (+ (* v_prenex_128 4294967296) v_prenex_127))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse217 (select .cse232 .cse223)) (.cse218 (select .cse231 .cse20)) (.cse215 (mod .cse230 4294967296))) (and (<= (+ .cse215 1) v_prenex_129) (<= v_prenex_129 4294967295) (<= v_z_177 4294967295) (<= (+ .cse216 (* (div .cse217 4294967296) 4294967296) 1) .cse217) (= (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 .cse218)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse219) (<= .cse21 v_z_177) (<= .cse21 v_prenex_127) (= .cse220 (+ (select (select (store .cse221 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse222 .cse223 .cse217)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)) (<= (+ .cse0 (* (div .cse218 4294967296) 4294967296) 1) .cse218) (<= v_prenex_127 4294967295) (= (let ((.cse227 (store .cse229 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse230))) (let ((.cse224 (select (store .cse228 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse227) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse225 (+ (* .cse215 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse224 .cse225 v_prenex_130)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse226 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse227) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse224 .cse225 (+ (* v_prenex_133 4294967296) v_prenex_129))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse226 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse226 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) |c_#memory_int|) (<= .cse215 9999))))))))))))))))) .cse36) (and (or (exists ((v_z_130 Int)) (and (exists ((v_y_130 Int)) (let ((.cse264 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse253 (mod .cse264 4294967296))) (and (exists ((v_z_134 Int)) (and (<= v_z_134 4294967295) (exists ((v_subst_12 Int)) (and (exists ((v_subst_13 Int) (v_z_176 Int) (v_DerPreprocessor_28 Int) (v_ArrVal_341 Int) (v_y_148 Int) (v_DerPreprocessor_20 Int) (v_y_134 Int) (v_y_176 Int)) (let ((.cse255 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse264)))) (let ((.cse256 (select .cse255 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse257 (+ (* .cse253 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse263 (store .cse256 .cse257 v_DerPreprocessor_28)) (.cse258 (+ (* v_y_176 4294967296) v_z_176))) (let ((.cse262 (store (select (store .cse255 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse263) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse258))) (let ((.cse249 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse263) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse262) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse250 (+ (* v_z_176 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse248 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse262)) (.cse261 (store .cse249 .cse250 v_DerPreprocessor_20))) (let ((.cse246 (select (store .cse248 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse261) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse252 (+ (* v_y_148 4294967296) .cse31))) (let ((.cse245 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse261)) (.cse260 (store .cse246 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse252))) (let ((.cse259 (select (store .cse245 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse260) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse247 (+ 1 (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse260) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse259 .cse29 (+ v_subst_12 (* v_subst_13 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|)))) (let ((.cse244 (mod .cse247 4294967296)) (.cse254 (select .cse249 .cse257)) (.cse251 (select .cse259 .cse250))) (and (= (let ((.cse243 (store .cse246 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse247))) (let ((.cse240 (select (store .cse245 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse243) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse241 (+ (* 4 .cse244) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse240 .cse241 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse242 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse243) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse240 .cse241 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse242 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse242 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) |c_#memory_int|) (<= .cse244 9999) (= (+ (select (select (store .cse248 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse249 .cse250 .cse251)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse252) (<= (+ .cse244 1) v_z_134) (<= (+ .cse253 (* (div .cse254 4294967296) 4294967296) 1) .cse254) (= (+ (select (select (store .cse255 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse256 .cse257 .cse254)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1) .cse258) (<= (+ (* (div .cse251 4294967296) 4294967296) v_z_176 1) .cse251) (<= 0 v_z_176)))))))))))))) (<= .cse21 v_subst_12) (<= v_subst_12 4294967295))))) (<= .cse253 9999))))) (<= .cse64 v_z_130) (<= v_z_130 4294967295))) (exists ((v_z_130 Int)) (and (exists ((v_y_130 Int)) (let ((.cse281 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse19 .cse20 (+ v_z_130 (* v_y_130 4294967296)))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse274 (mod .cse281 4294967296))) (let ((.cse265 (+ (* .cse274 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (and (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse265) (exists ((v_y_162 Int) (v_z_142 Int) (v_z_134 Int) (v_ArrVal_341 Int) (v_subst_11 Int) (v_subst_10 Int) (v_y_134 Int) (v_y_142 Int) (v_z_162 Int)) (let ((.cse279 (+ (select (select (let ((.cse280 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse281)))) (store .cse280 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse280 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse265 (+ v_z_162 (* v_y_162 4294967296))))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse275 (mod .cse279 4294967296))) (let ((.cse277 (+ (select (select (let ((.cse278 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse279)))) (store .cse278 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse278 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse275 4)) (+ v_z_142 (* v_y_142 4294967296))))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse267 (mod .cse277 4294967296))) (let ((.cse273 (+ (* .cse267 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse272 (+ (select (select (let ((.cse276 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse277)))) (store .cse276 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse276 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse273 (+ v_subst_10 (* v_subst_11 4294967296))))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1))) (let ((.cse266 (mod .cse272 4294967296))) (and (<= (+ .cse266 1) v_z_134) (<= (+ .cse267 1) v_subst_10) (<= v_z_134 4294967295) (= (let ((.cse271 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse272)))) (let ((.cse268 (select .cse271 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse269 (+ (* 4 .cse266) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse268 .cse269 v_ArrVal_341)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (let ((.cse270 (select (store .cse271 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse268 .cse269 (+ (* v_y_134 4294967296) v_z_134))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (store .cse270 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| (+ (select .cse270 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 1)))))) |c_#memory_int|) (<= .cse266 9999) (<= v_z_162 4294967295) (= .cse273 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) (<= (+ .cse274 1) v_z_162) (<= (+ .cse275 1) v_z_142) (<= v_subst_10 4294967295) (<= v_z_142 4294967295))))))))))))))) (<= .cse64 v_z_130) (<= v_z_130 4294967295)))) .cse37))))))))) is different from false [2023-12-02 19:18:13,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:18:13,123 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 172 [2023-12-02 19:18:13,207 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 0 case distinctions, treesize of input 132 treesize of output 125 [2023-12-02 19:18:13,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 160 [2023-12-02 19:18:13,268 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 34 treesize of output 1 [2023-12-02 19:18:13,836 INFO L349 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2023-12-02 19:18:13,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 294 treesize of output 260 [2023-12-02 19:18:13,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 181 [2023-12-02 19:18:13,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:18:13,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:18:13,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:18:13,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:18:13,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:18:13,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:18:13,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 150 [2023-12-02 19:18:15,176 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:18:15,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 304 treesize of output 268 [2023-12-02 19:18:15,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-12-02 19:18:15,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 83 [2023-12-02 19:18:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 24 not checked. [2023-12-02 19:18:15,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:18:30,604 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 146 DAG size of output: 145 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 19:19:07,217 WARN L293 SmtUtils]: Spent 24.44s on a formula simplification. DAG size of input: 174 DAG size of output: 173 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 19:19:19,854 WARN L293 SmtUtils]: Spent 12.63s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 19:19:39,612 WARN L293 SmtUtils]: Spent 19.76s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-02 19:19:52,638 WARN L293 SmtUtils]: Spent 13.02s on a formula simplification that was a NOOP. DAG size: 150 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)