./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.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_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/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_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/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_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:28:22,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:28:22,721 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 21:28:22,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:28:22,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:28:22,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:28:22,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:28:22,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:28:22,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:28:22,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:28:22,779 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:28:22,779 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:28:22,779 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:28:22,781 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:28:22,781 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:28:22,782 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:28:22,782 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:28:22,783 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:28:22,783 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:28:22,784 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:28:22,785 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:28:22,786 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:28:22,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:28:22,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:28:22,788 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:28:22,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:28:22,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:28:22,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:28:22,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:28:22,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:28:22,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:28:22,791 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:28:22,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:28:22,792 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:28:22,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:28:22,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:28:22,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:28:22,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:28:22,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:28:22,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:28:22,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:28:22,794 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:28:22,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:28:22,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:28:22,795 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:28:22,795 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:28:22,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:28:22,796 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_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/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_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2023-11-23 21:28:23,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:28:23,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:28:23,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:28:23,160 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:28:23,160 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:28:23,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-23 21:28:26,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:28:26,536 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:28:26,536 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-23 21:28:26,545 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/data/6ae82c89b/c874f7c6618c4cdda4aef81a5dc67c43/FLAG046c0daea [2023-11-23 21:28:26,560 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/data/6ae82c89b/c874f7c6618c4cdda4aef81a5dc67c43 [2023-11-23 21:28:26,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:28:26,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:28:26,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:28:26,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:28:26,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:28:26,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce08a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26, skipping insertion in model container [2023-11-23 21:28:26,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,597 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:28:26,778 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_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2023-11-23 21:28:26,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:28:26,801 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:28:26,819 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_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2023-11-23 21:28:26,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:28:26,836 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:28:26,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26 WrapperNode [2023-11-23 21:28:26,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:28:26,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:28:26,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:28:26,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:28:26,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,874 INFO L138 Inliner]: procedures = 14, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-11-23 21:28:26,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:28:26,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:28:26,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:28:26,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:28:26,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:28:26,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:28:26,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:28:26,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:28:26,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (1/1) ... [2023-11-23 21:28:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:28:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:28:26,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:28:26,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:28:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:28:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:28:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:28:26,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:28:26,970 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-23 21:28:26,970 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-23 21:28:26,970 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-23 21:28:26,970 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-23 21:28:26,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:28:26,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:28:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:28:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-23 21:28:26,971 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-23 21:28:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:28:27,049 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:28:27,051 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:28:27,243 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:28:27,382 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:28:27,388 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:28:27,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:28:27 BoogieIcfgContainer [2023-11-23 21:28:27,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:28:27,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:28:27,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:28:27,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:28:27,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:28:26" (1/3) ... [2023-11-23 21:28:27,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0e60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:28:27, skipping insertion in model container [2023-11-23 21:28:27,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:26" (2/3) ... [2023-11-23 21:28:27,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0e60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:28:27, skipping insertion in model container [2023-11-23 21:28:27,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:28:27" (3/3) ... [2023-11-23 21:28:27,405 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-23 21:28:27,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:28:27,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:28:27,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:28:27,493 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;@128f9279, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:28:27,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:28:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 21:28:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:28:27,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:28:27,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:28:27,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:28:27,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:28:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1151432377, now seen corresponding path program 1 times [2023-11-23 21:28:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:28:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089451604] [2023-11-23 21:28:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:28:27,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:28:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:28,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 21:28:28,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:28:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089451604] [2023-11-23 21:28:28,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089451604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:28:28,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:28:28,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:28:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903967634] [2023-11-23 21:28:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:28:28,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:28:28,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:28:28,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:28:28,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:28:28,337 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 21:28:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:28:28,522 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-11-23 21:28:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:28:28,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2023-11-23 21:28:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:28:28,534 INFO L225 Difference]: With dead ends: 39 [2023-11-23 21:28:28,534 INFO L226 Difference]: Without dead ends: 31 [2023-11-23 21:28:28,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:28:28,540 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:28:28,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:28:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-23 21:28:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-11-23 21:28:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-23 21:28:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-11-23 21:28:28,588 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2023-11-23 21:28:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:28:28,589 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-11-23 21:28:28,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 21:28:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-11-23 21:28:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:28:28,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:28:28,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:28:28,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:28:28,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:28:28,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:28:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash -808235070, now seen corresponding path program 1 times [2023-11-23 21:28:28,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:28:28,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184732144] [2023-11-23 21:28:28,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:28:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:28:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 21:28:28,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:28:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184732144] [2023-11-23 21:28:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184732144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:28:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:28:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:28:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35189084] [2023-11-23 21:28:28,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:28:28,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:28:28,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:28:28,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:28:28,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:28:28,978 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:28:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:28:29,110 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2023-11-23 21:28:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:28:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2023-11-23 21:28:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:28:29,114 INFO L225 Difference]: With dead ends: 56 [2023-11-23 21:28:29,114 INFO L226 Difference]: Without dead ends: 31 [2023-11-23 21:28:29,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:28:29,122 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:28:29,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:28:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-23 21:28:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-23 21:28:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-23 21:28:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-23 21:28:29,144 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2023-11-23 21:28:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:28:29,145 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-23 21:28:29,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:28:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-23 21:28:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 21:28:29,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:28:29,149 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:28:29,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:28:29,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:28:29,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:28:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1443235882, now seen corresponding path program 1 times [2023-11-23 21:28:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:28:29,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153727384] [2023-11-23 21:28:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:28:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:28:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 21:28:29,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:28:29,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153727384] [2023-11-23 21:28:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153727384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:28:29,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:28:29,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:28:29,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339308752] [2023-11-23 21:28:29,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:28:29,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:28:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:28:29,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:28:29,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:28:29,424 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 21:28:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:28:29,517 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2023-11-23 21:28:29,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:28:29,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2023-11-23 21:28:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:28:29,521 INFO L225 Difference]: With dead ends: 58 [2023-11-23 21:28:29,527 INFO L226 Difference]: Without dead ends: 31 [2023-11-23 21:28:29,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:28:29,534 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:28:29,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:28:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-23 21:28:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-23 21:28:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-23 21:28:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-23 21:28:29,542 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 31 [2023-11-23 21:28:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:28:29,542 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-23 21:28:29,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 21:28:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-23 21:28:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 21:28:29,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:28:29,545 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:28:29,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:28:29,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:28:29,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:28:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1079350702, now seen corresponding path program 1 times [2023-11-23 21:28:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:28:29,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426473539] [2023-11-23 21:28:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:28:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:28:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:28:30,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:28:30,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426473539] [2023-11-23 21:28:30,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426473539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:28:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756449344] [2023-11-23 21:28:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:28:30,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:28:30,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:28:30,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:28:30,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:28:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:30,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 21:28:30,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:28:30,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 21:28:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:28:30,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:28:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 21:28:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756449344] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:28:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [481976439] [2023-11-23 21:28:31,219 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-23 21:28:31,220 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:28:31,224 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 21:28:31,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:28:31,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-11-23 21:28:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98790501] [2023-11-23 21:28:31,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:28:31,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-23 21:28:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:28:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-23 21:28:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-11-23 21:28:31,236 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-23 21:28:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:28:31,560 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2023-11-23 21:28:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:28:31,562 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) Word has length 36 [2023-11-23 21:28:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:28:31,566 INFO L225 Difference]: With dead ends: 64 [2023-11-23 21:28:31,567 INFO L226 Difference]: Without dead ends: 35 [2023-11-23 21:28:31,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2023-11-23 21:28:31,573 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:28:31,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:28:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-23 21:28:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-23 21:28:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-23 21:28:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-23 21:28:31,592 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 36 [2023-11-23 21:28:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:28:31,593 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-23 21:28:31,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-23 21:28:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-23 21:28:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 21:28:31,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:28:31,598 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:28:31,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 21:28:31,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:28:31,820 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:28:31,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:28:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1508132862, now seen corresponding path program 2 times [2023-11-23 21:28:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:28:31,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630817432] [2023-11-23 21:28:31,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:28:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:28:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 21:28:32,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:28:32,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630817432] [2023-11-23 21:28:32,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630817432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:28:32,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94723254] [2023-11-23 21:28:32,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 21:28:32,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:28:32,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:28:32,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:28:32,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:28:32,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-23 21:28:32,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:28:32,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-23 21:28:32,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:28:32,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 21:28:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 21:28:33,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:28:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 21:28:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94723254] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:28:35,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1759310914] [2023-11-23 21:28:35,217 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-23 21:28:35,217 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:28:35,218 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 21:28:35,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:28:35,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 18] total 36 [2023-11-23 21:28:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054490522] [2023-11-23 21:28:35,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:28:35,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-23 21:28:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:28:35,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-23 21:28:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2023-11-23 21:28:35,223 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 36 states, 26 states have (on average 2.0) internal successors, (52), 31 states have internal predecessors, (52), 13 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2023-11-23 21:28:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:28:35,776 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2023-11-23 21:28:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 21:28:35,777 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 2.0) internal successors, (52), 31 states have internal predecessors, (52), 13 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) Word has length 46 [2023-11-23 21:28:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:28:35,778 INFO L225 Difference]: With dead ends: 72 [2023-11-23 21:28:35,778 INFO L226 Difference]: Without dead ends: 39 [2023-11-23 21:28:35,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2023-11-23 21:28:35,781 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:28:35,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 152 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:28:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-23 21:28:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-23 21:28:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-23 21:28:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-11-23 21:28:35,796 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 46 [2023-11-23 21:28:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:28:35,797 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-11-23 21:28:35,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 2.0) internal successors, (52), 31 states have internal predecessors, (52), 13 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2023-11-23 21:28:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-11-23 21:28:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-23 21:28:35,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:28:35,805 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:28:35,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 21:28:36,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:28:36,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:28:36,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:28:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash 466624598, now seen corresponding path program 3 times [2023-11-23 21:28:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:28:36,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352365109] [2023-11-23 21:28:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:28:36,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:28:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-23 21:28:37,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:28:37,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352365109] [2023-11-23 21:28:37,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352365109] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:28:37,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421653542] [2023-11-23 21:28:37,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 21:28:37,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:28:37,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:28:37,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:28:37,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:28:37,323 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 21:28:37,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:28:37,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-23 21:28:37,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:28:37,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 21:28:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-23 21:28:37,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:28:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 21:28:41,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421653542] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:28:41,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130286208] [2023-11-23 21:28:41,171 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-23 21:28:41,171 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:28:41,172 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 21:28:41,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:28:41,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 26] total 44 [2023-11-23 21:28:41,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436622010] [2023-11-23 21:28:41,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:28:41,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-23 21:28:41,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:28:41,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-23 21:28:41,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2023-11-23 21:28:41,177 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 44 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 37 states have internal predecessors, (57), 13 states have call successors, (17), 9 states have call predecessors, (17), 15 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2023-11-23 21:28:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:28:41,833 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2023-11-23 21:28:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 21:28:41,834 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 37 states have internal predecessors, (57), 13 states have call successors, (17), 9 states have call predecessors, (17), 15 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) Word has length 56 [2023-11-23 21:28:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:28:41,835 INFO L225 Difference]: With dead ends: 78 [2023-11-23 21:28:41,835 INFO L226 Difference]: Without dead ends: 41 [2023-11-23 21:28:41,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=522, Invalid=2340, Unknown=0, NotChecked=0, Total=2862 [2023-11-23 21:28:41,839 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:28:41,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 238 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:28:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-23 21:28:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-23 21:28:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 11 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-23 21:28:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-23 21:28:41,846 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 56 [2023-11-23 21:28:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:28:41,847 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-23 21:28:41,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 37 states have internal predecessors, (57), 13 states have call successors, (17), 9 states have call predecessors, (17), 15 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2023-11-23 21:28:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-23 21:28:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-23 21:28:41,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:28:41,849 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:28:41,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 21:28:42,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:28:42,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:28:42,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:28:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash -340935598, now seen corresponding path program 4 times [2023-11-23 21:28:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:28:42,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628642592] [2023-11-23 21:28:42,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:28:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:28:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-23 21:28:47,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:28:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628642592] [2023-11-23 21:28:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628642592] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:28:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343378741] [2023-11-23 21:28:47,111 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-23 21:28:47,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:28:47,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:28:47,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:28:47,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 21:28:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:28:47,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-23 21:28:47,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:28:47,320 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 18 treesize of output 16 [2023-11-23 21:28:47,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 21:28:49,706 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-23 21:28:51,708 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-23 21:28:53,756 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_27| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_27| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_27| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_old(#memory_int)_AFTER_CALL_27|))))) is different from false [2023-11-23 21:28:55,757 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_27| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_27| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_27| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_old(#memory_int)_AFTER_CALL_27|))))) is different from true [2023-11-23 21:28:57,904 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_31| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_31| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_31| .cse0))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-23 21:28:57,907 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_31| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_31| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_31| .cse0))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-23 21:28:59,946 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_31| .cse0))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse0 (select |v_#memory_int_474| .cse0)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse1 (select |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|)))) is different from false [2023-11-23 21:28:59,950 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_31| .cse0))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse0 (select |v_#memory_int_474| .cse0)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse1 (select |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|)))) is different from true [2023-11-23 21:29:02,024 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from false [2023-11-23 21:29:02,040 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from true [2023-11-23 21:29:02,110 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 13 treesize of output 14 [2023-11-23 21:29:02,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:29:02,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-23 21:29:02,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:29:02,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-23 21:29:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 69 trivial. 13 not checked. [2023-11-23 21:29:02,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:29:03,641 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#b~0#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_339 Int) (v_func_to_recursive_line_22_to_23_0_~c.base_80 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset| v_ArrVal_339)) v_func_to_recursive_line_22_to_23_0_~c.base_80 v_ArrVal_340) |c_ULTIMATE.start_main_~#b~0#1.base|))) (let ((.cse1 (select .cse0 |ULTIMATE.start_main_~#b~0#1.offset|))) (or (< (select (select (store (store |c_#memory_int| v_func_to_recursive_line_22_to_23_0_~c.base_80 v_ArrVal_340) |c_ULTIMATE.start_main_~#b~0#1.base| (store .cse0 |ULTIMATE.start_main_~#b~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 5) (< .cse1 5) (< 0 v_ArrVal_339))))) is different from false [2023-11-23 21:29:03,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343378741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:29:03,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [523475049] [2023-11-23 21:29:03,647 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-23 21:29:03,647 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:29:03,648 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 21:29:03,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 21:29:03,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 33 [2023-11-23 21:29:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814726568] [2023-11-23 21:29:03,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 21:29:03,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-23 21:29:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:03,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-23 21:29:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=669, Unknown=11, NotChecked=342, Total=1122 [2023-11-23 21:29:03,652 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 33 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 28 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 21:29:05,778 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 21:29:06,401 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_27| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_27| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_27| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_old(#memory_int)_AFTER_CALL_27|))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from false [2023-11-23 21:29:06,407 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_27| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_27| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_27| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_old(#memory_int)_AFTER_CALL_27|))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from true [2023-11-23 21:29:08,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) .cse0 (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_31| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_31| .cse1 (select |c_#memory_int| .cse1))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_31| .cse1))))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base) (and .cse0 (= (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base)))))) is different from false [2023-11-23 21:29:10,521 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) .cse0 (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_31| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_31| .cse1 (select |c_#memory_int| .cse1))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_31| .cse1))))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base) (and .cse0 (= (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base)))))) is different from true [2023-11-23 21:29:12,525 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|)) (.cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base))) (and .cse0 .cse1 (or (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse5 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse5 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse5 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|))) (or (< (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 6) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (and (not (= (select (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 0)) .cse0 .cse1)))) is different from false [2023-11-23 21:29:12,529 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|)) (.cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base))) (and .cse0 .cse1 (or (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse5 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse5 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse5 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|))) (or (< (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 6) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (and (not (= (select (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 0)) .cse0 .cse1)))) is different from true [2023-11-23 21:29:14,535 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= (select (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 0)) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from false [2023-11-23 21:29:14,540 WARN L876 $PredicateComparison]: unable to prove that (and (or (not (= (select (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 0)) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from true [2023-11-23 21:29:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:15,231 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2023-11-23 21:29:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 21:29:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 28 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) Word has length 61 [2023-11-23 21:29:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:15,233 INFO L225 Difference]: With dead ends: 55 [2023-11-23 21:29:15,233 INFO L226 Difference]: Without dead ends: 43 [2023-11-23 21:29:15,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=182, Invalid=1321, Unknown=19, NotChecked=830, Total=2352 [2023-11-23 21:29:15,235 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:15,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 178 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 526 Invalid, 2 Unknown, 461 Unchecked, 2.9s Time] [2023-11-23 21:29:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-23 21:29:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-23 21:29:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 21:29:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-11-23 21:29:15,244 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 61 [2023-11-23 21:29:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:15,245 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-11-23 21:29:15,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 28 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 21:29:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-11-23 21:29:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 21:29:15,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:15,247 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:15,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 21:29:15,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36f1ffb9-72ef-45e6-931f-0e99a25c1ac7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:29:15,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:29:15,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash 816427588, now seen corresponding path program 5 times [2023-11-23 21:29:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:15,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824950231] [2023-11-23 21:29:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat