./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/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_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/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_ef0f18f1-e156-4b0f-88dd-107916ad6a27/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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:21:54,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:21:54,583 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 21:21:54,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:21:54,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:21:54,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:21:54,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:21:54,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:21:54,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:21:54,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:21:54,654 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:21:54,654 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:21:54,655 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:21:54,657 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:21:54,658 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:21:54,659 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:21:54,660 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:21:54,664 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:21:54,665 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:21:54,666 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:21:54,666 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:21:54,667 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:21:54,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:21:54,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:21:54,669 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:21:54,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:21:54,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:21:54,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:21:54,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:21:54,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:21:54,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:21:54,673 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:21:54,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:21:54,674 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:21:54,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:21:54,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:21:54,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:21:54,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:21:54,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:21:54,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:21:54,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:21:54,677 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:21:54,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:21:54,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:21:54,678 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:21:54,678 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:21:54,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:21:54,679 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_ef0f18f1-e156-4b0f-88dd-107916ad6a27/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_ef0f18f1-e156-4b0f-88dd-107916ad6a27/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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2023-11-23 21:21:55,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:21:55,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:21:55,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:21:55,083 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:21:55,084 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:21:55,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-23 21:21:58,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:21:58,712 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:21:58,713 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-23 21:21:58,723 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/data/4c8284ff7/7e59afd041ff4df2bad2296460207519/FLAG35636d3b4 [2023-11-23 21:21:58,741 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/data/4c8284ff7/7e59afd041ff4df2bad2296460207519 [2023-11-23 21:21:58,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:21:58,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:21:58,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:21:58,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:21:58,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:21:58,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:21:58" (1/1) ... [2023-11-23 21:21:58,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63323fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:58, skipping insertion in model container [2023-11-23 21:21:58,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:21:58" (1/1) ... [2023-11-23 21:21:58,800 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:21:59,038 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_ef0f18f1-e156-4b0f-88dd-107916ad6a27/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c[2333,2346] [2023-11-23 21:21:59,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:21:59,057 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:21:59,085 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_ef0f18f1-e156-4b0f-88dd-107916ad6a27/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c[2333,2346] [2023-11-23 21:21:59,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:21:59,104 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:21:59,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59 WrapperNode [2023-11-23 21:21:59,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:21:59,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:21:59,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:21:59,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:21:59,116 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:21:59" (1/1) ... [2023-11-23 21:21:59,125 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:21:59" (1/1) ... [2023-11-23 21:21:59,145 INFO L138 Inliner]: procedures = 15, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2023-11-23 21:21:59,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:21:59,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:21:59,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:21:59,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:21:59,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:21:59,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:21:59,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:21:59,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:21:59,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (1/1) ... [2023-11-23 21:21:59,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:21:59,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:21:59,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/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:21:59,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/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:21:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:21:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:21:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:21:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:21:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-23 21:21:59,298 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-23 21:21:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-23 21:21:59,298 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-23 21:21:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-23 21:21:59,299 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-23 21:21:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2023-11-23 21:21:59,299 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2023-11-23 21:21:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:21:59,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:21:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:21:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:21:59,381 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:21:59,383 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:21:59,671 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:21:59,755 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:21:59,756 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:21:59,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:21:59 BoogieIcfgContainer [2023-11-23 21:21:59,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:21:59,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:21:59,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:21:59,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:21:59,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:21:58" (1/3) ... [2023-11-23 21:21:59,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4232e84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:21:59, skipping insertion in model container [2023-11-23 21:21:59,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:59" (2/3) ... [2023-11-23 21:21:59,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4232e84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:21:59, skipping insertion in model container [2023-11-23 21:21:59,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:21:59" (3/3) ... [2023-11-23 21:21:59,768 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2023-11-23 21:21:59,789 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:21:59,789 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:21:59,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:21:59,845 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;@5c84e63d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:21:59,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:21:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.3) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-23 21:21:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:21:59,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:21:59,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:21:59,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:21:59,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:21:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash 195696262, now seen corresponding path program 1 times [2023-11-23 21:21:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:21:59,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945852609] [2023-11-23 21:21:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:21:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:22:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:00,516 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:22:00,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:22:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945852609] [2023-11-23 21:22:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945852609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:22:00,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:22:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:22:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442074995] [2023-11-23 21:22:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:22:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:22:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:22:00,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:22:00,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:22:00,561 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.3) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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:22:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:22:00,747 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2023-11-23 21:22:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:22:00,751 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:22:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:22:00,761 INFO L225 Difference]: With dead ends: 48 [2023-11-23 21:22:00,761 INFO L226 Difference]: Without dead ends: 40 [2023-11-23 21:22:00,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:22:00,772 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:22:00,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:22:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-23 21:22:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2023-11-23 21:22:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-23 21:22:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-11-23 21:22:00,832 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 9 [2023-11-23 21:22:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:22:00,833 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-11-23 21:22:00,834 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:22:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-11-23 21:22:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:22:00,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:22:00,840 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:22:00,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:22:00,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:22:00,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:22:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1479798581, now seen corresponding path program 1 times [2023-11-23 21:22:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:22:00,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754538558] [2023-11-23 21:22:00,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:22:00,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:22:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:01,105 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:22:01,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:22:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754538558] [2023-11-23 21:22:01,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754538558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:22:01,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:22:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:22:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237633872] [2023-11-23 21:22:01,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:22:01,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:22:01,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:22:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:22:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:22:01,109 INFO L87 Difference]: Start difference. First operand 34 states and 41 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:22:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:22:01,276 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2023-11-23 21:22:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:22:01,277 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:22:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:22:01,281 INFO L225 Difference]: With dead ends: 72 [2023-11-23 21:22:01,281 INFO L226 Difference]: Without dead ends: 40 [2023-11-23 21:22:01,288 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:22:01,291 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:22:01,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 69 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:22:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-23 21:22:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-11-23 21:22:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-23 21:22:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-11-23 21:22:01,301 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 20 [2023-11-23 21:22:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:22:01,302 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-23 21:22:01,302 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:22:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-11-23 21:22:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 21:22:01,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:22:01,307 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:22:01,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:22:01,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:22:01,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:22:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1854302703, now seen corresponding path program 1 times [2023-11-23 21:22:01,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:22:01,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459122274] [2023-11-23 21:22:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:22:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:22:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:01,615 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:22:01,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:22:01,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459122274] [2023-11-23 21:22:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459122274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:22:01,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:22:01,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:22:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605324550] [2023-11-23 21:22:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:22:01,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:22:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:22:01,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:22:01,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:22:01,626 INFO L87 Difference]: Start difference. First operand 36 states and 43 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:22:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:22:01,747 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2023-11-23 21:22:01,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:22:01,748 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:22:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:22:01,750 INFO L225 Difference]: With dead ends: 74 [2023-11-23 21:22:01,750 INFO L226 Difference]: Without dead ends: 40 [2023-11-23 21:22:01,751 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:22:01,752 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:22:01,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:22:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-23 21:22:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2023-11-23 21:22:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-23 21:22:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-11-23 21:22:01,769 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 31 [2023-11-23 21:22:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:22:01,770 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-11-23 21:22:01,770 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:22:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-11-23 21:22:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-23 21:22:01,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:22:01,774 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, 1, 1, 1, 1, 1, 1] [2023-11-23 21:22:01,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:22:01,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:22:01,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:22:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1206567094, now seen corresponding path program 1 times [2023-11-23 21:22:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:22:01,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313745] [2023-11-23 21:22:01,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:22:01,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:22:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 21:22:02,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:22:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313745] [2023-11-23 21:22:02,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:22:02,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:22:02,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:22:02,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941574740] [2023-11-23 21:22:02,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:22:02,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:22:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:22:02,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:22:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:22:02,121 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 21:22:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:22:02,239 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2023-11-23 21:22:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:22:02,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2023-11-23 21:22:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:22:02,241 INFO L225 Difference]: With dead ends: 76 [2023-11-23 21:22:02,241 INFO L226 Difference]: Without dead ends: 40 [2023-11-23 21:22:02,242 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:22:02,243 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:22:02,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:22:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-23 21:22:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-11-23 21:22:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-23 21:22:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-11-23 21:22:02,253 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 42 [2023-11-23 21:22:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:22:02,253 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-11-23 21:22:02,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 21:22:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-11-23 21:22:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 21:22:02,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:22:02,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:22:02,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:22:02,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:22:02,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:22:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1824256497, now seen corresponding path program 1 times [2023-11-23 21:22:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:22:02,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105482750] [2023-11-23 21:22:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:22:02,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:22:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 21:22:02,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:22:02,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105482750] [2023-11-23 21:22:02,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105482750] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:22:02,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142494901] [2023-11-23 21:22:02,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:22:02,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:22:02,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:22:02,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:22:02,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:22:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:03,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-23 21:22:03,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:22:03,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 21:22:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 21:22:03,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:22:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 21:22:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142494901] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:22:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1135219771] [2023-11-23 21:22:04,255 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-11-23 21:22:04,255 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:22:04,260 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:22:04,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:22:04,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 21 [2023-11-23 21:22:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644545329] [2023-11-23 21:22:04,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:22:04,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-23 21:22:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:22:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-23 21:22:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-23 21:22:04,266 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 21 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 7 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (15), 4 states have call predecessors, (15), 7 states have call successors, (15) [2023-11-23 21:22:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:22:04,698 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2023-11-23 21:22:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:22:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 7 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (15), 4 states have call predecessors, (15), 7 states have call successors, (15) Word has length 47 [2023-11-23 21:22:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:22:04,701 INFO L225 Difference]: With dead ends: 82 [2023-11-23 21:22:04,701 INFO L226 Difference]: Without dead ends: 44 [2023-11-23 21:22:04,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-11-23 21:22:04,703 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:22:04,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 172 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:22:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-23 21:22:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-23 21:22:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.16) internal successors, (29), 29 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-23 21:22:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-11-23 21:22:04,712 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 47 [2023-11-23 21:22:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:22:04,721 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-11-23 21:22:04,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 7 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (15), 4 states have call predecessors, (15), 7 states have call successors, (15) [2023-11-23 21:22:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-11-23 21:22:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 21:22:04,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:22:04,725 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2023-11-23 21:22:04,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 21:22:04,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:22:04,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:22:04,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:22:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1731634967, now seen corresponding path program 2 times [2023-11-23 21:22:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:22:04,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851059400] [2023-11-23 21:22:04,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:22:04,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:22:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 21:22:05,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:22:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851059400] [2023-11-23 21:22:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851059400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:22:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115766884] [2023-11-23 21:22:05,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 21:22:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:22:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:22:05,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:22:06,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:22:06,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-23 21:22:06,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:22:06,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 21:22:06,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:22:06,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 21:22:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 21:22:06,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:22:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 21:22:08,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115766884] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:22:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [753107009] [2023-11-23 21:22:08,907 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-11-23 21:22:08,907 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:22:08,908 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:22:08,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:22:08,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 18] total 33 [2023-11-23 21:22:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528354145] [2023-11-23 21:22:08,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:22:08,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-23 21:22:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:22:08,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-23 21:22:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2023-11-23 21:22:08,914 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 33 states, 25 states have (on average 2.24) internal successors, (56), 28 states have internal predecessors, (56), 10 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 21:22:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:22:09,569 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2023-11-23 21:22:09,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 21:22:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 2.24) internal successors, (56), 28 states have internal predecessors, (56), 10 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 57 [2023-11-23 21:22:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:22:09,572 INFO L225 Difference]: With dead ends: 90 [2023-11-23 21:22:09,572 INFO L226 Difference]: Without dead ends: 48 [2023-11-23 21:22:09,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2023-11-23 21:22:09,574 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 33 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:22:09,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 253 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:22:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-23 21:22:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-23 21:22:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-23 21:22:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-11-23 21:22:09,584 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 57 [2023-11-23 21:22:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:22:09,584 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-11-23 21:22:09,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 2.24) internal successors, (56), 28 states have internal predecessors, (56), 10 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 21:22:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-11-23 21:22:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 21:22:09,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:22:09,588 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 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, 1, 1, 1, 1] [2023-11-23 21:22:09,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 21:22:09,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:22:09,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:22:09,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:22:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -57194813, now seen corresponding path program 3 times [2023-11-23 21:22:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:22:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922275920] [2023-11-23 21:22:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:22:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:22:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 35 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 21:22:11,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:22:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922275920] [2023-11-23 21:22:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922275920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:22:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912859686] [2023-11-23 21:22:11,302 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 21:22:11,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:22:11,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:22:11,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:22:11,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:22:11,471 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 21:22:11,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:22:11,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-23 21:22:11,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:22:11,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 21:22:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 21:22:11,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:22:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 70 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 21:22:15,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912859686] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:22:15,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [551579787] [2023-11-23 21:22:15,849 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-11-23 21:22:15,850 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:22:15,850 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:22:15,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:22:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 43 [2023-11-23 21:22:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55959656] [2023-11-23 21:22:15,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:22:15,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-23 21:22:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:22:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-23 21:22:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2023-11-23 21:22:15,855 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 43 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 36 states have internal predecessors, (64), 12 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2023-11-23 21:22:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:22:16,653 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2023-11-23 21:22:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 21:22:16,655 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 36 states have internal predecessors, (64), 12 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) Word has length 67 [2023-11-23 21:22:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:22:16,656 INFO L225 Difference]: With dead ends: 96 [2023-11-23 21:22:16,656 INFO L226 Difference]: Without dead ends: 50 [2023-11-23 21:22:16,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=502, Invalid=2048, Unknown=0, NotChecked=0, Total=2550 [2023-11-23 21:22:16,660 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:22:16,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 268 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 21:22:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-23 21:22:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-23 21:22:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 13 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-23 21:22:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-11-23 21:22:16,669 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 67 [2023-11-23 21:22:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:22:16,670 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-11-23 21:22:16,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 36 states have internal predecessors, (64), 12 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2023-11-23 21:22:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-11-23 21:22:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-23 21:22:16,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:22:16,673 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 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, 1, 1, 1, 1] [2023-11-23 21:22:16,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 21:22:16,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:22:16,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:22:16,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:22:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash 164102852, now seen corresponding path program 4 times [2023-11-23 21:22:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:22:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386095442] [2023-11-23 21:22:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:22:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:22:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-23 21:22:22,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:22:22,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386095442] [2023-11-23 21:22:22,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386095442] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:22:22,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486971047] [2023-11-23 21:22:22,381 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-23 21:22:22,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:22:22,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:22:22,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:22:22,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0f18f1-e156-4b0f-88dd-107916ad6a27/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 21:22:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:22:22,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-23 21:22:22,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:22:22,675 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 21:22:22,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2023-11-23 21:22:22,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 21:22:25,270 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_48| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_48| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_48| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_48|) (= (store |v_#memory_int_BEFORE_CALL_48| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2023-11-23 21:22:27,274 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_48| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_48| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_48| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_48|) (= (store |v_#memory_int_BEFORE_CALL_48| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2023-11-23 21:22:29,461 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_51| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_51| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_51| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_51| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_51|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2023-11-23 21:22:31,463 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_51| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_51| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_51| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_51| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_51|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2023-11-23 21:22:33,503 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_37| |c_#memory_int|))) (and (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_37| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_#memory_int|))) is different from false [2023-11-23 21:22:33,507 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_37| |c_#memory_int|))) (and (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_37| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_#memory_int|))) is different from true [2023-11-23 21:22:35,557 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~c.base|))) (or (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_func_to_recursive_line_24_to_25_0_#in~c.base| .cse0)) (exists ((|v_#memory_int_629| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_37| |v_#memory_int_629|))) (and (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))) (= .cse1 |c_func_to_recursive_line_24_to_25_0_#in~d.base|) (= (store |v_old(#memory_int)_AFTER_CALL_37| .cse1 (select |v_#memory_int_629| .cse1)) |v_#memory_int_629|)))) (= (store |v_#memory_int_629| |c_func_to_recursive_line_24_to_25_0_#in~c.base| .cse0) |c_#memory_int|))))) is different from false [2023-11-23 21:22:35,561 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~c.base|))) (or (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_func_to_recursive_line_24_to_25_0_#in~c.base| .cse0)) (exists ((|v_#memory_int_629| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_37| |v_#memory_int_629|))) (and (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))) (= .cse1 |c_func_to_recursive_line_24_to_25_0_#in~d.base|) (= (store |v_old(#memory_int)_AFTER_CALL_37| .cse1 (select |v_#memory_int_629| .cse1)) |v_#memory_int_629|)))) (= (store |v_#memory_int_629| |c_func_to_recursive_line_24_to_25_0_#in~c.base| .cse0) |c_#memory_int|))))) is different from true [2023-11-23 21:22:36,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 134 treesize of output 122 [2023-11-23 21:22:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 70 trivial. 11 not checked. [2023-11-23 21:22:36,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:22:36,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:22:36,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-11-23 21:22:36,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2023-11-23 21:22:36,877 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 15 treesize of output 13 [2023-11-23 21:22:36,887 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 20 treesize of output 16 [2023-11-23 21:22:37,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486971047] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:22:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [652828412] [2023-11-23 21:22:37,657 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-11-23 21:22:37,657 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:22:37,658 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:22:37,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 21:22:37,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 37 [2023-11-23 21:22:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211115374] [2023-11-23 21:22:37,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 21:22:37,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-23 21:22:37,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:22:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-23 21:22:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1069, Unknown=10, NotChecked=276, Total=1482 [2023-11-23 21:22:37,663 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 37 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 32 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 11 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2023-11-23 21:22:40,210 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_48| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_48| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_48| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_48|) (= (store |v_#memory_int_BEFORE_CALL_48| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_51| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_51| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse2) (= (store |v_#memory_int_BEFORE_CALL_51| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_51| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_51|)))) .cse1))) is different from false [2023-11-23 21:22:42,212 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_48| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_48| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_48| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_48|) (= (store |v_#memory_int_BEFORE_CALL_48| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_51| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_51| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse2) (= (store |v_#memory_int_BEFORE_CALL_51| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_51| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_51|)))) .cse1))) is different from true [2023-11-23 21:22:44,255 WARN L854 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|) (or (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (= (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) (select |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~c.base))) (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_37| |c_#memory_int|))) (and (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_37| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_#memory_int|)) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from false [2023-11-23 21:22:44,259 WARN L876 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|) (or (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (= (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) (select |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~c.base))) (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_37| |c_#memory_int|))) (and (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_37| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_#memory_int|)) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from true [2023-11-23 21:22:46,262 WARN L854 $PredicateComparison]: unable to prove that (and (or (< (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 6) (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (not (= (select (select |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 0)) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~c.base|))) (or (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_func_to_recursive_line_24_to_25_0_#in~c.base| .cse0)) (exists ((|v_#memory_int_629| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_37| |v_#memory_int_629|))) (and (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))) (= .cse1 |c_func_to_recursive_line_24_to_25_0_#in~d.base|) (= (store |v_old(#memory_int)_AFTER_CALL_37| .cse1 (select |v_#memory_int_629| .cse1)) |v_#memory_int_629|)))) (= (store |v_#memory_int_629| |c_func_to_recursive_line_24_to_25_0_#in~c.base| .cse0) |c_#memory_int|)))))) is different from false [2023-11-23 21:22:46,267 WARN L876 $PredicateComparison]: unable to prove that (and (or (< (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 6) (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (not (= (select (select |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 0)) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~c.base|))) (or (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_func_to_recursive_line_24_to_25_0_#in~c.base| .cse0)) (exists ((|v_#memory_int_629| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_37| |v_#memory_int_629|))) (and (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))) (= .cse1 |c_func_to_recursive_line_24_to_25_0_#in~d.base|) (= (store |v_old(#memory_int)_AFTER_CALL_37| .cse1 (select |v_#memory_int_629| .cse1)) |v_#memory_int_629|)))) (= (store |v_#memory_int_629| |c_func_to_recursive_line_24_to_25_0_#in~c.base| .cse0) |c_#memory_int|)))))) is different from true