./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ --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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:25:02,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:25:02,751 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:25:02,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:25:02,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:25:02,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:25:02,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:25:02,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:25:02,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:25:02,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:25:02,806 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:25:02,807 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:25:02,807 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:25:02,809 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:25:02,809 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:25:02,810 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:25:02,810 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:25:02,810 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:25:02,811 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:25:02,811 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:25:02,813 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:25:02,813 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:25:02,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:25:02,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:25:02,815 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:25:02,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:25:02,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:25:02,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:25:02,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:25:02,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:25:02,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:25:02,831 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:25:02,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:25:02,832 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:25:02,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:25:02,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:25:02,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:25:02,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:25:02,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:25:02,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:25:02,833 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:25:02,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:25:02,834 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:25:02,834 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:25:02,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:25:02,835 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_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/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_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2023-11-19 05:25:03,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:25:03,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:25:03,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:25:03,185 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:25:03,186 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:25:03,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-19 05:25:06,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:25:06,440 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:25:06,440 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-19 05:25:06,448 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/data/658bb7aa8/2c84ee319b424e87b4e364482e0d2151/FLAG95a125330 [2023-11-19 05:25:06,462 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/data/658bb7aa8/2c84ee319b424e87b4e364482e0d2151 [2023-11-19 05:25:06,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:25:06,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:25:06,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:25:06,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:25:06,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:25:06,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d816b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06, skipping insertion in model container [2023-11-19 05:25:06,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,500 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:25:06,657 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_ab5be61e-dee5-4c90-891f-6bfba5c965f1/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2023-11-19 05:25:06,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:25:06,672 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:25:06,695 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_ab5be61e-dee5-4c90-891f-6bfba5c965f1/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2023-11-19 05:25:06,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:25:06,711 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:25:06,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06 WrapperNode [2023-11-19 05:25:06,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:25:06,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:25:06,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:25:06,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:25:06,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,751 INFO L138 Inliner]: procedures = 16, calls = 62, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2023-11-19 05:25:06,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:25:06,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:25:06,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:25:06,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:25:06,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:25:06,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:25:06,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:25:06,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:25:06,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (1/1) ... [2023-11-19 05:25:06,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:25:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:25:06,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:25:06,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:25:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:25:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:25:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:25:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:25:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-19 05:25:06,866 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-19 05:25:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-19 05:25:06,866 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-19 05:25:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-19 05:25:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-19 05:25:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:25:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:25:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:25:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2023-11-19 05:25:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2023-11-19 05:25:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-19 05:25:06,868 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-19 05:25:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:25:06,964 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:25:06,966 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:25:07,244 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:25:07,327 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:25:07,327 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:25:07,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:25:07 BoogieIcfgContainer [2023-11-19 05:25:07,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:25:07,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:25:07,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:25:07,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:25:07,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:25:06" (1/3) ... [2023-11-19 05:25:07,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f28b170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:25:07, skipping insertion in model container [2023-11-19 05:25:07,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:25:06" (2/3) ... [2023-11-19 05:25:07,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f28b170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:25:07, skipping insertion in model container [2023-11-19 05:25:07,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:25:07" (3/3) ... [2023-11-19 05:25:07,351 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2023-11-19 05:25:07,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:25:07,368 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:25:07,412 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:25:07,419 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;@49619166, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:25:07,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:25:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-19 05:25:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:25:07,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:07,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:07,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:07,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -295619350, now seen corresponding path program 1 times [2023-11-19 05:25:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:07,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381869478] [2023-11-19 05:25:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:08,153 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-19 05:25:08,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381869478] [2023-11-19 05:25:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381869478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:25:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93855107] [2023-11-19 05:25:08,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:08,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:25:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:08,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:25:08,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:25:08,205 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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-19 05:25:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:08,474 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-11-19 05:25:08,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:25:08,477 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-19 05:25:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:08,487 INFO L225 Difference]: With dead ends: 57 [2023-11-19 05:25:08,488 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 05:25:08,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:25:08,496 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:08,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:25:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 05:25:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2023-11-19 05:25:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 29 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-19 05:25:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2023-11-19 05:25:08,552 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2023-11-19 05:25:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:08,553 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2023-11-19 05:25:08,553 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-19 05:25:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2023-11-19 05:25:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:25:08,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:08,558 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-19 05:25:08,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:25:08,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:08,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1675804554, now seen corresponding path program 1 times [2023-11-19 05:25:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:08,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333097096] [2023-11-19 05:25:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:08,934 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-19 05:25:08,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333097096] [2023-11-19 05:25:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333097096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:08,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:08,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:25:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670928873] [2023-11-19 05:25:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:08,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:25:08,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:25:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:25:08,940 INFO L87 Difference]: Start difference. First operand 41 states and 50 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-19 05:25:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:09,108 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2023-11-19 05:25:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:25:09,109 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-19 05:25:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:09,115 INFO L225 Difference]: With dead ends: 88 [2023-11-19 05:25:09,115 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 05:25:09,122 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-19 05:25:09,124 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:09,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 85 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:25:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 05:25:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-11-19 05:25:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-19 05:25:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-11-19 05:25:09,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 20 [2023-11-19 05:25:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:09,144 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-11-19 05:25:09,144 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-19 05:25:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-11-19 05:25:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 05:25:09,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:09,146 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-19 05:25:09,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:25:09,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:09,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1520575934, now seen corresponding path program 1 times [2023-11-19 05:25:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:09,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968212394] [2023-11-19 05:25:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:09,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:09,380 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-19 05:25:09,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968212394] [2023-11-19 05:25:09,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968212394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:09,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:09,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:25:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265338291] [2023-11-19 05:25:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:09,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:25:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:09,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:25:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:25:09,405 INFO L87 Difference]: Start difference. First operand 43 states and 52 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-19 05:25:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:09,602 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-11-19 05:25:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:25:09,603 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-19 05:25:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:09,604 INFO L225 Difference]: With dead ends: 90 [2023-11-19 05:25:09,605 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 05:25:09,605 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-19 05:25:09,607 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:09,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:25:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 05:25:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-11-19 05:25:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-19 05:25:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-11-19 05:25:09,617 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2023-11-19 05:25:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:09,617 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-11-19 05:25:09,617 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-19 05:25:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-11-19 05:25:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-19 05:25:09,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:09,619 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-19 05:25:09,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:25:09,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:09,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1805714706, now seen corresponding path program 1 times [2023-11-19 05:25:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496137515] [2023-11-19 05:25:09,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:09,921 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-19 05:25:09,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496137515] [2023-11-19 05:25:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496137515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:25:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494838456] [2023-11-19 05:25:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:09,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:25:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:25:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:25:09,925 INFO L87 Difference]: Start difference. First operand 45 states and 54 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-19 05:25:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:10,059 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2023-11-19 05:25:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:25:10,060 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-19 05:25:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:10,061 INFO L225 Difference]: With dead ends: 92 [2023-11-19 05:25:10,061 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 05:25:10,062 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-19 05:25:10,063 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:10,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:25:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 05:25:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2023-11-19 05:25:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2023-11-19 05:25:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-11-19 05:25:10,072 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 42 [2023-11-19 05:25:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:10,073 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-11-19 05:25:10,073 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-19 05:25:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-11-19 05:25:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-19 05:25:10,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:10,075 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, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:10,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:25:10,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:10,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1473520921, now seen corresponding path program 1 times [2023-11-19 05:25:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:10,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064243773] [2023-11-19 05:25:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 05:25:10,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:10,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064243773] [2023-11-19 05:25:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064243773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:25:10,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55236522] [2023-11-19 05:25:10,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:10,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:25:10,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:25:10,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:25:10,347 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-19 05:25:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:10,468 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2023-11-19 05:25:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:25:10,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) Word has length 53 [2023-11-19 05:25:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:10,470 INFO L225 Difference]: With dead ends: 94 [2023-11-19 05:25:10,471 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 05:25:10,472 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-19 05:25:10,473 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:10,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:25:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 05:25:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-19 05:25:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 33 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-19 05:25:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-11-19 05:25:10,482 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 53 [2023-11-19 05:25:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:10,482 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-11-19 05:25:10,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-19 05:25:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-11-19 05:25:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-19 05:25:10,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:10,485 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:10,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:25:10,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:10,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1845601206, now seen corresponding path program 1 times [2023-11-19 05:25:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:10,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440680226] [2023-11-19 05:25:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-19 05:25:11,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:11,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440680226] [2023-11-19 05:25:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440680226] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:25:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926427690] [2023-11-19 05:25:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:11,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:25:11,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:25:11,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:25:11,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:25:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:11,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 05:25:11,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:25:11,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 05:25:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-19 05:25:11,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:25:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 05:25:12,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926427690] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:25:12,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [436428377] [2023-11-19 05:25:12,577 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2023-11-19 05:25:12,577 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:25:12,582 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-19 05:25:12,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:25:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-11-19 05:25:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534195129] [2023-11-19 05:25:12,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:25:12,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-19 05:25:12,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-19 05:25:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-11-19 05:25:12,594 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-19 05:25:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:13,003 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2023-11-19 05:25:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 05:25:13,004 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) Word has length 58 [2023-11-19 05:25:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:13,005 INFO L225 Difference]: With dead ends: 100 [2023-11-19 05:25:13,005 INFO L226 Difference]: Without dead ends: 53 [2023-11-19 05:25:13,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2023-11-19 05:25:13,007 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:13,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 181 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:25:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-19 05:25:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-19 05:25:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) [2023-11-19 05:25:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2023-11-19 05:25:13,016 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 58 [2023-11-19 05:25:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:13,017 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2023-11-19 05:25:13,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-19 05:25:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2023-11-19 05:25:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-19 05:25:13,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:13,020 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2023-11-19 05:25:13,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:25:13,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:25:13,232 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:13,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash -186818732, now seen corresponding path program 2 times [2023-11-19 05:25:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729247739] [2023-11-19 05:25:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 05:25:14,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:14,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729247739] [2023-11-19 05:25:14,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729247739] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:25:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753412143] [2023-11-19 05:25:14,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:25:14,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:25:14,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:25:14,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:25:14,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:25:14,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-19 05:25:14,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:25:14,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-19 05:25:14,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:25:14,607 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 542 treesize of output 534 [2023-11-19 05:25:14,740 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-19 05:25:15,349 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-11-19 05:25:15,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 91 [2023-11-19 05:25:15,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 33 [2023-11-19 05:25:15,370 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 31 treesize of output 23 [2023-11-19 05:25:15,376 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 5 treesize of output 3 [2023-11-19 05:25:15,380 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 5 treesize of output 3 [2023-11-19 05:25:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-19 05:25:15,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:25:16,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:25:16,077 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 18 treesize of output 19 [2023-11-19 05:25:16,080 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 30 treesize of output 22 [2023-11-19 05:25:16,085 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 5 treesize of output 3 [2023-11-19 05:25:16,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:25:16,630 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 18 treesize of output 19 [2023-11-19 05:25:16,634 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 30 treesize of output 22 [2023-11-19 05:25:16,639 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 5 treesize of output 3 [2023-11-19 05:25:17,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:25:17,076 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 18 treesize of output 19 [2023-11-19 05:25:17,081 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 30 treesize of output 22 [2023-11-19 05:25:17,086 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 5 treesize of output 3 [2023-11-19 05:25:17,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753412143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:25:17,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884332285] [2023-11-19 05:25:17,459 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2023-11-19 05:25:17,459 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:25:17,459 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-19 05:25:17,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:25:17,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 31 [2023-11-19 05:25:17,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072456468] [2023-11-19 05:25:17,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:25:17,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-19 05:25:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:17,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 05:25:17,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1076, Unknown=3, NotChecked=0, Total=1190 [2023-11-19 05:25:17,463 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 31 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 30 states have internal predecessors, (65), 16 states have call successors, (22), 2 states have call predecessors, (22), 13 states have return successors, (23), 10 states have call predecessors, (23), 16 states have call successors, (23) [2023-11-19 05:25:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:19,006 INFO L93 Difference]: Finished difference Result 135 states and 181 transitions. [2023-11-19 05:25:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-19 05:25:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 30 states have internal predecessors, (65), 16 states have call successors, (22), 2 states have call predecessors, (22), 13 states have return successors, (23), 10 states have call predecessors, (23), 16 states have call successors, (23) Word has length 68 [2023-11-19 05:25:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:19,008 INFO L225 Difference]: With dead ends: 135 [2023-11-19 05:25:19,008 INFO L226 Difference]: Without dead ends: 57 [2023-11-19 05:25:19,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=289, Invalid=3012, Unknown=5, NotChecked=0, Total=3306 [2023-11-19 05:25:19,012 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 56 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:19,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 432 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 821 Invalid, 2 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 05:25:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-19 05:25:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-19 05:25:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-19 05:25:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-11-19 05:25:19,022 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 68 [2023-11-19 05:25:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:19,023 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-11-19 05:25:19,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 30 states have internal predecessors, (65), 16 states have call successors, (22), 2 states have call predecessors, (22), 13 states have return successors, (23), 10 states have call predecessors, (23), 16 states have call successors, (23) [2023-11-19 05:25:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-11-19 05:25:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-19 05:25:19,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:19,026 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 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] [2023-11-19 05:25:19,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:25:19,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:25:19,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:19,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash 915106378, now seen corresponding path program 3 times [2023-11-19 05:25:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459558343] [2023-11-19 05:25:19,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 16 proven. 143 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-19 05:25:20,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459558343] [2023-11-19 05:25:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459558343] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:25:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818346156] [2023-11-19 05:25:20,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:25:20,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:25:20,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:25:20,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:25:20,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:25:20,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 05:25:20,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:25:20,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-19 05:25:20,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:25:20,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 05:25:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 129 proven. 24 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-19 05:25:21,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:25:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 129 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 05:25:25,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818346156] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:25:25,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [950524483] [2023-11-19 05:25:25,246 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2023-11-19 05:25:25,246 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:25:25,246 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-19 05:25:25,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:25:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 22] total 41 [2023-11-19 05:25:25,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730251468] [2023-11-19 05:25:25,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:25:25,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-19 05:25:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:25,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-19 05:25:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1370, Unknown=0, NotChecked=0, Total=1640 [2023-11-19 05:25:25,252 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 41 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 35 states have internal predecessors, (81), 15 states have call successors, (29), 8 states have call predecessors, (29), 13 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2023-11-19 05:25:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:26,113 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2023-11-19 05:25:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 05:25:26,117 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 35 states have internal predecessors, (81), 15 states have call successors, (29), 8 states have call predecessors, (29), 13 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) Word has length 104 [2023-11-19 05:25:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:26,118 INFO L225 Difference]: With dead ends: 116 [2023-11-19 05:25:26,118 INFO L226 Difference]: Without dead ends: 61 [2023-11-19 05:25:26,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 186 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=469, Invalid=2501, Unknown=0, NotChecked=0, Total=2970 [2023-11-19 05:25:26,121 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:26,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 335 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 05:25:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-19 05:25:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-19 05:25:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 39 states have internal predecessors, (39), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (21), 16 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-19 05:25:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2023-11-19 05:25:26,145 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 104 [2023-11-19 05:25:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:26,145 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2023-11-19 05:25:26,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 35 states have internal predecessors, (81), 15 states have call successors, (29), 8 states have call predecessors, (29), 13 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2023-11-19 05:25:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2023-11-19 05:25:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 05:25:26,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:26,148 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 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] [2023-11-19 05:25:26,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:25:26,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:25:26,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:25:26,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1101129270, now seen corresponding path program 4 times [2023-11-19 05:25:26,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:26,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905123117] [2023-11-19 05:25:26,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2023-11-19 05:25:35,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905123117] [2023-11-19 05:25:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905123117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:25:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769970174] [2023-11-19 05:25:35,988 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 05:25:35,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:25:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:25:35,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:25:36,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5be61e-dee5-4c90-891f-6bfba5c965f1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:25:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:36,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 164 conjunts are in the unsatisfiable core [2023-11-19 05:25:36,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:25:36,275 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 830 treesize of output 822 [2023-11-19 05:25:36,342 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-19 05:25:38,583 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_44| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_44| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_44| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_44| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-19 05:25:40,585 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_44| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_44| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_44| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_44| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-19 05:25:42,622 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_45| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_45| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_45| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_45| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_45| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-19 05:25:44,624 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_45| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_45| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_45| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_45| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_45| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-19 05:25:46,663 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_46| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_46| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_46| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_46| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-19 05:25:48,665 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_46| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_46| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_46| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_46| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-19 05:25:50,702 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-19 05:25:52,704 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-19 05:25:54,750 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_48| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_48| |c_#memory_int|))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_48| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_48| (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_48| c_func_to_recursive_line_26_to_27_0_~e.base)))))))) is different from false [2023-11-19 05:25:54,753 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_48| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_48| |c_#memory_int|))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_48| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_48| (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_48| c_func_to_recursive_line_26_to_27_0_~e.base)))))))) is different from true