./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/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_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/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_7a6e0f71-4ade-4164-b18e-24d9d515145d/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 fab3df42fb7f885fd39a281a051af0420a7d494ced4f3c2e06236facb6a7ec78 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:36:13,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:36:13,643 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 20:36:13,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:36:13,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:36:13,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:36:13,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:36:13,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:36:13,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:36:13,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:36:13,700 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:36:13,701 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:36:13,702 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:36:13,706 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:36:13,708 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:36:13,708 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:36:13,709 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:36:13,709 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:36:13,710 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:36:13,711 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:36:13,711 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:36:13,712 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:36:13,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:36:13,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 20:36:13,714 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:36:13,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:36:13,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:36:13,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:36:13,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 20:36:13,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:36:13,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 20:36:13,718 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:36:13,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 20:36:13,719 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:36:13,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:36:13,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:36:13,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:36:13,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:36:13,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:36:13,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:36:13,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 20:36:13,722 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:36:13,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:36:13,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:36:13,723 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 20:36:13,723 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:36:13,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:36:13,724 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_7a6e0f71-4ade-4164-b18e-24d9d515145d/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_7a6e0f71-4ade-4164-b18e-24d9d515145d/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 -> fab3df42fb7f885fd39a281a051af0420a7d494ced4f3c2e06236facb6a7ec78 [2023-11-23 20:36:14,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:36:14,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:36:14,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:36:14,131 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:36:14,131 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:36:14,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-11-23 20:36:17,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:36:17,574 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:36:17,576 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-11-23 20:36:17,585 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/data/b078b5740/67c865742a4a41018b93ccbd8742802c/FLAG64b2a2eaf [2023-11-23 20:36:17,606 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/data/b078b5740/67c865742a4a41018b93ccbd8742802c [2023-11-23 20:36:17,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:36:17,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:36:17,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:36:17,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:36:17,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:36:17,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:17,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7221545c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17, skipping insertion in model container [2023-11-23 20:36:17,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:17,653 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:36:17,882 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_7a6e0f71-4ade-4164-b18e-24d9d515145d/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-11-23 20:36:17,887 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_7a6e0f71-4ade-4164-b18e-24d9d515145d/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-11-23 20:36:17,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:36:17,900 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:36:17,946 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_7a6e0f71-4ade-4164-b18e-24d9d515145d/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-11-23 20:36:17,947 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_7a6e0f71-4ade-4164-b18e-24d9d515145d/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-11-23 20:36:17,970 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:36:17,982 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:36:17,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17 WrapperNode [2023-11-23 20:36:17,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:36:17,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:36:17,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:36:17,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:36:17,993 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:36:17" (1/1) ... [2023-11-23 20:36:18,004 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:36:17" (1/1) ... [2023-11-23 20:36:18,034 INFO L138 Inliner]: procedures = 13, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2023-11-23 20:36:18,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:36:18,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:36:18,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:36:18,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:36:18,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:36:18,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:36:18,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:36:18,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:36:18,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (1/1) ... [2023-11-23 20:36:18,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:36:18,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:18,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/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:36:18,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/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:36:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:36:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:36:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:36:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:36:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:36:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:36:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 20:36:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:36:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_15_0 [2023-11-23 20:36:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_15_0 [2023-11-23 20:36:18,230 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:36:18,232 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:36:18,409 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:36:18,434 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:36:18,434 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:36:18,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:18 BoogieIcfgContainer [2023-11-23 20:36:18,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:36:18,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:36:18,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:36:18,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:36:18,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:36:17" (1/3) ... [2023-11-23 20:36:18,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80a9149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:18, skipping insertion in model container [2023-11-23 20:36:18,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:17" (2/3) ... [2023-11-23 20:36:18,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80a9149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:18, skipping insertion in model container [2023-11-23 20:36:18,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:18" (3/3) ... [2023-11-23 20:36:18,449 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_linear-inequality-inv-a.c [2023-11-23 20:36:18,468 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:36:18,468 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 20:36:18,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:36:18,548 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;@18516115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:36:18,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-23 20:36:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 20:36:18,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:18,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:18,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:36:18,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash 947785726, now seen corresponding path program 1 times [2023-11-23 20:36:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:36:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354548598] [2023-11-23 20:36:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:36:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:19,286 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:36:19,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:36:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354548598] [2023-11-23 20:36:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354548598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:19,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:36:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68731777] [2023-11-23 20:36:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:19,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:36:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:36:19,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:36:19,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:19,330 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:36:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:19,440 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-23 20:36:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:36:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-23 20:36:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:19,452 INFO L225 Difference]: With dead ends: 28 [2023-11-23 20:36:19,452 INFO L226 Difference]: Without dead ends: 22 [2023-11-23 20:36:19,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:36:19,460 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:19,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:36:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-23 20:36:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-11-23 20:36:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 20:36:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-11-23 20:36:19,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2023-11-23 20:36:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:19,510 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-23 20:36:19,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:36:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-11-23 20:36:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 20:36:19,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:19,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:19,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:36:19,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:36:19,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash -683409516, now seen corresponding path program 1 times [2023-11-23 20:36:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:36:19,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216898477] [2023-11-23 20:36:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:36:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:19,886 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:36:19,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:36:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216898477] [2023-11-23 20:36:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216898477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:36:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630811558] [2023-11-23 20:36:19,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:19,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:36:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:36:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:36:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:36:19,890 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:36:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:19,984 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-11-23 20:36:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:36:19,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-23 20:36:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:19,986 INFO L225 Difference]: With dead ends: 22 [2023-11-23 20:36:19,986 INFO L226 Difference]: Without dead ends: 17 [2023-11-23 20:36:19,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:36:19,992 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:19,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:36:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-23 20:36:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-23 20:36:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 20:36:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-11-23 20:36:20,007 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2023-11-23 20:36:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:20,007 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-11-23 20:36:20,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:36:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-11-23 20:36:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 20:36:20,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:20,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:20,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:36:20,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:36:20,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1341401249, now seen corresponding path program 1 times [2023-11-23 20:36:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:36:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159996551] [2023-11-23 20:36:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:20,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:36:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:21,353 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:36:21,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:36:21,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159996551] [2023-11-23 20:36:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159996551] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:21,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797348254] [2023-11-23 20:36:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:21,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:21,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:21,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:36:21,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 20:36:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:21,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-23 20:36:21,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:21,811 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 20:36:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-23 20:36:22,444 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse9 (exists ((v_z_1 Int) (v_y_1 Int)) (and (<= v_z_1 255) (<= 0 v_z_1) (= (let ((.cse11 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse7 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* 256 v_y_1) v_z_1))))) (let ((.cse12 (select .cse11 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse13 (+ (select .cse12 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_1))) (let ((.cse10 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse13)))) (store .cse10 |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store (select .cse10 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store .cse11 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse12 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse13)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))))) |c_#memory_int|)))) (.cse0 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse1 (= |c_func_to_recursive_line_12_to_15_0_#in~v.offset| |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (or (and (or (not .cse0) (not .cse1)) (exists ((v_y_1 Int)) (let ((.cse8 (* 256 v_y_1)) (.cse6 (select (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (= (let ((.cse2 (let ((.cse4 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse7 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| .cse6)))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse5 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse5 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ .cse6 (* (- 256) v_y_1) (select .cse5 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))) (store .cse2 |c_func_to_recursive_line_12_to_15_0_#in~i.base| (let ((.cse3 (select .cse2 |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))) |c_#memory_int|) (<= .cse6 (+ .cse8 255)) (<= .cse8 .cse6))))) (and .cse9 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~i.base|) (= |c_func_to_recursive_line_12_to_15_0_#in~i.offset| |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (and .cse9 .cse0 .cse1)))) is different from true [2023-11-23 20:36:22,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:22,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:22,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:22,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 33 [2023-11-23 20:36:22,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 40 [2023-11-23 20:36:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-23 20:36:22,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:23,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797348254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:23,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1961806252] [2023-11-23 20:36:23,400 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-23 20:36:23,400 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:36:23,405 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 20:36:23,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:36:23,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-11-23 20:36:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098758769] [2023-11-23 20:36:23,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:23,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 20:36:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:36:23,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 20:36:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2023-11-23 20:36:23,409 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 20:36:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:24,701 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-23 20:36:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 20:36:24,702 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2023-11-23 20:36:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:24,703 INFO L225 Difference]: With dead ends: 30 [2023-11-23 20:36:24,703 INFO L226 Difference]: Without dead ends: 26 [2023-11-23 20:36:24,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=69, Invalid=314, Unknown=1, NotChecked=36, Total=420 [2023-11-23 20:36:24,705 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:24,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 72 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 27 Unchecked, 0.5s Time] [2023-11-23 20:36:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-23 20:36:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2023-11-23 20:36:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 20:36:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-23 20:36:24,714 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2023-11-23 20:36:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:24,714 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-23 20:36:24,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 20:36:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-23 20:36:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:36:24,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:24,715 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:24,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 20:36:24,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:24,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:36:24,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1366238291, now seen corresponding path program 1 times [2023-11-23 20:36:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:36:24,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133702737] [2023-11-23 20:36:24,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:36:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:25,498 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:36:25,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:36:25,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133702737] [2023-11-23 20:36:25,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133702737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:25,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574255999] [2023-11-23 20:36:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:25,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:25,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:25,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:36:25,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 20:36:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:25,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-23 20:36:25,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:25,735 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 20:36:25,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-23 20:36:25,829 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_3 Int) (func_to_recursive_line_12_to_15_0_~v.offset Int) (v_y_3 Int)) (and (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset (+ v_z_3 (* 256 v_y_3)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_3))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_3) (<= v_z_3 255))) is different from true [2023-11-23 20:36:25,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:25,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2023-11-23 20:36:25,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-11-23 20:36:26,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-11-23 20:36:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-23 20:36:26,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574255999] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [148898411] [2023-11-23 20:36:27,146 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-23 20:36:27,146 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:36:27,147 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:36:27,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:36:27,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-11-23 20:36:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362631024] [2023-11-23 20:36:27,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:27,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 20:36:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:36:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 20:36:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=189, Unknown=2, NotChecked=28, Total=272 [2023-11-23 20:36:27,150 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 20:36:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:27,454 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2023-11-23 20:36:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 20:36:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2023-11-23 20:36:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:27,456 INFO L225 Difference]: With dead ends: 26 [2023-11-23 20:36:27,456 INFO L226 Difference]: Without dead ends: 21 [2023-11-23 20:36:27,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=304, Unknown=2, NotChecked=36, Total=420 [2023-11-23 20:36:27,457 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:27,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2023-11-23 20:36:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-23 20:36:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-23 20:36:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 20:36:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-11-23 20:36:27,467 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2023-11-23 20:36:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:27,467 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-11-23 20:36:27,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 20:36:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-11-23 20:36:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 20:36:27,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:27,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:27,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:27,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:27,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:36:27,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2114283542, now seen corresponding path program 2 times [2023-11-23 20:36:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:36:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636432131] [2023-11-23 20:36:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:36:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 20:36:29,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:36:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636432131] [2023-11-23 20:36:29,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636432131] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064991988] [2023-11-23 20:36:29,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 20:36:29,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:29,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:29,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:36:29,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 20:36:29,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-23 20:36:29,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:36:29,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-23 20:36:29,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:29,337 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 20:36:29,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-23 20:36:29,563 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_6 Int) (v_z_6 Int)) (and (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_6 (* 256 v_y_6)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_6 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_6) (<= v_z_6 255))) is different from true [2023-11-23 20:36:29,664 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_z_5 Int) (v_y_6 Int) (v_y_5 Int) (v_z_6 Int)) (and (= (store (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* 256 v_y_5) v_z_5))))) (let ((.cse2 (let ((.cse4 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_5 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_1) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_6 (* 256 v_y_6))))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_1) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_6 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_5) (<= 0 v_z_6) (<= v_z_6 255) (<= v_z_5 255))) is different from true [2023-11-23 20:36:29,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:29,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:29,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 85 [2023-11-23 20:36:29,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 20:36:29,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:29,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:29,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:29,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2023-11-23 20:36:29,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 20:36:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-11-23 20:36:30,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:30,714 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#v~0#1.offset| Int) (v_y_8 Int) (v_z_9 Int) (v_ArrVal_159 (Array Int Int)) (v_y_9 Int) (v_ArrVal_158 (Array Int Int)) (v_z_8 Int)) (or (< v_z_9 0) (< v_z_8 0) (< 255 v_z_8) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset| (+ (* 256 v_y_9) v_z_9))))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (+ v_z_9 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (let ((.cse1 (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#s~0#1.base| .cse3) |c_ULTIMATE.start_main_~#i~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset| (+ v_z_8 (* 256 v_y_8))))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base| .cse1) |c_ULTIMATE.start_main_~#s~0#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#s~0#1.base| .cse3) |c_ULTIMATE.start_main_~#i~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~#v~0#1.base| .cse1) |c_ULTIMATE.start_main_~#s~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset| (+ v_z_8 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) |c_ULTIMATE.start_main_~#i~0#1.base| v_ArrVal_159))) (< (mod (select (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) 256) (+ (mod (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4294967296) 1))) (< 255 v_z_9))) is different from false [2023-11-23 20:36:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064991988] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:30,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [544040419] [2023-11-23 20:36:30,721 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-23 20:36:30,721 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:36:30,722 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:36:30,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:36:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2023-11-23 20:36:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946335425] [2023-11-23 20:36:30,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:30,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 20:36:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:36:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 20:36:30,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=289, Unknown=3, NotChecked=108, Total=462 [2023-11-23 20:36:30,726 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 20:36:32,844 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:36:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:33,463 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-23 20:36:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 20:36:33,464 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 20 [2023-11-23 20:36:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:33,465 INFO L225 Difference]: With dead ends: 30 [2023-11-23 20:36:33,465 INFO L226 Difference]: Without dead ends: 28 [2023-11-23 20:36:33,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=96, Invalid=464, Unknown=4, NotChecked=138, Total=702 [2023-11-23 20:36:33,467 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:33,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 2 Unknown, 52 Unchecked, 2.2s Time] [2023-11-23 20:36:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-23 20:36:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-11-23 20:36:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 20:36:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-11-23 20:36:33,477 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2023-11-23 20:36:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:33,477 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-11-23 20:36:33,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 20:36:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-11-23 20:36:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 20:36:33,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:33,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:33,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:33,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:33,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:36:33,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1118284412, now seen corresponding path program 2 times [2023-11-23 20:36:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:36:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232681335] [2023-11-23 20:36:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:36:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 20:36:34,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:36:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232681335] [2023-11-23 20:36:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232681335] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865184332] [2023-11-23 20:36:34,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 20:36:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:34,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:36:34,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 20:36:34,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-23 20:36:34,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:36:34,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-23 20:36:34,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:34,820 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 20:36:34,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-23 20:36:35,810 WARN L876 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_12_to_15_0_~v.offset Int) (v_z_11 Int) (v_y_11 Int)) (and (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset (+ v_z_11 (* v_y_11 256)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_11))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_11) (<= v_z_11 255))) is different from true [2023-11-23 20:36:35,910 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_203 Int) (func_to_recursive_line_12_to_15_0_~v.offset Int) (v_DerPreprocessor_6 (Array Int Int)) (v_func_to_recursive_line_12_to_15_0_~v.offset_28 Int) (v_z_10 Int) (v_y_10 Int) (v_z_11 Int) (v_y_11 Int)) (and (<= 0 v_z_10) (<= 0 v_z_11) (= |c_#memory_int| (store (let ((.cse4 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse4 func_to_recursive_line_12_to_15_0_~v.offset v_ArrVal_203)))) (let ((.cse2 (store (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse4 func_to_recursive_line_12_to_15_0_~v.offset (+ v_z_10 (* v_y_10 256)))) |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_10)))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_6) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) v_func_to_recursive_line_12_to_15_0_~v.offset_28 (+ v_z_11 (* v_y_11 256))))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_6) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_11 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (<= v_z_11 255) (<= v_z_10 255))) is different from true [2023-11-23 20:36:35,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:35,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:35,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 81 [2023-11-23 20:36:35,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 89 [2023-11-23 20:36:36,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-11-23 20:36:36,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-23 20:36:36,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:36,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:36,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 77 [2023-11-23 20:36:36,371 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 35 treesize of output 19 [2023-11-23 20:36:36,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-23 20:36:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-11-23 20:36:36,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:37,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865184332] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:37,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2092707085] [2023-11-23 20:36:37,950 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-23 20:36:37,950 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:36:37,951 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:36:37,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:36:37,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2023-11-23 20:36:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184169152] [2023-11-23 20:36:37,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:37,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-23 20:36:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:36:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-23 20:36:37,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=338, Unknown=6, NotChecked=78, Total=506 [2023-11-23 20:36:37,955 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 20:36:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:41,137 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-11-23 20:36:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 20:36:41,138 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 21 [2023-11-23 20:36:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:41,139 INFO L225 Difference]: With dead ends: 28 [2023-11-23 20:36:41,139 INFO L226 Difference]: Without dead ends: 23 [2023-11-23 20:36:41,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=109, Invalid=492, Unknown=7, NotChecked=94, Total=702 [2023-11-23 20:36:41,140 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:41,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 4 Unknown, 45 Unchecked, 0.5s Time] [2023-11-23 20:36:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-23 20:36:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-23 20:36:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 20:36:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-11-23 20:36:41,148 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2023-11-23 20:36:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:41,149 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-11-23 20:36:41,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 20:36:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-11-23 20:36:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 20:36:41,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:41,150 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:41,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-23 20:36:41,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 20:36:41,371 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:36:41,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash -442591433, now seen corresponding path program 3 times [2023-11-23 20:36:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:36:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340235105] [2023-11-23 20:36:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:36:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 20:36:43,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:36:43,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340235105] [2023-11-23 20:36:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340235105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85285451] [2023-11-23 20:36:43,262 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 20:36:43,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:43,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:43,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:36:43,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a6e0f71-4ade-4164-b18e-24d9d515145d/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 20:36:43,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 20:36:43,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:36:43,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-23 20:36:43,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:43,536 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 20:36:43,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-23 20:36:45,988 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_17 Int) (v_z_17 Int)) (and (<= 0 v_z_17) (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= v_z_17 255))) is different from true [2023-11-23 20:36:46,358 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|)) (.cse13 (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (let ((.cse0 (exists ((v_z_16 Int) (v_y_16 Int) (v_z_17 Int) (v_y_17 Int)) (and (= (store (let ((.cse19 (let ((.cse21 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse14 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256)))))) (let ((.cse22 (select .cse21 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse23 (+ (select .cse22 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_16))) (let ((.cse20 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse23)))) (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store (select .cse20 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store .cse21 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse22 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse23)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))))))) (let ((.cse17 (store (select .cse19 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse17) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse18 (select (store .cse19 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse17) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse18 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse18 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse13) |c_#memory_int|) (<= 0 v_z_17) (<= v_z_17 255) (<= v_z_16 255) (<= 0 v_z_16)))) (.cse1 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse2 (= |c_func_to_recursive_line_12_to_15_0_#in~v.offset| |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (or (and (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~i.base|) .cse0 (= |c_func_to_recursive_line_12_to_15_0_#in~i.offset| |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (and .cse0 .cse1 .cse2) (and (or (not .cse1) (not .cse2)) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_y_16 Int) (v_z_17 Int) (v_y_17 Int)) (let ((.cse16 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse14 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_11)))) (let ((.cse10 (store (select .cse16 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_12))) (let ((.cse15 (store .cse16 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse10))) (let ((.cse11 (store (select .cse15 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_13))) (let ((.cse12 (select (store .cse15 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse11) |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse4 (select .cse12 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (let ((.cse5 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse14 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| .cse4)))) (let ((.cse6 (select .cse5 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse7 (select .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 (* v_y_16 256))) (and (<= 0 v_z_17) (<= v_z_17 255) (<= .cse3 .cse4) (= v_DerPreprocessor_13 (+ (select (select (store .cse5 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ .cse4 .cse7 (* v_y_16 (- 256))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (= (+ v_DerPreprocessor_12 .cse3) (+ .cse4 .cse7)) (<= .cse4 (+ 255 .cse3)) (= (store (let ((.cse8 (store .cse12 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse8) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse9 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse10) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse11) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse8) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse9 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse9 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_17))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse13) |c_#memory_int|)))))))))))))))) is different from true [2023-11-23 20:36:50,311 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) (.cse20 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|)) (.cse18 (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (let ((.cse21 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse0 (exists ((v_z_16 Int) (v_z_15 Int) (v_y_16 Int) (v_z_17 Int) (v_y_17 Int) (v_ArrVal_284 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (= (store (let ((.cse106 (let ((.cse108 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store .cse31 |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (let ((.cse112 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284)))) (store .cse112 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse113 (select .cse112 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse113 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse113 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))) (let ((.cse109 (store .cse108 |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select .cse108 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256)))))) (let ((.cse110 (select .cse109 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse111 (+ v_z_16 (select .cse110 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse107 (store (select .cse108 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse111))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse107) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store (select (store .cse108 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse107) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store .cse109 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse110 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse111)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse104 (store (select .cse106 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse104) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse105 (select (store .cse106 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse104) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse105 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse105 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= v_z_16 255) (<= 0 v_z_15) (<= 0 v_z_16) (<= v_z_15 255)))) (.cse1 (= |c_func_to_recursive_line_12_to_15_0_#in~i.offset| |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 (= |c_func_to_recursive_line_12_to_15_0_#in~s.base| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) (.cse22 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) (.cse34 (= |c_func_to_recursive_line_12_to_15_0_#in~i.offset| |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse35 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse36 (= |c_func_to_recursive_line_12_to_15_0_#in~v.offset| |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (or (and (or (and .cse0 .cse1 .cse2) (exists ((v_z_17 Int)) (and (<= 0 v_z_17) (exists ((v_z_16 Int)) (and (<= v_z_16 255) (<= 0 v_z_16) (exists ((v_DerPreprocessor_17 Int) (v_y_16 Int) (v_y_17 Int) (v_DerPreprocessor_16 Int) (v_ArrVal_284 Int)) (let ((.cse19 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse21 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_16)))) (let ((.cse15 (store (select .cse19 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_17))) (let ((.cse5 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284))) (.cse17 (store .cse19 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse15))) (let ((.cse16 (select .cse17 |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse6 (select .cse5 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse4 (select .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 (select .cse16 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (<= .cse3 (+ 255 .cse4)) (<= .cse4 .cse3) (= v_DerPreprocessor_17 (+ (select (select (store .cse5 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse3)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (= |c_#memory_int| (store (let ((.cse9 (let ((.cse12 (store (select .cse17 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256))))) (let ((.cse13 (select (store .cse17 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse12) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse14 (+ v_z_16 (select .cse13 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse10 (store .cse16 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse14))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse10) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (let ((.cse11 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse15))) (store (select (store .cse11 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse10) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store (store .cse11 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse12) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse13 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse14)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse7 (store (select .cse9 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse7) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse8 (select (store .cse9 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse7) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse8 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse8 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18))))))))))) (<= v_z_17 255))) (and .cse22 (exists ((v_z_16 Int) (v_z_15 Int) (v_y_16 Int) (v_y_17 Int) (v_z_17 Int) (v_ArrVal_284 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (= (store (let ((.cse25 (let ((.cse27 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store .cse31 |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (let ((.cse32 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284)))) (store .cse32 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse33 (select .cse32 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse33 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse33 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))) (let ((.cse28 (store .cse27 |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select .cse27 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256)))))) (let ((.cse29 (select .cse28 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse30 (+ v_z_16 (select .cse29 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse26 (store (select .cse27 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse30))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse26) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store (select (store .cse27 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse26) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store .cse28 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse29 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse30)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse23 (store (select .cse25 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse23) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse24 (select (store .cse25 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse23) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse24 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse24 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= v_z_16 255) (<= 0 v_z_15) (<= 0 v_z_16) (<= v_z_15 255))) .cse34)) .cse35 .cse36) (and (or (exists ((v_DerPreprocessor_14 Int) (v_z_16 Int) (v_y_16 Int) (v_y_17 Int) (v_z_17 Int) (v_DerPreprocessor_15 Int) (v_ArrVal_284 Int)) (let ((.cse52 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse21 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_14)))) (let ((.cse45 (store (select .cse52 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_15))) (let ((.cse48 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284))) (.cse47 (store .cse52 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse45))) (let ((.cse46 (select .cse47 |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse49 (select .cse48 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse51 (select .cse49 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse50 (select .cse46 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (<= 0 v_z_17) (= (store (let ((.cse39 (let ((.cse42 (store (select .cse47 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256))))) (let ((.cse43 (select (store .cse47 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse42) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse44 (+ v_z_16 (select .cse43 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse40 (store .cse46 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse44))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse40) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (let ((.cse41 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse45))) (store (select (store .cse41 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse40) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store (store .cse41 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse42) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse43 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse44)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse37 (store (select .cse39 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse37) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse38 (select (store .cse39 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse37) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse38 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse38 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= v_z_17 255) (= v_DerPreprocessor_15 (+ (select (select (store .cse48 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse49 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse50)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (<= v_z_16 255) (<= .cse50 (+ 255 .cse51)) (<= 0 v_z_16) (<= .cse51 .cse50)))))))) (and (or (exists ((v_z_15 Int) (v_ArrVal_284 Int)) (and (exists ((v_z_16 Int) (v_y_16 Int) (v_z_17 Int) (v_y_17 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (= (store (let ((.cse55 (let ((.cse57 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store .cse31 |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (let ((.cse61 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284)))) (store .cse61 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse62 (select .cse61 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse62 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse62 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))) (let ((.cse58 (store .cse57 |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select .cse57 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256)))))) (let ((.cse59 (select .cse58 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse60 (+ v_z_16 (select .cse59 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse56 (store (select .cse57 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse60))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse56) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store (select (store .cse57 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse56) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store .cse58 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse59 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse60)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse53 (store (select .cse55 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse53) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse54 (select (store .cse55 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse53) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse54 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse54 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= v_z_16 255) (<= 0 v_z_16))) (<= 0 v_z_15) (<= v_z_15 255))) .cse0) .cse1 .cse2)) .cse22 .cse34) (and (or (not .cse35) (not .cse36)) (or (exists ((v_z_17 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_22 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_y_16 Int) (v_y_17 Int) (v_DerPreprocessor_20 Int) (v_DerPreprocessor_21 Int)) (let ((.cse85 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_20)))) (let ((.cse83 (store (select .cse85 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_21))) (let ((.cse84 (store .cse85 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse83))) (let ((.cse82 (store (select .cse84 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_22))) (let ((.cse78 (store .cse84 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse82))) (let ((.cse80 (select .cse78 |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse79 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse83) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse82)) (.cse81 (store .cse80 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_11))) (let ((.cse73 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse82)) (.cse69 (store (select (store .cse79 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse81) |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_12))) (let ((.cse70 (store (select (store (store .cse73 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse81) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse69) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_13))) (let ((.cse71 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse81) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse69) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse70) |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse63 (select .cse71 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (let ((.cse76 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (select .cse80 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)))) (.cse74 (store .cse80 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| .cse63))) (let ((.cse75 (select (store .cse79 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse74) |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse77 (select .cse76 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse65 (select .cse77 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse72 (select .cse75 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse64 (* v_y_16 256)) (.cse66 (select (select .cse78 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (<= .cse63 (+ 255 .cse64)) (<= .cse65 .cse66) (= (store (let ((.cse67 (store .cse71 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse67) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse68 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse69) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse70) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse67) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse68 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse68 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= .cse66 (+ 255 .cse65)) (= (+ v_DerPreprocessor_12 .cse64) (+ .cse72 .cse63)) (= (+ 1 (select (select (store (store .cse73 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse74) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse75 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ .cse72 .cse63 (* v_y_16 (- 256))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|)) v_DerPreprocessor_13) (<= .cse64 .cse63) (= v_DerPreprocessor_22 (+ (select (select (store .cse76 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse77 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse66)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))))))))))))) (exists ((v_z_17 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (exists ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_23 Int) (v_DerPreprocessor_12 Int) (v_z_15 Int) (v_y_16 Int) (v_y_17 Int)) (let ((.cse103 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_23)))) (let ((.cse102 (store (select .cse103 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_24))) (let ((.cse90 (select (store .cse103 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse102) |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse99 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse102)) (.cse100 (store .cse90 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_11))) (let ((.cse101 (store .cse99 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse100))) (let ((.cse93 (store (select .cse101 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_12))) (let ((.cse94 (store (select (store .cse101 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse93) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_13))) (let ((.cse95 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse100) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse93) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse94) |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse86 (select .cse95 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (let ((.cse96 (store .cse99 |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse90 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| .cse86)))) (let ((.cse97 (select .cse96 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse87 (* v_y_16 256)) (.cse98 (select .cse97 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (<= .cse86 (+ 255 .cse87)) (<= .cse87 .cse86) (<= 0 v_z_15) (= v_DerPreprocessor_24 (+ (select (select (let ((.cse88 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (select .cse90 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (store .cse88 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse89 (select .cse88 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse89 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse89 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (= (store (let ((.cse91 (store .cse95 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse91) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse92 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse93) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse94) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse91) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse92 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse92 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (= v_DerPreprocessor_13 (+ (select (select (store .cse96 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse97 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ .cse86 (* v_y_16 (- 256)) .cse98))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (<= v_z_15 255) (= (+ v_DerPreprocessor_12 .cse87) (+ .cse86 .cse98))))))))))))))))))))))) is different from false [2023-11-23 20:36:50,332 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) (.cse20 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|)) (.cse18 (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (let ((.cse21 (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse0 (exists ((v_z_16 Int) (v_z_15 Int) (v_y_16 Int) (v_z_17 Int) (v_y_17 Int) (v_ArrVal_284 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (= (store (let ((.cse106 (let ((.cse108 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store .cse31 |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (let ((.cse112 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284)))) (store .cse112 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse113 (select .cse112 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse113 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse113 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))) (let ((.cse109 (store .cse108 |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select .cse108 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256)))))) (let ((.cse110 (select .cse109 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse111 (+ v_z_16 (select .cse110 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse107 (store (select .cse108 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse111))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse107) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store (select (store .cse108 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse107) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store .cse109 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse110 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse111)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse104 (store (select .cse106 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse104) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse105 (select (store .cse106 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse104) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse105 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse105 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= v_z_16 255) (<= 0 v_z_15) (<= 0 v_z_16) (<= v_z_15 255)))) (.cse1 (= |c_func_to_recursive_line_12_to_15_0_#in~i.offset| |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 (= |c_func_to_recursive_line_12_to_15_0_#in~s.base| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) (.cse22 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) (.cse34 (= |c_func_to_recursive_line_12_to_15_0_#in~i.offset| |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse35 (= |c_func_to_recursive_line_12_to_15_0_#in~v.base| |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse36 (= |c_func_to_recursive_line_12_to_15_0_#in~v.offset| |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (or (and (or (and .cse0 .cse1 .cse2) (exists ((v_z_17 Int)) (and (<= 0 v_z_17) (exists ((v_z_16 Int)) (and (<= v_z_16 255) (<= 0 v_z_16) (exists ((v_DerPreprocessor_17 Int) (v_y_16 Int) (v_y_17 Int) (v_DerPreprocessor_16 Int) (v_ArrVal_284 Int)) (let ((.cse19 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse21 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_16)))) (let ((.cse15 (store (select .cse19 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_17))) (let ((.cse5 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284))) (.cse17 (store .cse19 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse15))) (let ((.cse16 (select .cse17 |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse6 (select .cse5 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse4 (select .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 (select .cse16 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (<= .cse3 (+ 255 .cse4)) (<= .cse4 .cse3) (= v_DerPreprocessor_17 (+ (select (select (store .cse5 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse3)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (= |c_#memory_int| (store (let ((.cse9 (let ((.cse12 (store (select .cse17 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256))))) (let ((.cse13 (select (store .cse17 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse12) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse14 (+ v_z_16 (select .cse13 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse10 (store .cse16 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse14))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse10) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (let ((.cse11 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse15))) (store (select (store .cse11 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse10) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store (store .cse11 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse12) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse13 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse14)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse7 (store (select .cse9 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse7) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse8 (select (store .cse9 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse7) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse8 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse8 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18))))))))))) (<= v_z_17 255))) (and .cse22 (exists ((v_z_16 Int) (v_z_15 Int) (v_y_16 Int) (v_y_17 Int) (v_z_17 Int) (v_ArrVal_284 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (= (store (let ((.cse25 (let ((.cse27 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store .cse31 |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (let ((.cse32 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284)))) (store .cse32 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse33 (select .cse32 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse33 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse33 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))) (let ((.cse28 (store .cse27 |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select .cse27 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256)))))) (let ((.cse29 (select .cse28 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse30 (+ v_z_16 (select .cse29 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse26 (store (select .cse27 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse30))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse26) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store (select (store .cse27 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse26) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store .cse28 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse29 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse30)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse23 (store (select .cse25 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse23) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse24 (select (store .cse25 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse23) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse24 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse24 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= v_z_16 255) (<= 0 v_z_15) (<= 0 v_z_16) (<= v_z_15 255))) .cse34)) .cse35 .cse36) (and (or (exists ((v_DerPreprocessor_14 Int) (v_z_16 Int) (v_y_16 Int) (v_y_17 Int) (v_z_17 Int) (v_DerPreprocessor_15 Int) (v_ArrVal_284 Int)) (let ((.cse52 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse21 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_14)))) (let ((.cse45 (store (select .cse52 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_15))) (let ((.cse48 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284))) (.cse47 (store .cse52 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse45))) (let ((.cse46 (select .cse47 |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse49 (select .cse48 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse51 (select .cse49 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse50 (select .cse46 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (<= 0 v_z_17) (= (store (let ((.cse39 (let ((.cse42 (store (select .cse47 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256))))) (let ((.cse43 (select (store .cse47 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse42) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse44 (+ v_z_16 (select .cse43 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse40 (store .cse46 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse44))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse40) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (let ((.cse41 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse45))) (store (select (store .cse41 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse40) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store (store .cse41 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse42) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse43 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse44)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse37 (store (select .cse39 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse37) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse38 (select (store .cse39 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse37) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse38 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse38 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= v_z_17 255) (= v_DerPreprocessor_15 (+ (select (select (store .cse48 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse49 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse50)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (<= v_z_16 255) (<= .cse50 (+ 255 .cse51)) (<= 0 v_z_16) (<= .cse51 .cse50)))))))) (and (or (exists ((v_z_15 Int) (v_ArrVal_284 Int)) (and (exists ((v_z_16 Int) (v_y_16 Int) (v_z_17 Int) (v_y_17 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (= (store (let ((.cse55 (let ((.cse57 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store .cse31 |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (let ((.cse61 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_284)))) (store .cse61 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse62 (select .cse61 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse62 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse62 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1))))) (let ((.cse58 (store .cse57 |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select .cse57 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256)))))) (let ((.cse59 (select .cse58 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse60 (+ v_z_16 (select .cse59 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))) (let ((.cse56 (store (select .cse57 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse60))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse56) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (store (select (store .cse57 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse56) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| (+ (select (select (store .cse58 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse59 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse60)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))) (let ((.cse53 (store (select .cse55 |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse53) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse54 (select (store .cse55 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse53) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse54 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse54 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= v_z_16 255) (<= 0 v_z_16))) (<= 0 v_z_15) (<= v_z_15 255))) .cse0) .cse1 .cse2)) .cse22 .cse34) (and (or (not .cse35) (not .cse36)) (or (exists ((v_z_17 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_22 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_y_16 Int) (v_y_17 Int) (v_DerPreprocessor_20 Int) (v_DerPreprocessor_21 Int)) (let ((.cse85 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_20)))) (let ((.cse83 (store (select .cse85 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_21))) (let ((.cse84 (store .cse85 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse83))) (let ((.cse82 (store (select .cse84 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_22))) (let ((.cse78 (store .cse84 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse82))) (let ((.cse80 (select .cse78 |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse79 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse83) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse82)) (.cse81 (store .cse80 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_11))) (let ((.cse73 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse82)) (.cse69 (store (select (store .cse79 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse81) |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_12))) (let ((.cse70 (store (select (store (store .cse73 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse81) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse69) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_13))) (let ((.cse71 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse81) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse69) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse70) |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse63 (select .cse71 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (let ((.cse76 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (select .cse80 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)))) (.cse74 (store .cse80 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| .cse63))) (let ((.cse75 (select (store .cse79 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse74) |c_func_to_recursive_line_12_to_15_0_#in~s.base|)) (.cse77 (select .cse76 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse65 (select .cse77 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse72 (select .cse75 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse64 (* v_y_16 256)) (.cse66 (select (select .cse78 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (<= .cse63 (+ 255 .cse64)) (<= .cse65 .cse66) (= (store (let ((.cse67 (store .cse71 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse67) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse68 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse69) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse70) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse67) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse68 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse68 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (<= .cse66 (+ 255 .cse65)) (= (+ v_DerPreprocessor_12 .cse64) (+ .cse72 .cse63)) (= (+ 1 (select (select (store (store .cse73 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse74) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse75 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ .cse72 .cse63 (* v_y_16 (- 256))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|)) v_DerPreprocessor_13) (<= .cse64 .cse63) (= v_DerPreprocessor_22 (+ (select (select (store .cse76 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse77 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| .cse66)) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)))))))))))))))))))) (exists ((v_z_17 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (exists ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_23 Int) (v_DerPreprocessor_12 Int) (v_z_15 Int) (v_y_16 Int) (v_y_17 Int)) (let ((.cse103 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_23)))) (let ((.cse102 (store (select .cse103 |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_24))) (let ((.cse90 (select (store .cse103 |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse102) |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse99 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse102)) (.cse100 (store .cse90 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_DerPreprocessor_11))) (let ((.cse101 (store .cse99 |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse100))) (let ((.cse93 (store (select .cse101 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| v_DerPreprocessor_12))) (let ((.cse94 (store (select (store .cse101 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse93) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset| v_DerPreprocessor_13))) (let ((.cse95 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse100) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse93) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse94) |c_func_to_recursive_line_12_to_15_0_#in~v.base|))) (let ((.cse86 (select .cse95 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (let ((.cse96 (store .cse99 |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse90 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| .cse86)))) (let ((.cse97 (select .cse96 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse87 (* v_y_16 256)) (.cse98 (select .cse97 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (<= .cse86 (+ 255 .cse87)) (<= .cse87 .cse86) (<= 0 v_z_15) (= v_DerPreprocessor_24 (+ (select (select (let ((.cse88 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store .cse20 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (select .cse90 |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (store .cse88 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse89 (select .cse88 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse89 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select .cse89 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (= (store (let ((.cse91 (store .cse95 |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse91) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse92 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse93) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse94) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse91) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse92 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse92 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| .cse18) |c_#memory_int|) (= v_DerPreprocessor_13 (+ (select (select (store .cse96 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse97 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ .cse86 (* v_y_16 (- 256)) .cse98))) |c_func_to_recursive_line_12_to_15_0_#in~i.base|) |c_func_to_recursive_line_12_to_15_0_#in~i.offset|) 1)) (<= v_z_15 255) (= (+ v_DerPreprocessor_12 .cse87) (+ .cse86 .cse98))))))))))))))))))))))) is different from true [2023-11-23 20:36:51,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:51,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:51,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:51,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 348 [2023-11-23 20:36:51,744 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:51,750 INFO L224 Elim1Store]: Index analysis took 102 ms [2023-11-23 20:36:51,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 171 [2023-11-23 20:36:51,852 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 39 treesize of output 19 [2023-11-23 20:36:53,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:53,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:53,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:53,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:53,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:53,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:53,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 104 [2023-11-23 20:36:53,158 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 21 treesize of output 12 [2023-11-23 20:36:53,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-23 20:36:53,483 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 18 treesize of output 3 [2023-11-23 20:36:53,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:53,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:53,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 830 treesize of output 722 [2023-11-23 20:36:53,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 171 [2023-11-23 20:36:53,884 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 149 [2023-11-23 20:36:53,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2023-11-23 20:36:53,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 20:36:54,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 93 [2023-11-23 20:36:54,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-23 20:36:54,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 20:36:54,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2023-11-23 20:36:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2023-11-23 20:36:54,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85285451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [973039252] [2023-11-23 20:36:57,105 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-23 20:36:57,105 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:36:57,105 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:36:57,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:36:57,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2023-11-23 20:36:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947180883] [2023-11-23 20:36:57,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:57,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 20:36:57,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:36:57,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 20:36:57,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=509, Unknown=6, NotChecked=144, Total=756 [2023-11-23 20:36:57,110 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-23 20:37:10,236 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]