./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 09:23:56,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:23:56,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:23:56,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:23:56,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:23:56,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:23:56,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:23:56,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:23:56,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:23:56,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:23:56,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:23:56,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:23:56,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:23:56,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:23:56,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:23:56,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:23:56,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:23:56,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:23:56,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:23:56,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:23:56,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:23:56,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:23:56,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:23:56,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:23:56,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:23:56,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:23:56,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:23:56,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:23:56,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:23:56,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:23:56,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:23:56,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:23:56,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:23:56,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:23:56,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:23:56,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:23:56,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:23:56,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:23:56,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:23:56,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:23:56,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:23:56,764 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 09:23:56,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:23:56,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:23:56,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:23:56,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:23:56,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:23:56,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:23:56,786 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:23:56,787 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:23:56,787 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:23:56,787 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:23:56,787 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:23:56,787 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:23:56,787 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:23:56,788 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:23:56,788 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:23:56,788 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:23:56,788 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:23:56,788 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:23:56,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:23:56,789 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:23:56,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:23:56,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:23:56,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:23:56,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:23:56,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:23:56,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:23:56,790 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:23:56,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:23:56,791 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:23:56,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:23:56,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:23:56,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:23:56,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:23:56,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:23:56,792 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:23:56,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:23:56,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:23:56,793 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:23:56,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:23:56,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:23:56,793 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:23:56,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/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_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2022-12-14 09:23:56,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:23:56,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:23:56,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:23:56,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:23:56,986 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:23:56,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-12-14 09:23:59,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:23:59,734 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:23:59,734 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-12-14 09:23:59,739 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/data/0dda03e21/e553b1bba2704a69990e211877e399bc/FLAGf94ccd5a1 [2022-12-14 09:23:59,750 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/data/0dda03e21/e553b1bba2704a69990e211877e399bc [2022-12-14 09:23:59,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:23:59,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:23:59,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:23:59,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:23:59,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:23:59,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa5e4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59, skipping insertion in model container [2022-12-14 09:23:59,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:23:59,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:23:59,888 WARN L237 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_b5b1139f-3bad-45eb-ab7b-f79792217a55/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-12-14 09:23:59,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:23:59,899 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:23:59,911 WARN L237 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_b5b1139f-3bad-45eb-ab7b-f79792217a55/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-12-14 09:23:59,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:23:59,921 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:23:59,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59 WrapperNode [2022-12-14 09:23:59,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:23:59,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:23:59,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:23:59,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:23:59,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,944 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-12-14 09:23:59,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:23:59,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:23:59,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:23:59,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:23:59,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,956 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:23:59,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:23:59,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:23:59,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:23:59,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (1/1) ... [2022-12-14 09:23:59,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:23:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:23:59,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:23:59,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:24:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:24:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:24:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-12-14 09:24:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-12-14 09:24:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-12-14 09:24:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-12-14 09:24:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:24:00,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:24:00,063 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:24:00,065 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:24:00,144 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:24:00,156 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:24:00,156 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 09:24:00,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:24:00 BoogieIcfgContainer [2022-12-14 09:24:00,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:24:00,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:24:00,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:24:00,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:24:00,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:23:59" (1/3) ... [2022-12-14 09:24:00,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c9c4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:24:00, skipping insertion in model container [2022-12-14 09:24:00,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:23:59" (2/3) ... [2022-12-14 09:24:00,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c9c4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:24:00, skipping insertion in model container [2022-12-14 09:24:00,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:24:00" (3/3) ... [2022-12-14 09:24:00,166 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2022-12-14 09:24:00,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:24:00,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 09:24:00,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:24:00,221 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=LoopsAndPotentialCycles, 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;@2b161131, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:24:00,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 09:24:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 09:24:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 09:24:00,230 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:00,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:00,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2022-12-14 09:24:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:00,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738377709] [2022-12-14 09:24:00,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:24:00,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:00,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738377709] [2022-12-14 09:24:00,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738377709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:24:00,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:24:00,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:24:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062722591] [2022-12-14 09:24:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:24:00,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:24:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:24:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:24:00,428 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 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) [2022-12-14 09:24:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:00,478 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-12-14 09:24:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:24:00,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 [2022-12-14 09:24:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:00,486 INFO L225 Difference]: With dead ends: 36 [2022-12-14 09:24:00,486 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 09:24:00,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:24:00,491 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:00,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:24:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 09:24:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-12-14 09:24:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 09:24:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-12-14 09:24:00,519 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2022-12-14 09:24:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:00,519 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-14 09:24:00,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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) [2022-12-14 09:24:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-12-14 09:24:00,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 09:24:00,521 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:00,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:00,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:24:00,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2022-12-14 09:24:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:00,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239200842] [2022-12-14 09:24:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:24:00,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:00,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239200842] [2022-12-14 09:24:00,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239200842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:24:00,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:24:00,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:24:00,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497040177] [2022-12-14 09:24:00,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:24:00,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:24:00,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:00,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:24:00,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:24:00,582 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:24:00,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:00,609 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-12-14 09:24:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:24:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-12-14 09:24:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:00,611 INFO L225 Difference]: With dead ends: 32 [2022-12-14 09:24:00,611 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 09:24:00,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:24:00,612 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:00,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:24:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 09:24:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-12-14 09:24:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 09:24:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-12-14 09:24:00,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2022-12-14 09:24:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:00,618 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-14 09:24:00,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:24:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-12-14 09:24:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:24:00,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:00,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:00,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 09:24:00,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2022-12-14 09:24:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:00,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711985927] [2022-12-14 09:24:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:24:00,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:00,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711985927] [2022-12-14 09:24:00,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711985927] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:00,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060943922] [2022-12-14 09:24:00,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:00,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:00,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:00,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:00,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:24:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:00,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 09:24:00,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:24:00,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:24:00,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060943922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:00,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1510632456] [2022-12-14 09:24:00,998 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-12-14 09:24:00,998 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:01,001 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:24:01,004 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:24:01,005 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:24:01,056 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 39 for LOIs [2022-12-14 09:24:01,083 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 39 for LOIs [2022-12-14 09:24:01,089 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:24:01,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1510632456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:24:01,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:01,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2022-12-14 09:24:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696966334] [2022-12-14 09:24:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:24:01,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 09:24:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:01,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 09:24:01,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-14 09:24:01,327 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:24:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:01,429 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-12-14 09:24:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:24:01,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2022-12-14 09:24:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:01,431 INFO L225 Difference]: With dead ends: 68 [2022-12-14 09:24:01,431 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 09:24:01,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-14 09:24:01,433 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:01,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:24:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 09:24:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-12-14 09:24:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-14 09:24:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-12-14 09:24:01,445 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2022-12-14 09:24:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:01,446 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-12-14 09:24:01,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:24:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-12-14 09:24:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 09:24:01,448 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:01,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-12-14 09:24:01,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:24:01,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:01,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2022-12-14 09:24:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:01,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174993341] [2022-12-14 09:24:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:24:01,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:01,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174993341] [2022-12-14 09:24:01,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174993341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:01,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723884134] [2022-12-14 09:24:01,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:01,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:01,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:01,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:01,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:24:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:01,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 09:24:01,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:24:01,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:24:02,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723884134] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:02,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1039311824] [2022-12-14 09:24:02,197 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:02,197 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:02,199 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:02,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:02,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2022-12-14 09:24:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874043100] [2022-12-14 09:24:02,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:02,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 09:24:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:02,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 09:24:02,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-14 09:24:02,203 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 09:24:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:02,354 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-12-14 09:24:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 09:24:02,355 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2022-12-14 09:24:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:02,356 INFO L225 Difference]: With dead ends: 85 [2022-12-14 09:24:02,356 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 09:24:02,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-12-14 09:24:02,357 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:02,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 94 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:24:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 09:24:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-12-14 09:24:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 09:24:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-12-14 09:24:02,366 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2022-12-14 09:24:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:02,366 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-12-14 09:24:02,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 09:24:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-12-14 09:24:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 09:24:02,368 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:02,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-12-14 09:24:02,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 09:24:02,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:02,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2022-12-14 09:24:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:02,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295509168] [2022-12-14 09:24:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 09:24:02,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:02,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295509168] [2022-12-14 09:24:02,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295509168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:02,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141548969] [2022-12-14 09:24:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:02,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:02,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:02,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:02,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:24:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:02,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 09:24:02,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:24:02,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:24:03,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141548969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:03,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1356934174] [2022-12-14 09:24:03,108 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:03,108 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:03,109 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:03,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:03,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-12-14 09:24:03,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918248746] [2022-12-14 09:24:03,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:03,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 09:24:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:03,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 09:24:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-12-14 09:24:03,111 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 09:24:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:03,461 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2022-12-14 09:24:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 09:24:03,461 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-12-14 09:24:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:03,464 INFO L225 Difference]: With dead ends: 121 [2022-12-14 09:24:03,464 INFO L226 Difference]: Without dead ends: 77 [2022-12-14 09:24:03,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2022-12-14 09:24:03,466 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:03,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 198 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:24:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-14 09:24:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-12-14 09:24:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-12-14 09:24:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2022-12-14 09:24:03,486 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2022-12-14 09:24:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:03,486 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2022-12-14 09:24:03,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 09:24:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2022-12-14 09:24:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 09:24:03,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:03,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:03,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 09:24:03,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:03,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2022-12-14 09:24:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:03,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368211201] [2022-12-14 09:24:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 09:24:03,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:03,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368211201] [2022-12-14 09:24:03,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368211201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:03,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534275842] [2022-12-14 09:24:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:03,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:03,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:03,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:03,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:24:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:03,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 09:24:03,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 09:24:04,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 09:24:04,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534275842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:04,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [376273101] [2022-12-14 09:24:04,314 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:04,314 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:04,314 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:04,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:04,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2022-12-14 09:24:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936968591] [2022-12-14 09:24:04,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:04,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 09:24:04,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 09:24:04,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-12-14 09:24:04,317 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2022-12-14 09:24:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:04,485 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2022-12-14 09:24:04,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 09:24:04,486 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 50 [2022-12-14 09:24:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:04,495 INFO L225 Difference]: With dead ends: 119 [2022-12-14 09:24:04,495 INFO L226 Difference]: Without dead ends: 97 [2022-12-14 09:24:04,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-12-14 09:24:04,497 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:04,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 94 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:24:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-14 09:24:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2022-12-14 09:24:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 11 states have return successors, (39), 17 states have call predecessors, (39), 14 states have call successors, (39) [2022-12-14 09:24:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2022-12-14 09:24:04,513 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2022-12-14 09:24:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:04,513 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2022-12-14 09:24:04,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2022-12-14 09:24:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2022-12-14 09:24:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-14 09:24:04,516 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:04,516 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:04,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:24:04,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 09:24:04,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:04,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2022-12-14 09:24:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:04,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464195306] [2022-12-14 09:24:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 09:24:04,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:04,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464195306] [2022-12-14 09:24:04,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464195306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:04,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279674474] [2022-12-14 09:24:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:04,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:04,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:04,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:04,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:24:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:05,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 09:24:05,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 09:24:05,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-14 09:24:05,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279674474] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1535293757] [2022-12-14 09:24:05,657 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:05,657 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:05,657 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:05,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:05,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2022-12-14 09:24:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179394432] [2022-12-14 09:24:05,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:05,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 09:24:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:05,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 09:24:05,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-12-14 09:24:05,660 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2022-12-14 09:24:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:06,115 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2022-12-14 09:24:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 09:24:06,115 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) Word has length 79 [2022-12-14 09:24:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:06,117 INFO L225 Difference]: With dead ends: 204 [2022-12-14 09:24:06,117 INFO L226 Difference]: Without dead ends: 115 [2022-12-14 09:24:06,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 09:24:06,119 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 102 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:06,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 267 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:24:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-14 09:24:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2022-12-14 09:24:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.171875) internal successors, (75), 66 states have internal predecessors, (75), 19 states have call successors, (19), 8 states have call predecessors, (19), 14 states have return successors, (50), 23 states have call predecessors, (50), 19 states have call successors, (50) [2022-12-14 09:24:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2022-12-14 09:24:06,131 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2022-12-14 09:24:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:06,131 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2022-12-14 09:24:06,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2022-12-14 09:24:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2022-12-14 09:24:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 09:24:06,134 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:06,134 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:06,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:24:06,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 09:24:06,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:06,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1765032193, now seen corresponding path program 1 times [2022-12-14 09:24:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:06,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283890913] [2022-12-14 09:24:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 34 proven. 78 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-12-14 09:24:06,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:06,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283890913] [2022-12-14 09:24:06,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283890913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:06,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669667713] [2022-12-14 09:24:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:06,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:06,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:06,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:06,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:24:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:06,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 09:24:06,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 24 proven. 144 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-12-14 09:24:06,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 24 proven. 158 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-12-14 09:24:07,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669667713] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:07,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [39780281] [2022-12-14 09:24:07,396 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:07,396 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:07,397 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:07,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:07,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 20 [2022-12-14 09:24:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496585938] [2022-12-14 09:24:07,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:07,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 09:24:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 09:24:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-14 09:24:07,400 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2022-12-14 09:24:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:07,627 INFO L93 Difference]: Finished difference Result 191 states and 315 transitions. [2022-12-14 09:24:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 09:24:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) Word has length 115 [2022-12-14 09:24:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:07,629 INFO L225 Difference]: With dead ends: 191 [2022-12-14 09:24:07,629 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 09:24:07,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 211 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-12-14 09:24:07,631 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:07,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 136 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:24:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 09:24:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-12-14 09:24:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 19 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (48), 23 states have call predecessors, (48), 19 states have call successors, (48) [2022-12-14 09:24:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2022-12-14 09:24:07,640 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 115 [2022-12-14 09:24:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:07,641 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2022-12-14 09:24:07,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2022-12-14 09:24:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2022-12-14 09:24:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-14 09:24:07,642 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:07,643 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:07,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 09:24:07,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:07,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:07,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1728273241, now seen corresponding path program 2 times [2022-12-14 09:24:07,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:07,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770039943] [2022-12-14 09:24:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 42 proven. 158 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2022-12-14 09:24:07,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:07,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770039943] [2022-12-14 09:24:07,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770039943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:07,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900452940] [2022-12-14 09:24:07,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:24:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:08,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:08,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 09:24:08,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 09:24:08,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:24:08,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 09:24:08,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-12-14 09:24:08,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 139 proven. 36 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2022-12-14 09:24:08,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900452940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:08,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1761574761] [2022-12-14 09:24:08,548 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:08,549 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:08,549 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:08,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:08,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 18 [2022-12-14 09:24:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339097275] [2022-12-14 09:24:08,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:08,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 09:24:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 09:24:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-14 09:24:08,551 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 11 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 13 states have call predecessors, (25), 11 states have call successors, (25) [2022-12-14 09:24:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:08,700 INFO L93 Difference]: Finished difference Result 156 states and 263 transitions. [2022-12-14 09:24:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 09:24:08,701 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 11 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 13 states have call predecessors, (25), 11 states have call successors, (25) Word has length 145 [2022-12-14 09:24:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:08,703 INFO L225 Difference]: With dead ends: 156 [2022-12-14 09:24:08,704 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 09:24:08,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 281 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-12-14 09:24:08,705 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:08,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:24:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 09:24:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2022-12-14 09:24:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 84 states have internal predecessors, (92), 23 states have call successors, (23), 8 states have call predecessors, (23), 21 states have return successors, (79), 33 states have call predecessors, (79), 23 states have call successors, (79) [2022-12-14 09:24:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 194 transitions. [2022-12-14 09:24:08,723 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 194 transitions. Word has length 145 [2022-12-14 09:24:08,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:08,724 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 194 transitions. [2022-12-14 09:24:08,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 11 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 13 states have call predecessors, (25), 11 states have call successors, (25) [2022-12-14 09:24:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 194 transitions. [2022-12-14 09:24:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 09:24:08,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:08,727 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:08,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 09:24:08,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:08,928 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -439437933, now seen corresponding path program 1 times [2022-12-14 09:24:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:08,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052303059] [2022-12-14 09:24:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 78 proven. 187 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2022-12-14 09:24:09,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:09,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052303059] [2022-12-14 09:24:09,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052303059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:09,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32735908] [2022-12-14 09:24:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:09,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:09,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:09,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 09:24:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:09,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 09:24:09,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 41 proven. 277 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2022-12-14 09:24:09,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 41 proven. 293 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-12-14 09:24:10,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32735908] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:10,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1282942563] [2022-12-14 09:24:10,179 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:10,179 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:10,179 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:10,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:10,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 25 [2022-12-14 09:24:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792637715] [2022-12-14 09:24:10,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:10,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 09:24:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:10,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 09:24:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2022-12-14 09:24:10,181 INFO L87 Difference]: Start difference. First operand 126 states and 194 transitions. Second operand has 25 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 25 states have internal predecessors, (81), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 11 states have call predecessors, (32), 20 states have call successors, (32) [2022-12-14 09:24:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:10,692 INFO L93 Difference]: Finished difference Result 320 states and 608 transitions. [2022-12-14 09:24:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 09:24:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 25 states have internal predecessors, (81), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 11 states have call predecessors, (32), 20 states have call successors, (32) Word has length 176 [2022-12-14 09:24:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:10,694 INFO L225 Difference]: With dead ends: 320 [2022-12-14 09:24:10,694 INFO L226 Difference]: Without dead ends: 164 [2022-12-14 09:24:10,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 333 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 09:24:10,696 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 104 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:10,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 279 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:24:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-14 09:24:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 144. [2022-12-14 09:24:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 94 states have (on average 1.1702127659574468) internal successors, (110), 96 states have internal predecessors, (110), 27 states have call successors, (27), 11 states have call predecessors, (27), 22 states have return successors, (98), 36 states have call predecessors, (98), 27 states have call successors, (98) [2022-12-14 09:24:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 235 transitions. [2022-12-14 09:24:10,706 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 235 transitions. Word has length 176 [2022-12-14 09:24:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:10,706 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 235 transitions. [2022-12-14 09:24:10,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 25 states have internal predecessors, (81), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 11 states have call predecessors, (32), 20 states have call successors, (32) [2022-12-14 09:24:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 235 transitions. [2022-12-14 09:24:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-12-14 09:24:10,710 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:10,710 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 19, 17, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 6, 6, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:10,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 09:24:10,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 09:24:10,911 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 463600509, now seen corresponding path program 3 times [2022-12-14 09:24:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:10,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790842322] [2022-12-14 09:24:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2683 backedges. 99 proven. 628 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2022-12-14 09:24:11,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:11,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790842322] [2022-12-14 09:24:11,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790842322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:11,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185032465] [2022-12-14 09:24:11,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 09:24:11,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:11,246 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:11,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 09:24:11,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 09:24:11,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:24:11,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 09:24:11,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2683 backedges. 1242 proven. 68 refuted. 0 times theorem prover too weak. 1373 trivial. 0 not checked. [2022-12-14 09:24:11,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2683 backedges. 171 proven. 621 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2022-12-14 09:24:12,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185032465] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:12,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1783439278] [2022-12-14 09:24:12,535 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:12,536 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:12,536 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:12,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:12,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 25 [2022-12-14 09:24:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505223986] [2022-12-14 09:24:12,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:12,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 09:24:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 09:24:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-12-14 09:24:12,538 INFO L87 Difference]: Start difference. First operand 144 states and 235 transitions. Second operand has 25 states, 24 states have (on average 4.125) internal successors, (99), 25 states have internal predecessors, (99), 21 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (38), 12 states have call predecessors, (38), 21 states have call successors, (38) [2022-12-14 09:24:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:13,183 INFO L93 Difference]: Finished difference Result 326 states and 659 transitions. [2022-12-14 09:24:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 09:24:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.125) internal successors, (99), 25 states have internal predecessors, (99), 21 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (38), 12 states have call predecessors, (38), 21 states have call successors, (38) Word has length 309 [2022-12-14 09:24:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:13,185 INFO L225 Difference]: With dead ends: 326 [2022-12-14 09:24:13,185 INFO L226 Difference]: Without dead ends: 181 [2022-12-14 09:24:13,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 603 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=2236, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 09:24:13,187 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:13,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 238 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:24:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-14 09:24:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2022-12-14 09:24:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 115 states have internal predecessors, (134), 33 states have call successors, (33), 20 states have call predecessors, (33), 21 states have return successors, (115), 35 states have call predecessors, (115), 33 states have call successors, (115) [2022-12-14 09:24:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 282 transitions. [2022-12-14 09:24:13,198 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 282 transitions. Word has length 309 [2022-12-14 09:24:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:13,198 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 282 transitions. [2022-12-14 09:24:13,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.125) internal successors, (99), 25 states have internal predecessors, (99), 21 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (38), 12 states have call predecessors, (38), 21 states have call successors, (38) [2022-12-14 09:24:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 282 transitions. [2022-12-14 09:24:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2022-12-14 09:24:13,202 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:13,202 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 19, 15, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:13,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 09:24:13,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 09:24:13,403 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1312340948, now seen corresponding path program 4 times [2022-12-14 09:24:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:13,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361745111] [2022-12-14 09:24:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 132 proven. 543 refuted. 0 times theorem prover too weak. 1765 trivial. 0 not checked. [2022-12-14 09:24:13,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:13,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361745111] [2022-12-14 09:24:13,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361745111] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:13,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298679609] [2022-12-14 09:24:13,673 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 09:24:13,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:13,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:13,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:13,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 09:24:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:13,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:24:13,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 132 proven. 543 refuted. 0 times theorem prover too weak. 1765 trivial. 0 not checked. [2022-12-14 09:24:13,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 132 proven. 564 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2022-12-14 09:24:15,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298679609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:15,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [543986654] [2022-12-14 09:24:15,142 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:15,142 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:15,142 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:15,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:15,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 19 [2022-12-14 09:24:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370461409] [2022-12-14 09:24:15,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:15,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 09:24:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 09:24:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-14 09:24:15,145 INFO L87 Difference]: Start difference. First operand 171 states and 282 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 15 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) [2022-12-14 09:24:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:15,314 INFO L93 Difference]: Finished difference Result 203 states and 360 transitions. [2022-12-14 09:24:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 09:24:15,315 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 15 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) Word has length 295 [2022-12-14 09:24:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:15,317 INFO L225 Difference]: With dead ends: 203 [2022-12-14 09:24:15,317 INFO L226 Difference]: Without dead ends: 189 [2022-12-14 09:24:15,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 580 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-12-14 09:24:15,318 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 72 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:15,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 114 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:24:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-12-14 09:24:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2022-12-14 09:24:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 121 states have (on average 1.1487603305785123) internal successors, (139), 120 states have internal predecessors, (139), 34 states have call successors, (34), 20 states have call predecessors, (34), 23 states have return successors, (128), 38 states have call predecessors, (128), 34 states have call successors, (128) [2022-12-14 09:24:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 301 transitions. [2022-12-14 09:24:15,337 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 301 transitions. Word has length 295 [2022-12-14 09:24:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:15,337 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 301 transitions. [2022-12-14 09:24:15,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 15 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) [2022-12-14 09:24:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 301 transitions. [2022-12-14 09:24:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2022-12-14 09:24:15,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:15,340 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 43, 43, 34, 31, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 21, 21, 21, 21, 13, 12, 12, 8, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:15,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 09:24:15,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:15,542 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1384976131, now seen corresponding path program 5 times [2022-12-14 09:24:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:15,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57641337] [2022-12-14 09:24:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10630 backedges. 286 proven. 1054 refuted. 0 times theorem prover too weak. 9290 trivial. 0 not checked. [2022-12-14 09:24:16,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:16,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57641337] [2022-12-14 09:24:16,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57641337] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:16,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027355712] [2022-12-14 09:24:16,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:24:16,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:16,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:16,030 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:16,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 09:24:16,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-12-14 09:24:16,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:24:16,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 09:24:16,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10630 backedges. 3279 proven. 6 refuted. 0 times theorem prover too weak. 7345 trivial. 0 not checked. [2022-12-14 09:24:16,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10630 backedges. 1161 proven. 119 refuted. 0 times theorem prover too weak. 9350 trivial. 0 not checked. [2022-12-14 09:24:17,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027355712] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:17,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2121515980] [2022-12-14 09:24:17,251 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:17,251 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:17,252 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:17,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-12-14 09:24:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379986117] [2022-12-14 09:24:17,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:17,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 09:24:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 09:24:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-12-14 09:24:17,253 INFO L87 Difference]: Start difference. First operand 179 states and 301 transitions. Second operand has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 13 states have call successors, (23), 2 states have call predecessors, (23), 11 states have return successors, (30), 10 states have call predecessors, (30), 13 states have call successors, (30) [2022-12-14 09:24:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:17,668 INFO L93 Difference]: Finished difference Result 437 states and 917 transitions. [2022-12-14 09:24:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 09:24:17,669 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 13 states have call successors, (23), 2 states have call predecessors, (23), 11 states have return successors, (30), 10 states have call predecessors, (30), 13 states have call successors, (30) Word has length 602 [2022-12-14 09:24:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:17,671 INFO L225 Difference]: With dead ends: 437 [2022-12-14 09:24:17,671 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 09:24:17,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1236 GetRequests, 1195 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 09:24:17,673 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 92 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:17,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 185 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:24:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 09:24:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 193. [2022-12-14 09:24:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 132 states have (on average 1.1666666666666667) internal successors, (154), 130 states have internal predecessors, (154), 39 states have call successors, (39), 25 states have call predecessors, (39), 21 states have return successors, (128), 37 states have call predecessors, (128), 39 states have call successors, (128) [2022-12-14 09:24:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 321 transitions. [2022-12-14 09:24:17,687 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 321 transitions. Word has length 602 [2022-12-14 09:24:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:17,687 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 321 transitions. [2022-12-14 09:24:17,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 13 states have call successors, (23), 2 states have call predecessors, (23), 11 states have return successors, (30), 10 states have call predecessors, (30), 13 states have call successors, (30) [2022-12-14 09:24:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 321 transitions. [2022-12-14 09:24:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-12-14 09:24:17,690 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:17,691 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 43, 43, 36, 35, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 21, 21, 21, 21, 15, 12, 10, 8, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:17,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 09:24:17,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 09:24:17,891 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:17,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1217613709, now seen corresponding path program 6 times [2022-12-14 09:24:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:17,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752481132] [2022-12-14 09:24:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:17,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10829 backedges. 857 proven. 575 refuted. 0 times theorem prover too weak. 9397 trivial. 0 not checked. [2022-12-14 09:24:18,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752481132] [2022-12-14 09:24:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752481132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841917037] [2022-12-14 09:24:18,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 09:24:18,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:18,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:18,442 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:18,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 09:24:18,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 09:24:18,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:24:18,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 09:24:18,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10829 backedges. 980 proven. 2131 refuted. 0 times theorem prover too weak. 7718 trivial. 0 not checked. [2022-12-14 09:24:18,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10829 backedges. 980 proven. 2176 refuted. 0 times theorem prover too weak. 7673 trivial. 0 not checked. [2022-12-14 09:24:21,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841917037] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145969893] [2022-12-14 09:24:21,894 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:21,894 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:21,894 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:21,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:21,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 31] total 41 [2022-12-14 09:24:21,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744634266] [2022-12-14 09:24:21,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:21,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 09:24:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:21,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 09:24:21,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 09:24:21,896 INFO L87 Difference]: Start difference. First operand 193 states and 321 transitions. Second operand has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 32 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (49), 19 states have call predecessors, (49), 32 states have call successors, (49) [2022-12-14 09:24:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:23,048 INFO L93 Difference]: Finished difference Result 432 states and 850 transitions. [2022-12-14 09:24:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-14 09:24:23,049 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 32 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (49), 19 states have call predecessors, (49), 32 states have call successors, (49) Word has length 608 [2022-12-14 09:24:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:23,053 INFO L225 Difference]: With dead ends: 432 [2022-12-14 09:24:23,053 INFO L226 Difference]: Without dead ends: 240 [2022-12-14 09:24:23,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1272 GetRequests, 1177 SyntacticMatches, 15 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=5696, Unknown=0, NotChecked=0, Total=6642 [2022-12-14 09:24:23,057 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 204 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:23,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 494 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 09:24:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-12-14 09:24:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 185. [2022-12-14 09:24:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.09375) internal successors, (140), 124 states have internal predecessors, (140), 36 states have call successors, (36), 25 states have call predecessors, (36), 20 states have return successors, (85), 35 states have call predecessors, (85), 36 states have call successors, (85) [2022-12-14 09:24:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2022-12-14 09:24:23,071 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 608 [2022-12-14 09:24:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:23,072 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2022-12-14 09:24:23,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 32 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (49), 19 states have call predecessors, (49), 32 states have call successors, (49) [2022-12-14 09:24:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2022-12-14 09:24:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2022-12-14 09:24:23,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:23,074 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 28, 28, 23, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:23,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 09:24:23,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 09:24:23,275 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2040161751, now seen corresponding path program 7 times [2022-12-14 09:24:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:23,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026370242] [2022-12-14 09:24:23,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 547 proven. 151 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2022-12-14 09:24:23,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:23,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026370242] [2022-12-14 09:24:23,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026370242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:23,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025266573] [2022-12-14 09:24:23,616 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 09:24:23,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:23,617 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:23,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 09:24:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:23,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 09:24:23,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 655 proven. 176 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2022-12-14 09:24:23,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 659 proven. 188 refuted. 0 times theorem prover too weak. 3523 trivial. 0 not checked. [2022-12-14 09:24:24,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025266573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:24,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [18646096] [2022-12-14 09:24:24,827 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:24,827 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:24,827 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:24,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:24,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 18 [2022-12-14 09:24:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679862499] [2022-12-14 09:24:24,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:24,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 09:24:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 09:24:24,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-12-14 09:24:24,830 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2022-12-14 09:24:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:24,968 INFO L93 Difference]: Finished difference Result 195 states and 274 transitions. [2022-12-14 09:24:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 09:24:24,969 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) Word has length 391 [2022-12-14 09:24:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:24,971 INFO L225 Difference]: With dead ends: 195 [2022-12-14 09:24:24,971 INFO L226 Difference]: Without dead ends: 188 [2022-12-14 09:24:24,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 770 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2022-12-14 09:24:24,972 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:24,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 115 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:24:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-12-14 09:24:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2022-12-14 09:24:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.09375) internal successors, (140), 124 states have internal predecessors, (140), 36 states have call successors, (36), 25 states have call predecessors, (36), 20 states have return successors, (83), 35 states have call predecessors, (83), 36 states have call successors, (83) [2022-12-14 09:24:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2022-12-14 09:24:24,984 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 391 [2022-12-14 09:24:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:24,984 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2022-12-14 09:24:24,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 13 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2022-12-14 09:24:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2022-12-14 09:24:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2022-12-14 09:24:24,986 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:24,986 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:24,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 09:24:25,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:25,187 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 520840600, now seen corresponding path program 8 times [2022-12-14 09:24:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:25,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862368436] [2022-12-14 09:24:25,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:24:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 517 proven. 104 refuted. 0 times theorem prover too weak. 4748 trivial. 0 not checked. [2022-12-14 09:24:25,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:24:25,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862368436] [2022-12-14 09:24:25,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862368436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:24:25,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250055155] [2022-12-14 09:24:25,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:24:25,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:24:25,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:24:25,470 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:24:25,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 09:24:25,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 09:24:25,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:24:25,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:24:25,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:24:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1096 proven. 84 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [2022-12-14 09:24:25,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:24:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1096 proven. 89 refuted. 0 times theorem prover too weak. 4184 trivial. 0 not checked. [2022-12-14 09:24:26,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250055155] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:24:26,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [964469686] [2022-12-14 09:24:26,797 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 09:24:26,797 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:24:26,797 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 09:24:26,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:24:26,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 17] total 25 [2022-12-14 09:24:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501365081] [2022-12-14 09:24:26,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:24:26,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 09:24:26,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:24:26,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 09:24:26,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-12-14 09:24:26,799 INFO L87 Difference]: Start difference. First operand 185 states and 259 transitions. Second operand has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 15 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2022-12-14 09:24:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:24:27,309 INFO L93 Difference]: Finished difference Result 393 states and 594 transitions. [2022-12-14 09:24:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 09:24:27,309 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 15 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) Word has length 432 [2022-12-14 09:24:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:24:27,311 INFO L225 Difference]: With dead ends: 393 [2022-12-14 09:24:27,311 INFO L226 Difference]: Without dead ends: 227 [2022-12-14 09:24:27,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 842 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1662, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 09:24:27,313 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 98 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:24:27,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 233 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:24:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-12-14 09:24:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 187. [2022-12-14 09:24:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 126 states have internal predecessors, (141), 37 states have call successors, (37), 25 states have call predecessors, (37), 20 states have return successors, (86), 35 states have call predecessors, (86), 37 states have call successors, (86) [2022-12-14 09:24:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 264 transitions. [2022-12-14 09:24:27,325 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 264 transitions. Word has length 432 [2022-12-14 09:24:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:24:27,326 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 264 transitions. [2022-12-14 09:24:27,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 15 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2022-12-14 09:24:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 264 transitions. [2022-12-14 09:24:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2022-12-14 09:24:27,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:24:27,328 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:27,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 09:24:27,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 09:24:27,530 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:24:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:24:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1780384136, now seen corresponding path program 9 times [2022-12-14 09:24:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:24:27,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137643998] [2022-12-14 09:24:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:24:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:24:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:24:27,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 09:24:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:24:27,711 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 09:24:27,712 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 09:24:27,712 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 09:24:27,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 09:24:27,717 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:24:27,722 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:24:27,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:24:27 BoogieIcfgContainer [2022-12-14 09:24:27,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:24:27,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:24:27,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:24:27,805 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:24:27,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:24:00" (3/4) ... [2022-12-14 09:24:27,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 09:24:27,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 09:24:27,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:24:27,885 INFO L158 Benchmark]: Toolchain (without parser) took 28131.76ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 117.0MB in the beginning and 176.1MB in the end (delta: -59.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2022-12-14 09:24:27,886 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 76.7MB in the beginning and 76.6MB in the end (delta: 153.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:24:27,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.54ms. Allocated memory is still 151.0MB. Free memory was 117.0MB in the beginning and 106.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 09:24:27,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.65ms. Allocated memory is still 151.0MB. Free memory was 106.5MB in the beginning and 105.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:24:27,886 INFO L158 Benchmark]: Boogie Preprocessor took 12.60ms. Allocated memory is still 151.0MB. Free memory was 105.0MB in the beginning and 103.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:24:27,887 INFO L158 Benchmark]: RCFGBuilder took 200.80ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 93.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 09:24:27,887 INFO L158 Benchmark]: TraceAbstraction took 27643.66ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 92.9MB in the beginning and 186.6MB in the end (delta: -93.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-12-14 09:24:27,887 INFO L158 Benchmark]: Witness Printer took 80.38ms. Allocated memory is still 264.2MB. Free memory was 186.6MB in the beginning and 176.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 09:24:27,889 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 76.7MB in the beginning and 76.6MB in the end (delta: 153.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.54ms. Allocated memory is still 151.0MB. Free memory was 117.0MB in the beginning and 106.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.65ms. Allocated memory is still 151.0MB. Free memory was 106.5MB in the beginning and 105.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.60ms. Allocated memory is still 151.0MB. Free memory was 105.0MB in the beginning and 103.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 200.80ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 93.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27643.66ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 92.9MB in the beginning and 186.6MB in the end (delta: -93.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 80.38ms. Allocated memory is still 264.2MB. Free memory was 186.6MB in the beginning and 176.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 17, TraceHistogramMax: 46, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1122 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1057 mSDsluCounter, 2882 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2461 mSDsCounter, 1685 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7543 IncrementalHoareTripleChecker+Invalid, 9228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1685 mSolverCounterUnsat, 421 mSDtfsCounter, 7543 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6977 GetRequests, 6417 SyntacticMatches, 84 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4384 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=13, InterpolantAutomatonStates: 311, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 288 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 7068 NumberOfCodeBlocks, 6124 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 9860 ConstructedInterpolants, 0 QuantifiedInterpolants, 13840 SizeOfPredicates, 76 NumberOfNonLiveVariables, 5434 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 103292/114786 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 0.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME: 0.0s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME: 0.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 09:24:27,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b1139f-3bad-45eb-ab7b-f79792217a55/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE