./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V --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 ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:49:11,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:49:11,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:49:12,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:49:12,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:49:12,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:49:12,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:49:12,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:49:12,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:49:12,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:49:12,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:49:12,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:49:12,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:49:12,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:49:12,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:49:12,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:49:12,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:49:12,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:49:12,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:49:12,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:49:12,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:49:12,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:49:12,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:49:12,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:49:12,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:49:12,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:49:12,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:49:12,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:49:12,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:49:12,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:49:12,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:49:12,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:49:12,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:49:12,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:49:12,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:49:12,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:49:12,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:49:12,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:49:12,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:49:12,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:49:12,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:49:12,100 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 02:49:12,129 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:49:12,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:49:12,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:49:12,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:49:12,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:49:12,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:49:12,132 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:49:12,132 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:49:12,132 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:49:12,132 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:49:12,133 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:49:12,133 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:49:12,133 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:49:12,133 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:49:12,134 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:49:12,134 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:49:12,134 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:49:12,134 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:49:12,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:49:12,136 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:49:12,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:49:12,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:49:12,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:49:12,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:49:12,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:49:12,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:49:12,137 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:49:12,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:49:12,138 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:49:12,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:49:12,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:49:12,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:49:12,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:49:12,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:49:12,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:49:12,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:49:12,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:49:12,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:49:12,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:49:12,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:49:12,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:49:12,141 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/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_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2021-11-23 02:49:12,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:49:12,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:49:12,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:49:12,606 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:49:12,607 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:49:12,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2021-11-23 02:49:12,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/data/533389b72/b33c5093793c4bbc9c79195a2b0ae6fd/FLAGdb23bc804 [2021-11-23 02:49:13,317 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:49:13,318 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2021-11-23 02:49:13,333 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/data/533389b72/b33c5093793c4bbc9c79195a2b0ae6fd/FLAGdb23bc804 [2021-11-23 02:49:13,670 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/data/533389b72/b33c5093793c4bbc9c79195a2b0ae6fd [2021-11-23 02:49:13,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:49:13,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:49:13,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:49:13,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:49:13,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:49:13,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:49:13" (1/1) ... [2021-11-23 02:49:13,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142d53d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:13, skipping insertion in model container [2021-11-23 02:49:13,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:49:13" (1/1) ... [2021-11-23 02:49:13,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:49:13,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:49:13,959 WARN L230 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_23a9ba4c-f19b-440f-b944-0a272b09737d/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2021-11-23 02:49:13,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:49:13,974 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:49:13,991 WARN L230 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_23a9ba4c-f19b-440f-b944-0a272b09737d/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2021-11-23 02:49:13,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:49:14,008 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:49:14,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14 WrapperNode [2021-11-23 02:49:14,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:49:14,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:49:14,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:49:14,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:49:14,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,049 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-11-23 02:49:14,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:49:14,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:49:14,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:49:14,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:49:14,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:49:14,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:49:14,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:49:14,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:49:14,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (1/1) ... [2021-11-23 02:49:14,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:49:14,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:14,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:49:14,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:49:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:49:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:49:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-11-23 02:49:14,174 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-11-23 02:49:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-11-23 02:49:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-11-23 02:49:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:49:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:49:14,267 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:49:14,270 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:49:14,495 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:49:14,527 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:49:14,528 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-23 02:49:14,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:14 BoogieIcfgContainer [2021-11-23 02:49:14,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:49:14,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:49:14,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:49:14,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:49:14,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:49:13" (1/3) ... [2021-11-23 02:49:14,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3c61f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:49:14, skipping insertion in model container [2021-11-23 02:49:14,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:14" (2/3) ... [2021-11-23 02:49:14,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3c61f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:49:14, skipping insertion in model container [2021-11-23 02:49:14,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:14" (3/3) ... [2021-11-23 02:49:14,542 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2021-11-23 02:49:14,550 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:49:14,550 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 02:49:14,614 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:49:14,624 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:49:14,624 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 02:49:14,645 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) [2021-11-23 02:49:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 02:49:14,652 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:14,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:14,653 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:14,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:14,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2021-11-23 02:49:14,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:14,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55478001] [2021-11-23 02:49:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:14,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:49:14,928 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:14,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55478001] [2021-11-23 02:49:14,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55478001] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:49:14,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:49:14,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:49:14,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351581695] [2021-11-23 02:49:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:49:14,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:49:14,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:49:14,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:49:14,981 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) [2021-11-23 02:49:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:15,046 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2021-11-23 02:49:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:49:15,050 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 [2021-11-23 02:49:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:15,061 INFO L225 Difference]: With dead ends: 36 [2021-11-23 02:49:15,061 INFO L226 Difference]: Without dead ends: 26 [2021-11-23 02:49:15,065 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:49:15,070 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:15,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:49:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-23 02:49:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-23 02:49:15,124 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) [2021-11-23 02:49:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-11-23 02:49:15,128 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2021-11-23 02:49:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:15,129 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-11-23 02:49:15,129 INFO L471 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) [2021-11-23 02:49:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-11-23 02:49:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:49:15,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:15,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:15,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:49:15,133 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2021-11-23 02:49:15,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:15,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603231393] [2021-11-23 02:49:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:15,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:49:15,221 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:15,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603231393] [2021-11-23 02:49:15,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603231393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:49:15,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:49:15,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:49:15,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052881658] [2021-11-23 02:49:15,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:49:15,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:49:15,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:15,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:49:15,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:49:15,226 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) [2021-11-23 02:49:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:15,252 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-11-23 02:49:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:49:15,253 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 [2021-11-23 02:49:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:15,255 INFO L225 Difference]: With dead ends: 32 [2021-11-23 02:49:15,255 INFO L226 Difference]: Without dead ends: 28 [2021-11-23 02:49:15,256 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:49:15,258 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:15,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:49:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-23 02:49:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-11-23 02:49:15,268 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) [2021-11-23 02:49:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-11-23 02:49:15,271 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2021-11-23 02:49:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:15,271 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-11-23 02:49:15,272 INFO L471 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) [2021-11-23 02:49:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-11-23 02:49:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:49:15,274 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:15,275 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:15,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:49:15,275 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2021-11-23 02:49:15,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:15,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921578725] [2021-11-23 02:49:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:15,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:49:15,373 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:15,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921578725] [2021-11-23 02:49:15,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921578725] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:15,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051049045] [2021-11-23 02:49:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:15,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:15,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:15,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:15,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:49:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:15,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 02:49:15,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:49:15,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:49:16,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051049045] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:16,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1323359] [2021-11-23 02:49:16,151 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-23 02:49:16,151 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:16,157 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:49:16,164 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:49:16,165 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:49:16,333 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 39 for LOIs [2021-11-23 02:49:16,429 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 39 for LOIs [2021-11-23 02:49:16,443 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:49:16,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1323359] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:49:16,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:16,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2021-11-23 02:49:16,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536570293] [2021-11-23 02:49:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:49:16,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:49:16,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:16,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:49:16,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:49:16,827 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) [2021-11-23 02:49:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:16,996 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2021-11-23 02:49:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:49:16,997 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 [2021-11-23 02:49:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:16,999 INFO L225 Difference]: With dead ends: 68 [2021-11-23 02:49:16,999 INFO L226 Difference]: Without dead ends: 44 [2021-11-23 02:49:17,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:49:17,002 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 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 [2021-11-23 02:49:17,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:49:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-23 02:49:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2021-11-23 02:49:17,014 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) [2021-11-23 02:49:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2021-11-23 02:49:17,016 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2021-11-23 02:49:17,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:17,017 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-11-23 02:49:17,017 INFO L471 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) [2021-11-23 02:49:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2021-11-23 02:49:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 02:49:17,020 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:17,020 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:49:17,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:17,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:17,244 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2021-11-23 02:49:17,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:17,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561107598] [2021-11-23 02:49:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:17,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:49:17,358 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:17,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561107598] [2021-11-23 02:49:17,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561107598] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:17,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585243796] [2021-11-23 02:49:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:17,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:17,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:17,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:17,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:49:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:17,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:49:17,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:49:17,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:49:18,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585243796] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:18,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [89305126] [2021-11-23 02:49:18,064 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:18,064 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:18,066 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:18,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:18,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2021-11-23 02:49:18,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947825553] [2021-11-23 02:49:18,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:18,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 02:49:18,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 02:49:18,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-23 02:49:18,078 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) [2021-11-23 02:49:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:18,340 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2021-11-23 02:49:18,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:49:18,341 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 [2021-11-23 02:49:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:18,351 INFO L225 Difference]: With dead ends: 85 [2021-11-23 02:49:18,352 INFO L226 Difference]: Without dead ends: 53 [2021-11-23 02:49:18,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-11-23 02:49:18,359 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:18,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 119 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:49:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-23 02:49:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2021-11-23 02:49:18,383 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) [2021-11-23 02:49:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-11-23 02:49:18,388 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2021-11-23 02:49:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:18,389 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-11-23 02:49:18,389 INFO L471 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) [2021-11-23 02:49:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-11-23 02:49:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 02:49:18,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:18,402 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:49:18,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:18,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:18,619 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2021-11-23 02:49:18,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70670478] [2021-11-23 02:49:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:18,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:49:18,740 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70670478] [2021-11-23 02:49:18,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70670478] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:18,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993324742] [2021-11-23 02:49:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:18,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:18,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:18,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 02:49:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:18,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:49:18,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:49:18,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:49:19,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993324742] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:19,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967509344] [2021-11-23 02:49:19,397 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:19,397 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:19,398 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:19,399 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:19,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2021-11-23 02:49:19,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316615381] [2021-11-23 02:49:19,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:19,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-23 02:49:19,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 02:49:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:49:19,402 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) [2021-11-23 02:49:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:20,056 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2021-11-23 02:49:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 02:49:20,057 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 [2021-11-23 02:49:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:20,060 INFO L225 Difference]: With dead ends: 121 [2021-11-23 02:49:20,060 INFO L226 Difference]: Without dead ends: 77 [2021-11-23 02:49:20,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:49:20,079 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 72 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:20,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 250 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:49:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-23 02:49:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-11-23 02:49:20,100 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) [2021-11-23 02:49:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2021-11-23 02:49:20,103 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2021-11-23 02:49:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:20,103 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2021-11-23 02:49:20,104 INFO L471 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) [2021-11-23 02:49:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2021-11-23 02:49:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-23 02:49:20,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:20,107 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:49:20,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:20,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:20,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:20,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2021-11-23 02:49:20,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:20,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104970386] [2021-11-23 02:49:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:20,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:49:20,442 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:20,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104970386] [2021-11-23 02:49:20,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104970386] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:20,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867105959] [2021-11-23 02:49:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:20,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:20,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:20,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:20,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 02:49:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:20,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:49:20,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:49:20,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:49:21,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867105959] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:21,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [864818897] [2021-11-23 02:49:21,352 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:21,352 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:21,352 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:21,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:21,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2021-11-23 02:49:21,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634253362] [2021-11-23 02:49:21,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:21,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-23 02:49:21,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-23 02:49:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:49:21,356 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) [2021-11-23 02:49:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:21,632 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2021-11-23 02:49:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:49:21,633 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 [2021-11-23 02:49:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:21,637 INFO L225 Difference]: With dead ends: 119 [2021-11-23 02:49:21,637 INFO L226 Difference]: Without dead ends: 97 [2021-11-23 02:49:21,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:49:21,639 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:21,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 117 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:49:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-23 02:49:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2021-11-23 02:49:21,665 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) [2021-11-23 02:49:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2021-11-23 02:49:21,667 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2021-11-23 02:49:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:21,668 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2021-11-23 02:49:21,668 INFO L471 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) [2021-11-23 02:49:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2021-11-23 02:49:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-23 02:49:21,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:21,672 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:49:21,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:21,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 02:49:21,891 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2021-11-23 02:49:21,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:21,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751070245] [2021-11-23 02:49:21,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:21,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-23 02:49:22,058 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:22,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751070245] [2021-11-23 02:49:22,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751070245] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:22,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655874645] [2021-11-23 02:49:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:22,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:22,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:22,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:22,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 02:49:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:22,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 02:49:22,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-11-23 02:49:22,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-23 02:49:23,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655874645] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:23,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108660248] [2021-11-23 02:49:23,443 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:23,444 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:23,444 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:23,444 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:23,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2021-11-23 02:49:23,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597580713] [2021-11-23 02:49:23,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:23,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-23 02:49:23,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:23,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-23 02:49:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-11-23 02:49:23,447 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) [2021-11-23 02:49:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:24,374 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2021-11-23 02:49:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-23 02:49:24,375 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 [2021-11-23 02:49:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:24,379 INFO L225 Difference]: With dead ends: 204 [2021-11-23 02:49:24,379 INFO L226 Difference]: Without dead ends: 115 [2021-11-23 02:49:24,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2021-11-23 02:49:24,382 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 138 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:24,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 355 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:49:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-23 02:49:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2021-11-23 02:49:24,427 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) [2021-11-23 02:49:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2021-11-23 02:49:24,433 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2021-11-23 02:49:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:24,437 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2021-11-23 02:49:24,439 INFO L471 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) [2021-11-23 02:49:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2021-11-23 02:49:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-23 02:49:24,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:24,451 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:24,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:24,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-23 02:49:24,659 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -346616466, now seen corresponding path program 1 times [2021-11-23 02:49:24,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053513178] [2021-11-23 02:49:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:24,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 39 proven. 92 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2021-11-23 02:49:24,823 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:24,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053513178] [2021-11-23 02:49:24,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053513178] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:24,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860343688] [2021-11-23 02:49:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:24,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:24,825 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:24,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:49:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:24,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:49:24,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 172 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-23 02:49:25,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 186 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-23 02:49:26,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860343688] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:26,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1785101929] [2021-11-23 02:49:26,974 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:26,974 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:26,974 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:26,975 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:26,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 20 [2021-11-23 02:49:26,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245515636] [2021-11-23 02:49:26,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:26,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-23 02:49:26,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-23 02:49:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-11-23 02:49:26,980 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) [2021-11-23 02:49:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:27,347 INFO L93 Difference]: Finished difference Result 191 states and 315 transitions. [2021-11-23 02:49:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 02:49:27,348 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 130 [2021-11-23 02:49:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:27,350 INFO L225 Difference]: With dead ends: 191 [2021-11-23 02:49:27,350 INFO L226 Difference]: Without dead ends: 103 [2021-11-23 02:49:27,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 240 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:49:27,353 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 86 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:27,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 183 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:49:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-23 02:49:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2021-11-23 02:49:27,373 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) [2021-11-23 02:49:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2021-11-23 02:49:27,375 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 130 [2021-11-23 02:49:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:27,376 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2021-11-23 02:49:27,376 INFO L471 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) [2021-11-23 02:49:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2021-11-23 02:49:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-23 02:49:27,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:27,380 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:27,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:27,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:27,595 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:27,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2089532945, now seen corresponding path program 2 times [2021-11-23 02:49:27,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:27,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812083410] [2021-11-23 02:49:27,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:27,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-23 02:49:27,784 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:27,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812083410] [2021-11-23 02:49:27,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812083410] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:27,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581189168] [2021-11-23 02:49:27,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:49:27,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:27,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:27,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:27,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 02:49:27,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-23 02:49:27,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:49:27,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:49:27,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 20 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-11-23 02:49:28,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 22 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-11-23 02:49:28,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581189168] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:28,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2113483222] [2021-11-23 02:49:28,836 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:28,836 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:28,837 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:28,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:28,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 16 [2021-11-23 02:49:28,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347444448] [2021-11-23 02:49:28,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:28,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-23 02:49:28,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:28,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-23 02:49:28,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-23 02:49:28,840 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2021-11-23 02:49:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:29,109 INFO L93 Difference]: Finished difference Result 132 states and 213 transitions. [2021-11-23 02:49:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:49:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) Word has length 118 [2021-11-23 02:49:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:29,113 INFO L225 Difference]: With dead ends: 132 [2021-11-23 02:49:29,113 INFO L226 Difference]: Without dead ends: 118 [2021-11-23 02:49:29,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-11-23 02:49:29,115 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:29,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 165 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:49:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-23 02:49:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2021-11-23 02:49:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 20 states have call successors, (20), 8 states have call predecessors, (20), 17 states have return successors, (59), 26 states have call predecessors, (59), 20 states have call successors, (59) [2021-11-23 02:49:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2021-11-23 02:49:29,136 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 118 [2021-11-23 02:49:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:29,136 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2021-11-23 02:49:29,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2021-11-23 02:49:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2021-11-23 02:49:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-23 02:49:29,141 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:29,141 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:29,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:29,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:29,367 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1687293718, now seen corresponding path program 3 times [2021-11-23 02:49:29,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:29,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419878754] [2021-11-23 02:49:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:29,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 76 proven. 209 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2021-11-23 02:49:29,610 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:29,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419878754] [2021-11-23 02:49:29,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419878754] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:29,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987249528] [2021-11-23 02:49:29,610 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:49:29,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:29,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:29,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:29,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 02:49:29,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:49:29,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:49:29,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:49:29,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 423 proven. 19 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2021-11-23 02:49:30,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 74 proven. 251 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2021-11-23 02:49:31,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987249528] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:31,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1912465586] [2021-11-23 02:49:31,255 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:31,255 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:31,256 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:31,257 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:31,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17 [2021-11-23 02:49:31,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521924499] [2021-11-23 02:49:31,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:31,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-23 02:49:31,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-23 02:49:31,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:49:31,260 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2021-11-23 02:49:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:31,510 INFO L93 Difference]: Finished difference Result 213 states and 337 transitions. [2021-11-23 02:49:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:49:31,511 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) Word has length 187 [2021-11-23 02:49:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:31,513 INFO L225 Difference]: With dead ends: 213 [2021-11-23 02:49:31,513 INFO L226 Difference]: Without dead ends: 113 [2021-11-23 02:49:31,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:49:31,516 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:31,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 181 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:49:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-23 02:49:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-11-23 02:49:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 20 states have call successors, (20), 9 states have call predecessors, (20), 18 states have return successors, (59), 27 states have call predecessors, (59), 20 states have call successors, (59) [2021-11-23 02:49:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2021-11-23 02:49:31,539 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 187 [2021-11-23 02:49:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:31,540 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2021-11-23 02:49:31,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2021-11-23 02:49:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2021-11-23 02:49:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 02:49:31,544 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:31,544 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:31,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:31,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 02:49:31,768 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 317371732, now seen corresponding path program 1 times [2021-11-23 02:49:31,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:31,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858516489] [2021-11-23 02:49:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:31,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2021-11-23 02:49:31,920 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858516489] [2021-11-23 02:49:31,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858516489] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905970850] [2021-11-23 02:49:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:31,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:31,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:31,923 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:31,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:49:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:32,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:49:32,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2021-11-23 02:49:32,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 315 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2021-11-23 02:49:34,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905970850] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:34,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1004368315] [2021-11-23 02:49:34,168 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:34,168 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:34,169 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:34,169 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:34,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 18 [2021-11-23 02:49:34,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325831948] [2021-11-23 02:49:34,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:34,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-23 02:49:34,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 02:49:34,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:49:34,173 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2021-11-23 02:49:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:34,446 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2021-11-23 02:49:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:49:34,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) Word has length 188 [2021-11-23 02:49:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:34,451 INFO L225 Difference]: With dead ends: 142 [2021-11-23 02:49:34,451 INFO L226 Difference]: Without dead ends: 128 [2021-11-23 02:49:34,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:49:34,454 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:34,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 135 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:49:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-23 02:49:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2021-11-23 02:49:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 72 states have internal predecessors, (79), 20 states have call successors, (20), 9 states have call predecessors, (20), 16 states have return successors, (49), 25 states have call predecessors, (49), 20 states have call successors, (49) [2021-11-23 02:49:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2021-11-23 02:49:34,474 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 188 [2021-11-23 02:49:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:34,475 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2021-11-23 02:49:34,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2021-11-23 02:49:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2021-11-23 02:49:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-11-23 02:49:34,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:34,482 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 14, 12, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:34,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:34,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-23 02:49:34,707 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:34,707 INFO L85 PathProgramCache]: Analyzing trace with hash 384777542, now seen corresponding path program 4 times [2021-11-23 02:49:34,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:34,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114315141] [2021-11-23 02:49:34,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:34,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 279 proven. 371 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2021-11-23 02:49:35,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:35,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114315141] [2021-11-23 02:49:35,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114315141] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:35,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946181444] [2021-11-23 02:49:35,022 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:49:35,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:35,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:35,023 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:35,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:49:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:35,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:49:35,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 439 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2021-11-23 02:49:35,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 463 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2021-11-23 02:49:37,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946181444] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:37,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1121441020] [2021-11-23 02:49:37,824 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:37,825 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:37,825 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:37,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:37,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 32 [2021-11-23 02:49:37,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094008966] [2021-11-23 02:49:37,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:37,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:49:37,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:37,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:49:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:49:37,830 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) [2021-11-23 02:49:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:39,545 INFO L93 Difference]: Finished difference Result 300 states and 568 transitions. [2021-11-23 02:49:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-23 02:49:39,546 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) Word has length 239 [2021-11-23 02:49:39,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:39,551 INFO L225 Difference]: With dead ends: 300 [2021-11-23 02:49:39,551 INFO L226 Difference]: Without dead ends: 182 [2021-11-23 02:49:39,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=590, Invalid=3570, Unknown=0, NotChecked=0, Total=4160 [2021-11-23 02:49:39,556 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 187 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:39,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 642 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-23 02:49:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-23 02:49:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2021-11-23 02:49:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.099009900990099) internal successors, (111), 100 states have internal predecessors, (111), 28 states have call successors, (28), 17 states have call predecessors, (28), 18 states have return successors, (68), 30 states have call predecessors, (68), 28 states have call successors, (68) [2021-11-23 02:49:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2021-11-23 02:49:39,603 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 239 [2021-11-23 02:49:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:39,604 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2021-11-23 02:49:39,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) [2021-11-23 02:49:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2021-11-23 02:49:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2021-11-23 02:49:39,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:39,665 INFO L514 BasicCegarLoop]: trace histogram [66, 66, 54, 53, 53, 39, 33, 33, 33, 33, 33, 33, 33, 28, 26, 26, 26, 26, 26, 26, 26, 14, 12, 6, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:39,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:39,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-23 02:49:39,879 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:39,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash 480742356, now seen corresponding path program 5 times [2021-11-23 02:49:39,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:39,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629149995] [2021-11-23 02:49:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:39,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 279 proven. 1809 refuted. 0 times theorem prover too weak. 17588 trivial. 0 not checked. [2021-11-23 02:49:40,415 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:40,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629149995] [2021-11-23 02:49:40,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629149995] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:40,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352849199] [2021-11-23 02:49:40,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:49:40,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:40,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:40,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 02:49:40,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:49:40,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:49:40,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 02:49:40,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18434 trivial. 0 not checked. [2021-11-23 02:49:41,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18434 trivial. 0 not checked. [2021-11-23 02:49:44,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352849199] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:44,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1757554430] [2021-11-23 02:49:44,955 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:44,955 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:44,956 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:44,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:44,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2021-11-23 02:49:44,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347443351] [2021-11-23 02:49:44,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:44,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-23 02:49:44,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:44,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 02:49:44,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:49:44,967 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2021-11-23 02:49:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:45,446 INFO L93 Difference]: Finished difference Result 351 states and 610 transitions. [2021-11-23 02:49:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-23 02:49:45,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 810 [2021-11-23 02:49:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:45,453 INFO L225 Difference]: With dead ends: 351 [2021-11-23 02:49:45,453 INFO L226 Difference]: Without dead ends: 202 [2021-11-23 02:49:45,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1647 GetRequests, 1617 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2021-11-23 02:49:45,458 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 98 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:45,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 161 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:49:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-23 02:49:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2021-11-23 02:49:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 121 states have internal predecessors, (135), 36 states have call successors, (36), 20 states have call predecessors, (36), 22 states have return successors, (123), 40 states have call predecessors, (123), 36 states have call successors, (123) [2021-11-23 02:49:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 294 transitions. [2021-11-23 02:49:45,491 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 294 transitions. Word has length 810 [2021-11-23 02:49:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:45,492 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 294 transitions. [2021-11-23 02:49:45,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2021-11-23 02:49:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 294 transitions. [2021-11-23 02:49:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2021-11-23 02:49:45,509 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:45,509 INFO L514 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 28, 26, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 11, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:45,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:45,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 02:49:45,735 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1209979920, now seen corresponding path program 6 times [2021-11-23 02:49:45,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:45,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374926770] [2021-11-23 02:49:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:45,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6759 backedges. 198 proven. 1185 refuted. 0 times theorem prover too weak. 5376 trivial. 0 not checked. [2021-11-23 02:49:46,057 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:46,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374926770] [2021-11-23 02:49:46,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374926770] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934917775] [2021-11-23 02:49:46,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:49:46,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:46,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:46,059 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:46,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 02:49:46,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:49:46,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:49:46,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:49:46,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6759 backedges. 3599 proven. 360 refuted. 0 times theorem prover too weak. 2800 trivial. 0 not checked. [2021-11-23 02:49:47,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:49:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6759 backedges. 414 proven. 1566 refuted. 0 times theorem prover too weak. 4779 trivial. 0 not checked. [2021-11-23 02:49:52,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934917775] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:49:52,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [761622572] [2021-11-23 02:49:52,014 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:49:52,014 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:49:52,014 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:49:52,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:49:52,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 23] total 31 [2021-11-23 02:49:52,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764996299] [2021-11-23 02:49:52,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:49:52,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 02:49:52,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:49:52,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 02:49:52,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2021-11-23 02:49:52,020 INFO L87 Difference]: Start difference. First operand 182 states and 294 transitions. Second operand has 31 states, 30 states have (on average 3.9) internal successors, (117), 31 states have internal predecessors, (117), 27 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 14 states have call predecessors, (46), 27 states have call successors, (46) [2021-11-23 02:49:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:49:53,569 INFO L93 Difference]: Finished difference Result 432 states and 860 transitions. [2021-11-23 02:49:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-23 02:49:53,570 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.9) internal successors, (117), 31 states have internal predecessors, (117), 27 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 14 states have call predecessors, (46), 27 states have call successors, (46) Word has length 483 [2021-11-23 02:49:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:49:53,576 INFO L225 Difference]: With dead ends: 432 [2021-11-23 02:49:53,577 INFO L226 Difference]: Without dead ends: 246 [2021-11-23 02:49:53,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 952 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=3299, Unknown=0, NotChecked=0, Total=3906 [2021-11-23 02:49:53,583 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 257 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:49:53,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 379 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-23 02:49:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-11-23 02:49:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 185. [2021-11-23 02:49:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 127 states have (on average 1.1023622047244095) internal successors, (140), 126 states have internal predecessors, (140), 37 states have call successors, (37), 24 states have call predecessors, (37), 20 states have return successors, (87), 34 states have call predecessors, (87), 37 states have call successors, (87) [2021-11-23 02:49:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 264 transitions. [2021-11-23 02:49:53,672 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 264 transitions. Word has length 483 [2021-11-23 02:49:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:49:53,673 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 264 transitions. [2021-11-23 02:49:53,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.9) internal successors, (117), 31 states have internal predecessors, (117), 27 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 14 states have call predecessors, (46), 27 states have call successors, (46) [2021-11-23 02:49:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 264 transitions. [2021-11-23 02:49:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2021-11-23 02:49:53,703 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:49:53,704 INFO L514 BasicCegarLoop]: trace histogram [55, 55, 52, 52, 42, 41, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 15, 15, 14, 10, 1, 1, 1, 1, 1, 1] [2021-11-23 02:49:53,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:49:53,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 02:49:53,927 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:49:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:49:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1983526510, now seen corresponding path program 7 times [2021-11-23 02:49:53,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:49:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619366041] [2021-11-23 02:49:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:49:53,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:49:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15629 backedges. 383 proven. 1501 refuted. 0 times theorem prover too weak. 13745 trivial. 0 not checked. [2021-11-23 02:49:54,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:49:54,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619366041] [2021-11-23 02:49:54,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619366041] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:49:54,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831731181] [2021-11-23 02:49:54,337 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:49:54,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:49:54,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:49:54,339 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:49:54,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 02:49:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:49:54,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-23 02:49:54,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:49:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15629 backedges. 320 proven. 2126 refuted. 0 times theorem prover too weak. 13183 trivial. 0 not checked. [2021-11-23 02:49:56,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:50:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15629 backedges. 320 proven. 2170 refuted. 0 times theorem prover too weak. 13139 trivial. 0 not checked. [2021-11-23 02:50:01,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831731181] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:50:01,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2024011248] [2021-11-23 02:50:01,642 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:50:01,642 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:50:01,642 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:50:01,645 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:50:01,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 21] total 29 [2021-11-23 02:50:01,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59559209] [2021-11-23 02:50:01,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:50:01,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-23 02:50:01,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:50:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 02:50:01,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:50:01,650 INFO L87 Difference]: Start difference. First operand 185 states and 264 transitions. Second operand has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 states have internal predecessors, (97), 24 states have call successors, (29), 1 states have call predecessors, (29), 16 states have return successors, (42), 17 states have call predecessors, (42), 24 states have call successors, (42) [2021-11-23 02:50:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:50:02,394 INFO L93 Difference]: Finished difference Result 293 states and 583 transitions. [2021-11-23 02:50:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 02:50:02,395 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 states have internal predecessors, (97), 24 states have call successors, (29), 1 states have call predecessors, (29), 16 states have return successors, (42), 17 states have call predecessors, (42), 24 states have call successors, (42) Word has length 728 [2021-11-23 02:50:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:50:02,408 INFO L225 Difference]: With dead ends: 293 [2021-11-23 02:50:02,410 INFO L226 Difference]: Without dead ends: 261 [2021-11-23 02:50:02,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1486 GetRequests, 1442 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=1507, Unknown=0, NotChecked=0, Total=1892 [2021-11-23 02:50:02,416 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 130 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:50:02,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 179 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:50:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-23 02:50:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 246. [2021-11-23 02:50:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 164 states have (on average 1.079268292682927) internal successors, (177), 163 states have internal predecessors, (177), 48 states have call successors, (48), 24 states have call predecessors, (48), 33 states have return successors, (202), 58 states have call predecessors, (202), 48 states have call successors, (202) [2021-11-23 02:50:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 427 transitions. [2021-11-23 02:50:02,457 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 427 transitions. Word has length 728 [2021-11-23 02:50:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:50:02,458 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 427 transitions. [2021-11-23 02:50:02,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 states have internal predecessors, (97), 24 states have call successors, (29), 1 states have call predecessors, (29), 16 states have return successors, (42), 17 states have call predecessors, (42), 24 states have call successors, (42) [2021-11-23 02:50:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 427 transitions. [2021-11-23 02:50:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1410 [2021-11-23 02:50:02,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:50:02,483 INFO L514 BasicCegarLoop]: trace histogram [105, 105, 102, 102, 82, 82, 52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 31, 30, 23, 20, 1, 1, 1, 1, 1, 1] [2021-11-23 02:50:02,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:50:02,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:50:02,707 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:50:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:50:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1187649042, now seen corresponding path program 8 times [2021-11-23 02:50:02,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:50:02,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397809124] [2021-11-23 02:50:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:50:02,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:50:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:50:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 59490 backedges. 920 proven. 4777 refuted. 0 times theorem prover too weak. 53793 trivial. 0 not checked. [2021-11-23 02:50:03,890 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:50:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397809124] [2021-11-23 02:50:03,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397809124] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:50:03,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525318670] [2021-11-23 02:50:03,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:50:03,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:50:03,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:50:03,892 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:50:03,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 02:50:04,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-23 02:50:04,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:50:04,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:50:04,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:50:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 59490 backedges. 3862 proven. 78 refuted. 0 times theorem prover too weak. 55550 trivial. 0 not checked. [2021-11-23 02:50:06,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:50:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 59490 backedges. 3862 proven. 83 refuted. 0 times theorem prover too weak. 55545 trivial. 0 not checked. [2021-11-23 02:50:13,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525318670] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:50:13,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [338723992] [2021-11-23 02:50:13,523 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:50:13,523 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:50:13,524 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:50:13,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:50:13,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 15] total 31 [2021-11-23 02:50:13,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952740817] [2021-11-23 02:50:13,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:50:13,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 02:50:13,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:50:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 02:50:13,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2021-11-23 02:50:13,532 INFO L87 Difference]: Start difference. First operand 246 states and 427 transitions. Second operand has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (42), 20 states have call predecessors, (42), 21 states have call successors, (42) [2021-11-23 02:50:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:50:15,270 INFO L93 Difference]: Finished difference Result 593 states and 1334 transitions. [2021-11-23 02:50:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-23 02:50:15,271 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (42), 20 states have call predecessors, (42), 21 states have call successors, (42) Word has length 1409 [2021-11-23 02:50:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:50:15,278 INFO L225 Difference]: With dead ends: 593 [2021-11-23 02:50:15,278 INFO L226 Difference]: Without dead ends: 260 [2021-11-23 02:50:15,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2862 GetRequests, 2810 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=430, Invalid=2222, Unknown=0, NotChecked=0, Total=2652 [2021-11-23 02:50:15,290 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 97 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:50:15,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 827 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-23 02:50:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-23 02:50:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2021-11-23 02:50:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 170 states have (on average 1.0470588235294118) internal successors, (178), 167 states have internal predecessors, (178), 49 states have call successors, (49), 29 states have call predecessors, (49), 30 states have return successors, (126), 53 states have call predecessors, (126), 49 states have call successors, (126) [2021-11-23 02:50:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 353 transitions. [2021-11-23 02:50:15,324 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 353 transitions. Word has length 1409 [2021-11-23 02:50:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:50:15,325 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 353 transitions. [2021-11-23 02:50:15,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (42), 20 states have call predecessors, (42), 21 states have call successors, (42) [2021-11-23 02:50:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 353 transitions. [2021-11-23 02:50:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2005 [2021-11-23 02:50:15,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:50:15,368 INFO L514 BasicCegarLoop]: trace histogram [148, 148, 145, 145, 123, 120, 74, 74, 74, 74, 74, 74, 74, 72, 72, 72, 72, 72, 72, 72, 49, 48, 28, 22, 1, 1, 1, 1, 1, 1] [2021-11-23 02:50:15,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 02:50:15,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 02:50:15,595 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:50:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:50:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash -151461823, now seen corresponding path program 9 times [2021-11-23 02:50:15,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:50:15,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538390959] [2021-11-23 02:50:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:50:15,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:50:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:50:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 120943 backedges. 1539 proven. 5096 refuted. 0 times theorem prover too weak. 114308 trivial. 0 not checked. [2021-11-23 02:50:17,237 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:50:17,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538390959] [2021-11-23 02:50:17,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538390959] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:50:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652289386] [2021-11-23 02:50:17,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:50:17,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:50:17,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:50:17,242 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:50:17,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 02:50:18,029 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:50:18,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:50:18,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 3567 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 02:50:18,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:50:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 120943 backedges. 9568 proven. 32 refuted. 0 times theorem prover too weak. 111343 trivial. 0 not checked. [2021-11-23 02:50:21,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:50:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 120943 backedges. 955 proven. 6074 refuted. 0 times theorem prover too weak. 113914 trivial. 0 not checked. [2021-11-23 02:50:30,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652289386] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:50:30,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1752287480] [2021-11-23 02:50:30,991 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:50:30,991 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:50:30,993 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:50:30,994 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:50:30,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 29 [2021-11-23 02:50:30,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856342049] [2021-11-23 02:50:30,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:50:31,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-23 02:50:31,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:50:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 02:50:31,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:50:31,007 INFO L87 Difference]: Start difference. First operand 250 states and 353 transitions. Second operand has 29 states, 28 states have (on average 3.75) internal successors, (105), 29 states have internal predecessors, (105), 19 states have call successors, (32), 2 states have call predecessors, (32), 15 states have return successors, (41), 18 states have call predecessors, (41), 19 states have call successors, (41) [2021-11-23 02:50:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:50:32,266 INFO L93 Difference]: Finished difference Result 562 states and 922 transitions. [2021-11-23 02:50:32,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-23 02:50:32,267 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.75) internal successors, (105), 29 states have internal predecessors, (105), 19 states have call successors, (32), 2 states have call predecessors, (32), 15 states have return successors, (41), 18 states have call predecessors, (41), 19 states have call successors, (41) Word has length 2004 [2021-11-23 02:50:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:50:32,272 INFO L225 Difference]: With dead ends: 562 [2021-11-23 02:50:32,272 INFO L226 Difference]: Without dead ends: 276 [2021-11-23 02:50:32,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4052 GetRequests, 3998 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=420, Invalid=2442, Unknown=0, NotChecked=0, Total=2862 [2021-11-23 02:50:32,279 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 160 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:50:32,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 496 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 02:50:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-23 02:50:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 258. [2021-11-23 02:50:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 177 states have (on average 1.0451977401129944) internal successors, (185), 174 states have internal predecessors, (185), 52 states have call successors, (52), 33 states have call predecessors, (52), 28 states have return successors, (104), 50 states have call predecessors, (104), 52 states have call successors, (104) [2021-11-23 02:50:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 341 transitions. [2021-11-23 02:50:32,309 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 341 transitions. Word has length 2004 [2021-11-23 02:50:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:50:32,310 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 341 transitions. [2021-11-23 02:50:32,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.75) internal successors, (105), 29 states have internal predecessors, (105), 19 states have call successors, (32), 2 states have call predecessors, (32), 15 states have return successors, (41), 18 states have call predecessors, (41), 19 states have call successors, (41) [2021-11-23 02:50:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 341 transitions. [2021-11-23 02:50:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1711 [2021-11-23 02:50:32,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:50:32,343 INFO L514 BasicCegarLoop]: trace histogram [126, 126, 125, 125, 102, 99, 63, 63, 63, 63, 63, 63, 63, 62, 62, 62, 62, 62, 62, 62, 40, 36, 26, 24, 1, 1, 1, 1, 1, 1] [2021-11-23 02:50:32,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 02:50:32,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 02:50:32,556 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:50:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:50:32,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1143224626, now seen corresponding path program 10 times [2021-11-23 02:50:32,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:50:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345025052] [2021-11-23 02:50:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:50:32,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:50:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:50:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 87878 backedges. 1975 proven. 3654 refuted. 0 times theorem prover too weak. 82249 trivial. 0 not checked. [2021-11-23 02:50:33,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:50:33,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345025052] [2021-11-23 02:50:33,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345025052] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:50:33,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051451579] [2021-11-23 02:50:33,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:50:33,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:50:33,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:50:33,919 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:50:33,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 02:50:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:50:34,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 3823 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:50:34,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:50:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 87878 backedges. 2292 proven. 4458 refuted. 0 times theorem prover too weak. 81128 trivial. 0 not checked. [2021-11-23 02:50:37,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:50:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 87878 backedges. 2292 proven. 4510 refuted. 0 times theorem prover too weak. 81076 trivial. 0 not checked. [2021-11-23 02:50:46,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051451579] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:50:46,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1659992652] [2021-11-23 02:50:46,404 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:50:46,404 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:50:46,405 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java: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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:50:46,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:50:46,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 23] total 29 [2021-11-23 02:50:46,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321447661] [2021-11-23 02:50:46,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:50:46,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-23 02:50:46,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:50:46,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 02:50:46,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:50:46,414 INFO L87 Difference]: Start difference. First operand 258 states and 341 transitions. Second operand has 29 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 29 states have internal predecessors, (93), 22 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (37), 16 states have call predecessors, (37), 22 states have call successors, (37) [2021-11-23 02:50:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:50:46,868 INFO L93 Difference]: Finished difference Result 279 states and 365 transitions. [2021-11-23 02:50:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 02:50:46,869 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 29 states have internal predecessors, (93), 22 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (37), 16 states have call predecessors, (37), 22 states have call successors, (37) Word has length 1710 [2021-11-23 02:50:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:50:46,878 INFO L225 Difference]: With dead ends: 279 [2021-11-23 02:50:46,878 INFO L226 Difference]: Without dead ends: 261 [2021-11-23 02:50:46,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3449 GetRequests, 3410 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2021-11-23 02:50:46,880 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:50:46,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 495 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:50:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-23 02:50:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2021-11-23 02:50:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 179 states have (on average 1.0446927374301676) internal successors, (187), 176 states have internal predecessors, (187), 52 states have call successors, (52), 33 states have call predecessors, (52), 29 states have return successors, (95), 51 states have call predecessors, (95), 52 states have call successors, (95) [2021-11-23 02:50:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 334 transitions. [2021-11-23 02:50:46,908 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 334 transitions. Word has length 1710 [2021-11-23 02:50:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:50:46,910 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 334 transitions. [2021-11-23 02:50:46,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 29 states have internal predecessors, (93), 22 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (37), 16 states have call predecessors, (37), 22 states have call successors, (37) [2021-11-23 02:50:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 334 transitions. [2021-11-23 02:50:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1493 [2021-11-23 02:50:46,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:50:46,934 INFO L514 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 88, 87, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 34, 32, 22, 22, 1, 1, 1, 1, 1, 1] [2021-11-23 02:50:46,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-23 02:50:47,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 02:50:47,147 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:50:47,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:50:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1072010232, now seen corresponding path program 11 times [2021-11-23 02:50:47,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:50:47,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018080942] [2021-11-23 02:50:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:50:47,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:50:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:50:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 66757 backedges. 2934 proven. 1949 refuted. 0 times theorem prover too weak. 61874 trivial. 0 not checked. [2021-11-23 02:50:47,960 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:50:47,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018080942] [2021-11-23 02:50:47,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018080942] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:50:47,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327163066] [2021-11-23 02:50:47,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:50:47,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:50:47,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:50:47,962 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:50:47,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 02:50:48,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-23 02:50:48,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:50:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:50:48,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:50:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 66757 backedges. 11647 proven. 20 refuted. 0 times theorem prover too weak. 55090 trivial. 0 not checked. [2021-11-23 02:50:50,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:50:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 66757 backedges. 3284 proven. 209 refuted. 0 times theorem prover too weak. 63264 trivial. 0 not checked. [2021-11-23 02:50:56,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327163066] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:50:56,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1950087999] [2021-11-23 02:50:56,021 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:50:56,021 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:50:56,021 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-23 02:50:56,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:50:56,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 26 [2021-11-23 02:50:56,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652053739] [2021-11-23 02:50:56,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:50:56,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-23 02:50:56,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:50:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-23 02:50:56,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-11-23 02:50:56,030 INFO L87 Difference]: Start difference. First operand 261 states and 334 transitions. Second operand has 26 states, 25 states have (on average 3.76) internal successors, (94), 26 states have internal predecessors, (94), 16 states have call successors, (28), 2 states have call predecessors, (28), 13 states have return successors, (38), 16 states have call predecessors, (38), 16 states have call successors, (38) [2021-11-23 02:50:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:50:56,928 INFO L93 Difference]: Finished difference Result 511 states and 669 transitions. [2021-11-23 02:50:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-23 02:50:56,929 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.76) internal successors, (94), 26 states have internal predecessors, (94), 16 states have call successors, (28), 2 states have call predecessors, (28), 13 states have return successors, (38), 16 states have call predecessors, (38), 16 states have call successors, (38) Word has length 1492 [2021-11-23 02:50:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:50:56,936 INFO L225 Difference]: With dead ends: 511 [2021-11-23 02:50:56,936 INFO L226 Difference]: Without dead ends: 257 [2021-11-23 02:50:56,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3020 GetRequests, 2979 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2021-11-23 02:50:56,940 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 84 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:50:56,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 562 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:50:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-11-23 02:50:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2021-11-23 02:50:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 167 states have (on average 1.0479041916167664) internal successors, (175), 164 states have internal predecessors, (175), 48 states have call successors, (48), 34 states have call predecessors, (48), 24 states have return successors, (64), 41 states have call predecessors, (64), 48 states have call successors, (64) [2021-11-23 02:50:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 287 transitions. [2021-11-23 02:50:56,963 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 287 transitions. Word has length 1492 [2021-11-23 02:50:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:50:56,964 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 287 transitions. [2021-11-23 02:50:56,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.76) internal successors, (94), 26 states have internal predecessors, (94), 16 states have call successors, (28), 2 states have call predecessors, (28), 13 states have return successors, (38), 16 states have call predecessors, (38), 16 states have call successors, (38) [2021-11-23 02:50:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 287 transitions. [2021-11-23 02:50:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2021-11-23 02:50:56,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:50:56,982 INFO L514 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2021-11-23 02:50:57,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:50:57,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:50:57,207 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:50:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:50:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash 529873829, now seen corresponding path program 12 times [2021-11-23 02:50:57,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:50:57,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293453379] [2021-11-23 02:50:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:50:57,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:50:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:50:57,551 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 02:50:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:50:58,317 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-23 02:50:58,318 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 02:50:58,319 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 02:50:58,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 02:50:58,325 INFO L732 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:50:58,333 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 02:50:58,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:50:58 BoogieIcfgContainer [2021-11-23 02:50:58,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 02:50:58,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 02:50:58,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 02:50:58,623 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 02:50:58,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:14" (3/4) ... [2021-11-23 02:50:58,625 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 02:50:58,880 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 02:50:58,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 02:50:58,881 INFO L158 Benchmark]: Toolchain (without parser) took 105205.66ms. Allocated memory was 86.0MB in the beginning and 708.8MB in the end (delta: 622.9MB). Free memory was 49.9MB in the beginning and 514.8MB in the end (delta: -464.8MB). Peak memory consumption was 157.1MB. Max. memory is 16.1GB. [2021-11-23 02:50:58,881 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 86.0MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:50:58,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.90ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 49.7MB in the beginning and 111.5MB in the end (delta: -61.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2021-11-23 02:50:58,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.41ms. Allocated memory is still 134.2MB. Free memory was 111.5MB in the beginning and 110.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:50:58,887 INFO L158 Benchmark]: Boogie Preprocessor took 23.78ms. Allocated memory is still 134.2MB. Free memory was 110.1MB in the beginning and 109.2MB in the end (delta: 915.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:50:58,891 INFO L158 Benchmark]: RCFGBuilder took 456.05ms. Allocated memory is still 134.2MB. Free memory was 109.2MB in the beginning and 98.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 02:50:58,891 INFO L158 Benchmark]: TraceAbstraction took 104088.12ms. Allocated memory was 134.2MB in the beginning and 708.8MB in the end (delta: 574.6MB). Free memory was 98.1MB in the beginning and 543.1MB in the end (delta: -445.0MB). Peak memory consumption was 432.7MB. Max. memory is 16.1GB. [2021-11-23 02:50:58,892 INFO L158 Benchmark]: Witness Printer took 258.20ms. Allocated memory is still 708.8MB. Free memory was 543.1MB in the beginning and 514.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-23 02:50:58,894 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.37ms. Allocated memory is still 86.0MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.90ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 49.7MB in the beginning and 111.5MB in the end (delta: -61.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.41ms. Allocated memory is still 134.2MB. Free memory was 111.5MB in the beginning and 110.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.78ms. Allocated memory is still 134.2MB. Free memory was 110.1MB in the beginning and 109.2MB in the end (delta: 915.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 456.05ms. Allocated memory is still 134.2MB. Free memory was 109.2MB in the beginning and 98.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 104088.12ms. Allocated memory was 134.2MB in the beginning and 708.8MB in the end (delta: 574.6MB). Free memory was 98.1MB in the beginning and 543.1MB in the end (delta: -445.0MB). Peak memory consumption was 432.7MB. Max. memory is 16.1GB. * Witness Printer took 258.20ms. Allocated memory is still 708.8MB. Free memory was 543.1MB in the beginning and 514.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. 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 = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) 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); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) 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-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [result=55, x=10] [L41] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 103.7s, OverallIterations: 20, TraceHistogramMax: 148, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.3s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1687 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1608 mSDsluCounter, 5583 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5195 mSDsCounter, 1909 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9410 IncrementalHoareTripleChecker+Invalid, 11319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1909 mSolverCounterUnsat, 582 mSDtfsCounter, 9410 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19945 GetRequests, 19323 SyntacticMatches, 30 SemanticMatches, 592 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=18, InterpolantAutomatonStates: 376, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 278 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 76.3s InterpolantComputationTime, 20667 NumberOfCodeBlocks, 16879 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 29126 ConstructedInterpolants, 0 QuantifiedInterpolants, 34234 SizeOfPredicates, 89 NumberOfNonLiveVariables, 13237 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 53 InterpolantComputations, 2 PerfectInterpolantSequences, 1099485/1144731 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.3s, 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.1s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME: 0.2s, 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.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, 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! [2021-11-23 02:50:58,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a9ba4c-f19b-440f-b944-0a272b09737d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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