./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 30e01a73 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_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/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_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire --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.3-dev-30e01a7 [2023-11-23 20:32:45,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:32:45,985 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 20:32:45,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:32:45,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:32:46,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:32:46,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:32:46,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:32:46,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:32:46,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:32:46,047 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:32:46,048 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:32:46,048 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:32:46,050 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:32:46,051 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:32:46,051 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:32:46,052 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:32:46,052 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:32:46,053 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:32:46,053 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:32:46,053 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:32:46,054 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:32:46,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:32:46,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 20:32:46,056 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:32:46,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:32:46,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:32:46,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:32:46,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 20:32:46,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:32:46,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 20:32:46,060 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:32:46,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 20:32:46,061 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:32:46,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:32:46,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:32:46,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:32:46,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:32:46,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:32:46,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:32:46,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 20:32:46,064 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:32:46,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:32:46,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:32:46,065 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 20:32:46,066 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:32:46,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:32:46,066 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_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/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_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire 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-11-23 20:32:46,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:32:46,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:32:46,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:32:46,418 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:32:46,418 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:32:46,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i [2023-11-23 20:32:49,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:32:49,857 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:32:49,857 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i [2023-11-23 20:32:49,868 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/data/15570f326/16b397d83a984f9e8455fda160c581bf/FLAG61877625f [2023-11-23 20:32:49,883 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/data/15570f326/16b397d83a984f9e8455fda160c581bf [2023-11-23 20:32:49,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:32:49,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:32:49,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:32:49,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:32:49,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:32:49,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:32:49" (1/1) ... [2023-11-23 20:32:49,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e90213f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:49, skipping insertion in model container [2023-11-23 20:32:49,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:32:49" (1/1) ... [2023-11-23 20:32:49,934 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:32:50,123 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_f1e7e29c-fddc-4898-99a2-18417817516a/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i[1800,1813] [2023-11-23 20:32:50,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:32:50,155 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:32:50,166 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_f1e7e29c-fddc-4898-99a2-18417817516a/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i[1800,1813] [2023-11-23 20:32:50,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:32:50,187 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:32:50,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50 WrapperNode [2023-11-23 20:32:50,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:32:50,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:32:50,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:32:50,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:32:50,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,225 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2023-11-23 20:32:50,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:32:50,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:32:50,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:32:50,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:32:50,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:32:50,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:32:50,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:32:50,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:32:50,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (1/1) ... [2023-11-23 20:32:50,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:32:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:50,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:32:50,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:32:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:32:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:32:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:32:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:32:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2023-11-23 20:32:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2023-11-23 20:32:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2023-11-23 20:32:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2023-11-23 20:32:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:32:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:32:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 20:32:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:32:50,471 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:32:50,474 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:32:50,648 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:32:50,698 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:32:50,699 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:32:50,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:32:50 BoogieIcfgContainer [2023-11-23 20:32:50,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:32:50,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:32:50,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:32:50,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:32:50,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:32:49" (1/3) ... [2023-11-23 20:32:50,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4945acbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:32:50, skipping insertion in model container [2023-11-23 20:32:50,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:50" (2/3) ... [2023-11-23 20:32:50,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4945acbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:32:50, skipping insertion in model container [2023-11-23 20:32:50,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:32:50" (3/3) ... [2023-11-23 20:32:50,712 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_2.i [2023-11-23 20:32:50,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:32:50,735 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 20:32:50,802 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:32:50,809 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;@5434474f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:32:50,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 20:32:50,815 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-11-23 20:32:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 20:32:50,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:50,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:50,829 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-11-23 20:32:50,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash 290853727, now seen corresponding path program 1 times [2023-11-23 20:32:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:50,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488838642] [2023-11-23 20:32:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:51,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488838642] [2023-11-23 20:32:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488838642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:32:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:32:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:32:51,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113165397] [2023-11-23 20:32:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:32:51,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:32:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:32:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:32:51,678 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-11-23 20:32:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:51,794 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2023-11-23 20:32:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:32:51,797 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-11-23 20:32:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:51,806 INFO L225 Difference]: With dead ends: 38 [2023-11-23 20:32:51,806 INFO L226 Difference]: Without dead ends: 18 [2023-11-23 20:32:51,809 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-11-23 20:32:51,813 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-11-23 20:32:51,814 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-11-23 20:32:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-23 20:32:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-23 20:32:51,848 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-11-23 20:32:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-11-23 20:32:51,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2023-11-23 20:32:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:51,852 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-11-23 20:32:51,852 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-11-23 20:32:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-11-23 20:32:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 20:32:51,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:51,854 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:51,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:32:51,855 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-11-23 20:32:51,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1069718888, now seen corresponding path program 1 times [2023-11-23 20:32:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:51,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688678780] [2023-11-23 20:32:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:32:52,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:52,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688678780] [2023-11-23 20:32:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688678780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:52,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712297469] [2023-11-23 20:32:52,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:52,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:52,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:52,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:32:52,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 20:32:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:53,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 20:32:53,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:32:53,111 INFO L378 Elim1Store]: Elim1 eliminated variable 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-11-23 20:32:53,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 20:32:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:32:53,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:32:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712297469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:54,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [915984946] [2023-11-23 20:32:54,155 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-23 20:32:54,155 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:32:54,160 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-11-23 20:32:54,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:32:54,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-23 20:32:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478832615] [2023-11-23 20:32:54,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:32:54,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 20:32:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:54,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 20:32:54,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2023-11-23 20:32:54,170 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 13 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 20:32:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:55,133 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-11-23 20:32:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 20:32:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2023-11-23 20:32:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:55,135 INFO L225 Difference]: With dead ends: 31 [2023-11-23 20:32:55,135 INFO L226 Difference]: Without dead ends: 22 [2023-11-23 20:32:55,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=273, Unknown=2, NotChecked=0, Total=342 [2023-11-23 20:32:55,137 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:55,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 59 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 20:32:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-23 20:32:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-23 20:32:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 20:32:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-11-23 20:32:55,147 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2023-11-23 20:32:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:55,147 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-11-23 20:32:55,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 20:32:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-11-23 20:32:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 20:32:55,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:55,149 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:55,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 20:32:55,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:55,364 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-11-23 20:32:55,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash -272177224, now seen corresponding path program 2 times [2023-11-23 20:32:55,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894658892] [2023-11-23 20:32:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 20:32:56,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:56,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894658892] [2023-11-23 20:32:56,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894658892] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:56,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947756990] [2023-11-23 20:32:56,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 20:32:56,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:56,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:56,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:32:56,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1e7e29c-fddc-4898-99a2-18417817516a/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 20:32:57,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 20:32:57,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:32:57,082 WARN L260 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 126 conjunts are in the unsatisfiable core [2023-11-23 20:32:57,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:32:57,102 INFO L378 Elim1Store]: Elim1 eliminated variable 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-11-23 20:32:57,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 20:33:02,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|))) (let ((.cse1 (mod (select .cse4 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) 4294967296))) (let ((.cse20 (* .cse1 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|)) (.cse3 (+ .cse1 1)) (.cse9 (select |c_#memory_int| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse10 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse2 (+ .cse20 |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (or (and .cse0 (<= 2147483648 .cse1) (= (+ 17179869184 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset|) .cse2) (let ((.cse11 (+ (- 17179869184) .cse20 |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (or (exists ((v_z_1 Int)) (and (<= v_z_1 4294967295) (<= .cse3 v_z_1) (exists ((v_y_1 Int)) (let ((.cse8 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse11 (+ v_z_1 (* v_y_1 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 ((.cse7 (mod .cse8 4294967296))) (and (exists ((|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26| Int) (v_ArrVal_90 Int)) (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (let ((.cse5 (+ 1 (select (select (let ((.cse6 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse4 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse8)))) (store .cse6 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse6 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ (* .cse7 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) v_ArrVal_90))) |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|)))) (store (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse4 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse5)) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ (* (mod .cse5 4294967296) 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26|))) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse9) |c_#memory_int|)) (<= .cse7 9999))))))) (exists ((v_z_1 Int)) (and (<= v_z_1 4294967295) (exists ((v_y_1 Int)) (let ((.cse19 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse11 (+ v_z_1 (* v_y_1 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 ((.cse12 (mod .cse19 4294967296))) (and (<= .cse12 9999) (exists ((|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26| Int) (v_z_2 Int) (v_y_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse14 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse4 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse19)))) (let ((.cse17 (+ (* v_y_2 4294967296) v_z_2)) (.cse15 (select .cse14 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse16 (+ (* .cse12 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse13 (select (let ((.cse18 (store .cse15 .cse16 v_DerPreprocessor_1))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse18) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store (select (store .cse14 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .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| .cse17))) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (and (<= v_z_2 9999) (<= 0 v_z_2) (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse13 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* v_z_2 4)) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26|)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse9) |c_#memory_int|) (= (+ (select (select (store .cse14 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse15 .cse16 (select .cse13 .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|) 1) .cse17)))))))))) (<= .cse3 v_z_1)))))) (and (<= .cse1 2147483647) (or (exists ((v_z_5 Int)) (and (<= 0 v_z_5) (<= v_z_5 9999) (exists ((v_y_5 Int) (v_DerPreprocessor_5 Int)) (let ((.cse23 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse2 v_DerPreprocessor_5)))) (let ((.cse24 (select .cse23 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base|)) (.cse21 (+ v_z_5 (* v_y_5 4294967296)))) (let ((.cse27 (store .cse24 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse21))) (let ((.cse28 (select (store .cse23 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse27) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse22 (select .cse28 .cse2))) (and (= .cse21 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse2 .cse22)) |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)) (<= (+ .cse1 (* (div .cse22 4294967296) 4294967296) 1) .cse22) (exists ((v_ArrVal_90 Int) (v_prenex_13 Int)) (let ((.cse25 (+ (select (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse27) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse28 (+ (* v_z_5 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) v_ArrVal_90)) |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 ((.cse26 (mod .cse25 4294967296))) (and (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select (store .cse23 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse24 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse25)) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) (+ (* .cse26 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) v_prenex_13)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse9) |c_#memory_int|) (<= .cse26 9999)))))))))))))) (exists ((v_z_5 Int)) (and (<= 0 v_z_5) (<= v_z_5 9999) (exists ((v_y_5 Int) (v_DerPreprocessor_5 Int)) (let ((.cse38 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse2 v_DerPreprocessor_5))) (.cse29 (+ v_z_5 (* v_y_5 4294967296)))) (let ((.cse37 (store (select .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| .cse29))) (let ((.cse33 (select (store .cse38 |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse37) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (let ((.cse30 (select .cse33 .cse2))) (and (= .cse29 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse2 .cse30)) |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)) (<= (+ .cse1 (* (div .cse30 4294967296) 4294967296) 1) .cse30) (exists ((|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26| Int) (v_z_2 Int) (v_y_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse32 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse37)) (.cse35 (+ (* v_y_2 4294967296) v_z_2)) (.cse34 (+ (* v_z_5 4) |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|))) (let ((.cse31 (select (let ((.cse36 (store .cse33 .cse34 v_DerPreprocessor_1))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse36) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store (select (store .cse32 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| .cse36) |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| .cse35))) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (and (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse31 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* v_z_2 4)) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26|)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse9) |c_#memory_int|) (<= v_z_2 9999) (<= 0 v_z_2) (= (+ (select (select (store .cse32 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse33 .cse34 (select .cse31 .cse34))) |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) .cse35))))))))))))) (and .cse0 (or (exists ((v_z_1 Int)) (and (<= v_z_1 4294967295) (<= .cse3 v_z_1) (exists ((v_y_1 Int)) (let ((.cse46 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse2 (+ v_z_1 (* v_y_1 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 .cse46 4294967296))) (and (<= .cse39 9999) (exists ((|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26| Int) (v_z_2 Int) (v_y_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse42 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse4 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse46)))) (let ((.cse41 (+ (* v_y_2 4294967296) v_z_2)) (.cse43 (select .cse42 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|)) (.cse44 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* .cse39 4)))) (let ((.cse40 (select (let ((.cse45 (store .cse43 .cse44 v_DerPreprocessor_1))) (store (store |c_old(#memory_int)| |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| (store (select (store .cse42 |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|) |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse41))) |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|))) (and (<= v_z_2 9999) (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse40 (+ |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset| (* v_z_2 4)) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26|)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse9) |c_#memory_int|) (<= 0 v_z_2) (= .cse41 (+ (select (select (store .cse42 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse43 .cse44 (select .cse40 .cse44))) |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))))))))))))) (exists ((v_z_1 Int)) (and (<= v_z_1 4294967295) (<= .cse3 v_z_1) (exists ((v_y_1 Int)) (let ((.cse51 (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store .cse10 .cse2 (+ v_z_1 (* v_y_1 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 ((.cse50 (mod .cse51 4294967296))) (and (exists ((|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26| Int) (v_ArrVal_90 Int)) (let ((.cse48 (+ (select (select (let ((.cse49 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse4 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse51)))) (store .cse49 |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select .cse49 |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| (* .cse50 4)) v_ArrVal_90))) |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 ((.cse47 (mod .cse48 4294967296))) (and (<= .cse47 9999) (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| (store .cse4 |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse48)) |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| (* .cse47 4)) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_26|)) |c_func_to_recursive_line_38_to_41_0_#in~index#1.base| .cse9) |c_#memory_int|))))) (<= .cse50 9999)))))))) (= |c_func_to_recursive_line_38_to_41_0_#in~index#1.offset| .cse2))))))))) is different from false [2023-11-23 20:33:03,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:03,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 263 [2023-11-23 20:33:03,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:33:03,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 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 200 treesize of output 239 [2023-11-23 20:33:03,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-11-23 20:33:04,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,309 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 98 treesize of output 75 [2023-11-23 20:33:04,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:33:04,317 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 0 case distinctions, treesize of input 12 treesize of output 3 [2023-11-23 20:33:04,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 39 treesize of output 24 [2023-11-23 20:33:04,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 28 treesize of output 15 [2023-11-23 20:33:04,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,495 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 106 treesize of output 83 [2023-11-23 20:33:04,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:33:04,503 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 0 case distinctions, treesize of input 12 treesize of output 3 [2023-11-23 20:33:04,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:33:04,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2023-11-23 20:33:04,571 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 19 treesize of output 1 [2023-11-23 20:33:04,792 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 20:33:04,880 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-11-23 20:33:05,160 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 20:33:05,160 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 52 treesize of output 36 [2023-11-23 20:33:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2023-11-23 20:33:05,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:33:21,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:33:21,109 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 623 treesize of output 627 [2023-11-23 20:33:22,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:33:22,042 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 623 treesize of output 627 [2023-11-23 20:33:23,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:33:23,166 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 623 treesize of output 627 [2023-11-23 20:33:24,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:33:24,487 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 645 treesize of output 649 [2023-11-23 20:33:25,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:33:25,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 645 treesize of output 649 [2023-11-23 20:33:26,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:33:26,320 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 623 treesize of output 627 [2023-11-23 20:33:27,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:33:27,131 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 623 treesize of output 627 [2023-11-23 20:33:35,819 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (let ((.cse108 (* .cse0 4))) (let ((.cse1 (+ .cse0 1)) (.cse17 (+ (- 17179869184) .cse108 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse15 (+ .cse108 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse78 (< 2147483647 .cse0))) (and (or (< .cse0 2147483648) (and (forall ((v_z_31 Int)) (or (< v_z_31 .cse1) (forall ((v_y_31 Int)) (let ((.cse16 (+ (* v_y_31 4294967296) v_z_31))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse17 .cse16)))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse9 (+ (select .cse8 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse7 (mod .cse9 4294967296))) (or (forall ((v_ArrVal_115 Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45| Int)) (or (< 0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse9))) (let ((.cse2 (store (select (store .cse6 |c_ULTIMATE.start_main_~#index~0#1.base| .cse5) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* .cse7 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse5) |c_ULTIMATE.start_main_~#array~0#1.base| .cse2) |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse4 (+ (select .cse3 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| .cse2) |c_ULTIMATE.start_main_~#index~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod .cse4 4294967296) 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45|)))))) |c_ULTIMATE.start_main_~#index~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_main_~#array~0#1.base|) |c_ULTIMATE.start_main_~#array~0#1.offset|) 4294967296)) (not (= (select v_arrayElimArr_10 |c_ULTIMATE.start_main_~#index~0#1.offset|) 0)))) (< (mod (+ (select (select (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse15 .cse16)))) (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse12 (+ (select .cse13 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse12))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse10) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store .cse11 |c_ULTIMATE.start_main_~#index~0#1.base| .cse10) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) (* (mod .cse12 4294967296) 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115)))))) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 1) 4294967296) 2147483648))) (< 9999 .cse7)))))))) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (< v_z_31 .cse1) (forall ((v_y_31 Int)) (let ((.cse30 (+ (* v_y_31 4294967296) v_z_31))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse17 .cse30)))) (let ((.cse24 (select .cse22 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse25 (+ (select .cse24 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse23 (mod .cse25 4294967296))) (or (forall ((v_ArrVal_115 Int)) (or (forall ((|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< 0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (let ((.cse21 (store .cse24 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse25))) (let ((.cse18 (store (select (store .cse22 |c_ULTIMATE.start_main_~#index~0#1.base| .cse21) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* .cse23 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse21) |c_ULTIMATE.start_main_~#array~0#1.base| .cse18) |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse20 (+ (select .cse19 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| .cse18) |c_ULTIMATE.start_main_~#index~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse20)) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod .cse20 4294967296) 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45|)))))) |c_ULTIMATE.start_main_~#index~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~#array~0#1.base|) |c_ULTIMATE.start_main_~#array~0#1.offset|) 4294967296)) (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~#index~0#1.offset|) 0)))) (< 2147483647 (mod (+ (select (select (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse15 .cse30)))) (let ((.cse29 (select .cse27 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse28 (+ (select .cse29 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse26 (store .cse29 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse28))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse26) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store .cse27 |c_ULTIMATE.start_main_~#index~0#1.base| .cse26) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) (* (mod .cse28 4294967296) 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115)))))) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 1) 4294967296)))) (< 9999 .cse23)))))))) (< 4294967295 v_z_31))))) (or (and (forall ((v_ArrVal_115 Int) (v_z_24 Int) (v_y_24 Int) (|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse42 (+ v_z_24 (* v_y_24 4294967296)))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse15 .cse42)))) (let ((.cse45 (select .cse43 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse44 (+ (select .cse45 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse41 (store .cse45 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse44)) (.cse31 (mod .cse44 4294967296))) (let ((.cse38 (store (select (store .cse43 |c_ULTIMATE.start_main_~#index~0#1.base| .cse41) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* .cse31 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115)) (.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse17 .cse42)))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~#index~0#1.base|)) (.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse41) |c_ULTIMATE.start_main_~#array~0#1.base| .cse38) |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse40 (+ (select .cse39 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)) (.cse36 (+ (select .cse35 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse34 (mod .cse36 4294967296)) (.cse37 (mod .cse40 4294967296))) (or (< v_z_24 .cse1) (< 9999 .cse31) (< 4294967295 v_z_24) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#index~0#1.offset|) 0)) (< 2147483647 (mod (+ (select (select (let ((.cse32 (store .cse35 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse36))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse32) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store .cse33 |c_ULTIMATE.start_main_~#index~0#1.base| .cse32) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) (* .cse34 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115))) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 1) 4294967296)) (< 9999 .cse37) (< 2147483647 .cse34) (< 0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| .cse38) |c_ULTIMATE.start_main_~#index~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse40)) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| (* .cse37 4)) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~#index~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~#array~0#1.base|) |c_ULTIMATE.start_main_~#array~0#1.offset|) 4294967296))))))))))))) (forall ((v_z_25 Int) (v_ArrVal_115 Int) (v_arrayElimArr_11 (Array Int Int)) (v_y_25 Int) (|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45| Int)) (let ((.cse58 (+ v_z_25 (* v_y_25 4294967296)))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse15 .cse58)))) (let ((.cse60 (select .cse57 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse59 (+ (select .cse60 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse56 (store .cse60 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse59)) (.cse46 (mod .cse59 4294967296))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse17 .cse58))) (.cse53 (store (select (store .cse57 |c_ULTIMATE.start_main_~#index~0#1.base| .cse56) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* .cse46 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115))) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse56) |c_ULTIMATE.start_main_~#array~0#1.base| .cse53) |c_ULTIMATE.start_main_~#index~0#1.base|)) (.cse50 (select .cse48 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse51 (+ (select .cse50 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)) (.cse55 (+ (select .cse54 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse52 (mod .cse55 4294967296)) (.cse49 (mod .cse51 4294967296))) (or (not (= (select v_arrayElimArr_11 |c_ULTIMATE.start_main_~#index~0#1.offset|) 0)) (< 9999 .cse46) (< v_z_25 .cse1) (< (mod (+ (select (select (let ((.cse47 (store .cse50 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse51))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse47) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store .cse48 |c_ULTIMATE.start_main_~#index~0#1.base| .cse47) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* .cse49 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115))) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 1) 4294967296) 2147483648) (< 9999 .cse52) (< 0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| .cse53) |c_ULTIMATE.start_main_~#index~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse55)) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| (* .cse52 4)) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~#index~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~#array~0#1.base|) |c_ULTIMATE.start_main_~#array~0#1.offset|) 4294967296)) (< 4294967295 v_z_25) (< 2147483647 .cse49)))))))))))) (forall ((v_ArrVal_115 Int) (v_arrayElimArr_6 (Array Int Int)) (v_z_26 Int) (v_y_26 Int) (|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45| Int)) (let ((.cse75 (+ v_z_26 (* v_y_26 4294967296)))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse15 .cse75)))) (let ((.cse77 (select .cse74 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse76 (+ (select .cse77 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse73 (store .cse77 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse76)) (.cse68 (mod .cse76 4294967296)) (.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse17 .cse75)))) (let ((.cse72 (select .cse70 |c_ULTIMATE.start_main_~#index~0#1.base|)) (.cse62 (store (select (store .cse74 |c_ULTIMATE.start_main_~#index~0#1.base| .cse73) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| (* 4 .cse68)) v_ArrVal_115))) (let ((.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse73) |c_ULTIMATE.start_main_~#array~0#1.base| .cse62) |c_ULTIMATE.start_main_~#index~0#1.base|)) (.cse69 (+ (select .cse72 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse71 (store .cse72 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse69)) (.cse64 (+ (select .cse63 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse61 (mod .cse64 4294967296)) (.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse71)) (.cse66 (select (store .cse70 |c_ULTIMATE.start_main_~#index~0#1.base| .cse71) |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse67 (* (mod .cse69 4294967296) 4))) (or (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#index~0#1.offset|) 0)) (< v_z_26 .cse1) (< 9999 .cse61) (< 0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| .cse62) |c_ULTIMATE.start_main_~#index~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse64)) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* .cse61 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~#index~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array~0#1.base|) |c_ULTIMATE.start_main_~#array~0#1.offset|) 4294967296)) (< 4294967295 v_z_26) (< (mod (+ (select (select (store .cse65 |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse66 (+ (- 17179869184) .cse67 |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115)) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 1) 4294967296) 2147483648) (< 2147483647 (mod (+ (select (select (store .cse65 |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse66 (+ .cse67 |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115)) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 1) 4294967296)) (< 9999 .cse68))))))))))))) .cse78) (or (and (forall ((v_ArrVal_115 Int) (|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45| Int) (v_arrayElimArr_12 (Array Int Int)) (v_y_20 Int) (v_z_20 Int)) (let ((.cse90 (+ v_z_20 (* v_y_20 4294967296)))) (let ((.cse91 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse15 .cse90)))) (let ((.cse93 (select .cse91 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse92 (+ (select .cse93 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse89 (store .cse93 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse92)) (.cse81 (mod .cse92 4294967296))) (let ((.cse86 (store (select (store .cse91 |c_ULTIMATE.start_main_~#index~0#1.base| .cse89) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* .cse81 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115)) (.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse17 .cse90)))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#index~0#1.base|)) (.cse87 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse89) |c_ULTIMATE.start_main_~#array~0#1.base| .cse86) |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse88 (+ (select .cse87 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)) (.cse85 (+ (select .cse84 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse79 (mod .cse85 4294967296)) (.cse80 (mod .cse88 4294967296))) (or (< v_z_20 .cse1) (< .cse79 2147483648) (< 9999 .cse80) (< 9999 .cse81) (< (mod (+ (select (select (let ((.cse82 (store .cse84 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse85))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse82) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store .cse83 |c_ULTIMATE.start_main_~#index~0#1.base| .cse82) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* .cse79 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115))) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 1) 4294967296) 2147483648) (< 4294967295 v_z_20) (< 0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| .cse86) |c_ULTIMATE.start_main_~#index~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse88)) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ |c_ULTIMATE.start_main_~#array~0#1.offset| (* 4 .cse80)) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~#index~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~#array~0#1.base|) |c_ULTIMATE.start_main_~#array~0#1.offset|) 4294967296)) (not (= (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~#index~0#1.offset|) 0))))))))))))) (forall ((v_ArrVal_115 Int) (v_arrayElimArr_8 (Array Int Int)) (|v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45| Int) (v_z_21 Int) (v_y_21 Int)) (let ((.cse106 (+ v_z_21 (* v_y_21 4294967296)))) (let ((.cse104 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse15 .cse106)))) (let ((.cse107 (select .cse104 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse105 (+ (select .cse107 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse103 (store .cse107 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse105))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse14 .cse17 .cse106))) (.cse95 (store (select (store .cse104 |c_ULTIMATE.start_main_~#index~0#1.base| .cse103) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* 4 (mod .cse105 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115))) (let ((.cse96 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse103) |c_ULTIMATE.start_main_~#array~0#1.base| .cse95) |c_ULTIMATE.start_main_~#index~0#1.base|)) (.cse101 (select .cse99 |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse102 (+ (select .cse101 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)) (.cse97 (+ (select .cse96 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))) (let ((.cse94 (mod .cse97 4294967296)) (.cse100 (mod .cse102 4294967296))) (or (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~#index~0#1.offset|) 0)) (< v_z_21 .cse1) (< 9999 .cse94) (< 4294967295 v_z_21) (< 0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| .cse95) |c_ULTIMATE.start_main_~#index~0#1.base| (store .cse96 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse97)) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* 4 .cse94) |c_ULTIMATE.start_main_~#array~0#1.offset|) |v_func_to_recursive_line_38_to_41_0_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~#index~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~#array~0#1.base|) |c_ULTIMATE.start_main_~#array~0#1.offset|) 4294967296)) (< 2147483647 (mod (+ (select (select (let ((.cse98 (store .cse101 |c_ULTIMATE.start_main_~#index~0#1.offset| .cse102))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse98) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select (store .cse99 |c_ULTIMATE.start_main_~#index~0#1.base| .cse98) |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) (* .cse100 4) |c_ULTIMATE.start_main_~#array~0#1.offset|) v_ArrVal_115))) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 1) 4294967296)) (< .cse100 2147483648))))))))))))) .cse78))))) is different from true [2023-11-23 20:33:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947756990] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:33:35,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2030308257] [2023-11-23 20:33:35,827 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-23 20:33:35,827 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:33:35,828 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-11-23 20:33:35,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:33:35,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2023-11-23 20:33:35,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055985830] [2023-11-23 20:33:35,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:33:35,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 20:33:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:33:35,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 20:33:35,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=897, Unknown=2, NotChecked=122, Total=1122 [2023-11-23 20:33:35,833 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 28 states, 19 states have (on average 1.736842105263158) internal successors, (33), 25 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-11-23 20:33:39,123 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-11-23 20:33:40,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]