./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan --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 18ab16c8226f43cf595901df83a1f895912e466b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-03 12:30:36,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 12:30:36,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 12:30:36,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 12:30:36,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 12:30:36,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 12:30:36,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 12:30:36,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 12:30:36,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 12:30:36,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 12:30:36,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 12:30:36,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 12:30:36,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 12:30:36,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 12:30:36,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 12:30:36,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 12:30:36,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 12:30:36,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 12:30:36,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 12:30:36,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 12:30:36,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 12:30:36,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 12:30:36,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 12:30:36,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 12:30:36,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 12:30:36,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 12:30:36,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 12:30:36,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 12:30:36,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 12:30:36,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 12:30:36,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 12:30:36,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 12:30:36,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 12:30:36,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 12:30:36,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 12:30:36,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 12:30:36,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 12:30:36,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 12:30:36,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 12:30:36,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 12:30:36,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 12:30:36,770 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-03 12:30:36,812 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 12:30:36,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 12:30:36,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-03 12:30:36,814 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-03 12:30:36,815 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-03 12:30:36,815 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-03 12:30:36,815 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-03 12:30:36,815 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-03 12:30:36,816 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-03 12:30:36,816 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-03 12:30:36,817 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-03 12:30:36,818 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-03 12:30:36,818 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-03 12:30:36,818 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-03 12:30:36,818 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-03 12:30:36,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 12:30:36,819 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 12:30:36,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 12:30:36,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 12:30:36,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 12:30:36,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 12:30:36,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 12:30:36,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 12:30:36,821 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-03 12:30:36,821 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 12:30:36,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 12:30:36,822 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 12:30:36,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 12:30:36,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 12:30:36,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 12:30:36,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 12:30:36,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 12:30:36,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 12:30:36,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 12:30:36,824 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-03 12:30:36,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 12:30:36,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 12:30:36,825 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 12:30:36,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 12:30:36,826 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-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/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-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan 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 -> 18ab16c8226f43cf595901df83a1f895912e466b [2020-12-03 12:30:37,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 12:30:37,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 12:30:37,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 12:30:37,134 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 12:30:37,135 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 12:30:37,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci05.c [2020-12-03 12:30:37,220 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/data/f1d1f421b/14c93dc75752406c9aac350372827a45/FLAGd353c4338 [2020-12-03 12:30:37,674 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 12:30:37,675 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/sv-benchmarks/c/recursive/Fibonacci05.c [2020-12-03 12:30:37,682 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/data/f1d1f421b/14c93dc75752406c9aac350372827a45/FLAGd353c4338 [2020-12-03 12:30:38,056 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/data/f1d1f421b/14c93dc75752406c9aac350372827a45 [2020-12-03 12:30:38,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 12:30:38,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 12:30:38,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 12:30:38,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 12:30:38,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 12:30:38,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63734487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38, skipping insertion in model container [2020-12-03 12:30:38,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 12:30:38,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 12:30:38,263 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2020-12-03 12:30:38,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 12:30:38,277 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 12:30:38,300 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2020-12-03 12:30:38,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 12:30:38,315 INFO L208 MainTranslator]: Completed translation [2020-12-03 12:30:38,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38 WrapperNode [2020-12-03 12:30:38,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 12:30:38,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 12:30:38,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 12:30:38,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 12:30:38,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 12:30:38,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 12:30:38,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 12:30:38,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 12:30:38,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... [2020-12-03 12:30:38,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 12:30:38,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 12:30:38,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 12:30:38,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 12:30:38,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 12:30:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-12-03 12:30:38,508 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-12-03 12:30:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 12:30:38,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 12:30:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 12:30:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 12:30:38,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 12:30:38,784 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-03 12:30:38,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:30:38 BoogieIcfgContainer [2020-12-03 12:30:38,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 12:30:38,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 12:30:38,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 12:30:38,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 12:30:38,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:30:38" (1/3) ... [2020-12-03 12:30:38,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540f2ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:30:38, skipping insertion in model container [2020-12-03 12:30:38,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:38" (2/3) ... [2020-12-03 12:30:38,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540f2ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:30:38, skipping insertion in model container [2020-12-03 12:30:38,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:30:38" (3/3) ... [2020-12-03 12:30:38,802 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-12-03 12:30:38,815 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 12:30:38,819 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 12:30:38,827 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 12:30:38,848 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 12:30:38,849 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 12:30:38,849 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 12:30:38,849 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 12:30:38,849 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 12:30:38,849 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 12:30:38,849 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 12:30:38,850 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 12:30:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-12-03 12:30:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-03 12:30:38,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:38,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:38,871 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:30:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2020-12-03 12:30:38,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:38,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005621427] [2020-12-03 12:30:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:30:39,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005621427] [2020-12-03 12:30:39,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:30:39,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:30:39,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587895244] [2020-12-03 12:30:39,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 12:30:39,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:39,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 12:30:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-03 12:30:39,110 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2020-12-03 12:30:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:39,234 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-12-03 12:30:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 12:30:39,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-03 12:30:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:39,245 INFO L225 Difference]: With dead ends: 27 [2020-12-03 12:30:39,259 INFO L226 Difference]: Without dead ends: 17 [2020-12-03 12:30:39,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:30:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-03 12:30:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-03 12:30:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-03 12:30:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-12-03 12:30:39,316 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2020-12-03 12:30:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:39,335 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-12-03 12:30:39,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 12:30:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-12-03 12:30:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-03 12:30:39,337 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:39,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:39,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 12:30:39,338 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:30:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2020-12-03 12:30:39,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:39,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648435910] [2020-12-03 12:30:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:30:39,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648435910] [2020-12-03 12:30:39,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:30:39,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:30:39,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711686621] [2020-12-03 12:30:39,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 12:30:39,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 12:30:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-03 12:30:39,457 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2020-12-03 12:30:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:39,531 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-12-03 12:30:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 12:30:39,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-03 12:30:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:39,534 INFO L225 Difference]: With dead ends: 23 [2020-12-03 12:30:39,535 INFO L226 Difference]: Without dead ends: 19 [2020-12-03 12:30:39,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:30:39,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-03 12:30:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-12-03 12:30:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-03 12:30:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-12-03 12:30:39,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2020-12-03 12:30:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:39,552 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-12-03 12:30:39,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 12:30:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-12-03 12:30:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 12:30:39,556 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:39,556 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:39,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 12:30:39,557 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:30:39,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2020-12-03 12:30:39,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:39,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279144064] [2020-12-03 12:30:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-03 12:30:39,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279144064] [2020-12-03 12:30:39,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094238184] [2020-12-03 12:30:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:39,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-03 12:30:39,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:30:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-03 12:30:39,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:30:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-03 12:30:40,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [116645800] [2020-12-03 12:30:40,219 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-03 12:30:40,219 INFO L166 IcfgInterpreter]: Building call graph [2020-12-03 12:30:40,225 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:30:40,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:30:40,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2020-12-03 12:30:40,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301465185] [2020-12-03 12:30:40,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 12:30:40,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 12:30:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-03 12:30:40,231 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 12 states. [2020-12-03 12:30:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:40,401 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2020-12-03 12:30:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 12:30:40,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-03 12:30:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:40,403 INFO L225 Difference]: With dead ends: 41 [2020-12-03 12:30:40,404 INFO L226 Difference]: Without dead ends: 24 [2020-12-03 12:30:40,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-12-03 12:30:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-03 12:30:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-03 12:30:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-03 12:30:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-12-03 12:30:40,414 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 22 [2020-12-03 12:30:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:40,415 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-12-03 12:30:40,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 12:30:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2020-12-03 12:30:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-03 12:30:40,418 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:40,419 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:40,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-03 12:30:40,637 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:30:40,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1569737296, now seen corresponding path program 1 times [2020-12-03 12:30:40,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:40,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683203700] [2020-12-03 12:30:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-12-03 12:30:40,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683203700] [2020-12-03 12:30:40,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406867965] [2020-12-03 12:30:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:40,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-03 12:30:40,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:30:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-12-03 12:30:41,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:30:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2020-12-03 12:30:41,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [842801687] [2020-12-03 12:30:41,536 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-03 12:30:41,536 INFO L166 IcfgInterpreter]: Building call graph [2020-12-03 12:30:41,538 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:30:41,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:30:41,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2020-12-03 12:30:41,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39436172] [2020-12-03 12:30:41,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 12:30:41,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 12:30:41,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-03 12:30:41,548 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 12 states. [2020-12-03 12:30:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:41,762 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. [2020-12-03 12:30:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 12:30:41,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-12-03 12:30:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:41,771 INFO L225 Difference]: With dead ends: 43 [2020-12-03 12:30:41,771 INFO L226 Difference]: Without dead ends: 37 [2020-12-03 12:30:41,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-12-03 12:30:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-03 12:30:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-12-03 12:30:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-03 12:30:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2020-12-03 12:30:41,795 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 63 [2020-12-03 12:30:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:41,796 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2020-12-03 12:30:41,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 12:30:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2020-12-03 12:30:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-03 12:30:41,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:41,803 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 15, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:42,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:42,025 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:30:42,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1262865289, now seen corresponding path program 2 times [2020-12-03 12:30:42,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:42,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420001038] [2020-12-03 12:30:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2020-12-03 12:30:42,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420001038] [2020-12-03 12:30:42,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779932889] [2020-12-03 12:30:42,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:42,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-03 12:30:42,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:30:42,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-03 12:30:42,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:30:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 383 proven. 12 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2020-12-03 12:30:42,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:30:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 383 proven. 14 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2020-12-03 12:30:43,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1680512022] [2020-12-03 12:30:43,649 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-03 12:30:43,650 INFO L166 IcfgInterpreter]: Building call graph [2020-12-03 12:30:43,655 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:30:43,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:30:43,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2020-12-03 12:30:43,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605364536] [2020-12-03 12:30:43,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-03 12:30:43,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:43,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-03 12:30:43,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-12-03 12:30:43,659 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand 17 states. [2020-12-03 12:30:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:44,232 INFO L93 Difference]: Finished difference Result 86 states and 173 transitions. [2020-12-03 12:30:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-03 12:30:44,233 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 156 [2020-12-03 12:30:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:44,235 INFO L225 Difference]: With dead ends: 86 [2020-12-03 12:30:44,235 INFO L226 Difference]: Without dead ends: 54 [2020-12-03 12:30:44,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2020-12-03 12:30:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-03 12:30:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-12-03 12:30:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-03 12:30:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2020-12-03 12:30:44,250 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 156 [2020-12-03 12:30:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:44,250 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-12-03 12:30:44,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-03 12:30:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2020-12-03 12:30:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-12-03 12:30:44,254 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:44,254 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:44,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:44,455 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:30:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash -101084946, now seen corresponding path program 3 times [2020-12-03 12:30:44,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:44,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577080967] [2020-12-03 12:30:44,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2020-12-03 12:30:44,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577080967] [2020-12-03 12:30:44,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440069109] [2020-12-03 12:30:44,759 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:44,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-03 12:30:44,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:30:44,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-03 12:30:44,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:30:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 453 proven. 734 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2020-12-03 12:30:45,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:30:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 453 proven. 782 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2020-12-03 12:30:48,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [712150684] [2020-12-03 12:30:48,084 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-03 12:30:48,085 INFO L166 IcfgInterpreter]: Building call graph [2020-12-03 12:30:48,085 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:30:48,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:30:48,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 23] total 27 [2020-12-03 12:30:48,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728069921] [2020-12-03 12:30:48,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-03 12:30:48,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-03 12:30:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2020-12-03 12:30:48,091 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand 27 states. [2020-12-03 12:30:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:48,992 INFO L93 Difference]: Finished difference Result 133 states and 224 transitions. [2020-12-03 12:30:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-03 12:30:48,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 200 [2020-12-03 12:30:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:48,995 INFO L225 Difference]: With dead ends: 133 [2020-12-03 12:30:48,996 INFO L226 Difference]: Without dead ends: 81 [2020-12-03 12:30:49,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 386 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=564, Invalid=1692, Unknown=0, NotChecked=0, Total=2256 [2020-12-03 12:30:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-12-03 12:30:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2020-12-03 12:30:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-03 12:30:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2020-12-03 12:30:49,013 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 200 [2020-12-03 12:30:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:49,014 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2020-12-03 12:30:49,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-03 12:30:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2020-12-03 12:30:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2020-12-03 12:30:49,021 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:49,021 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:49,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:49,237 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:30:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1319465805, now seen corresponding path program 4 times [2020-12-03 12:30:49,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:49,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556520667] [2020-12-03 12:30:49,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2020-12-03 12:30:49,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556520667] [2020-12-03 12:30:49,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819013220] [2020-12-03 12:30:49,613 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:49,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-03 12:30:49,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:30:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2020-12-03 12:30:50,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:30:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1405 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2020-12-03 12:30:52,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1174793932] [2020-12-03 12:30:52,856 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-03 12:30:52,856 INFO L166 IcfgInterpreter]: Building call graph [2020-12-03 12:30:52,871 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:30:52,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:30:52,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 18 [2020-12-03 12:30:52,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661036789] [2020-12-03 12:30:52,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-03 12:30:52,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-03 12:30:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-12-03 12:30:52,874 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand 18 states. [2020-12-03 12:30:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:53,175 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2020-12-03 12:30:53,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 12:30:53,176 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 323 [2020-12-03 12:30:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:53,187 INFO L225 Difference]: With dead ends: 86 [2020-12-03 12:30:53,188 INFO L226 Difference]: Without dead ends: 82 [2020-12-03 12:30:53,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-12-03 12:30:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-03 12:30:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-12-03 12:30:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-03 12:30:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2020-12-03 12:30:53,220 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 323 [2020-12-03 12:30:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:53,222 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2020-12-03 12:30:53,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-03 12:30:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2020-12-03 12:30:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2020-12-03 12:30:53,242 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:53,243 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:53,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-03 12:30:53,469 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:30:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash -966626089, now seen corresponding path program 5 times [2020-12-03 12:30:53,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:53,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133470684] [2020-12-03 12:30:53,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2020-12-03 12:30:54,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133470684] [2020-12-03 12:30:54,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126116885] [2020-12-03 12:30:54,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:30:54,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2020-12-03 12:30:54,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:30:54,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-03 12:30:54,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:30:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1784 proven. 2884 refuted. 0 times theorem prover too weak. 14435 trivial. 0 not checked. [2020-12-03 12:30:55,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:31:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1784 proven. 2959 refuted. 0 times theorem prover too weak. 14360 trivial. 0 not checked. [2020-12-03 12:31:00,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1947775528] [2020-12-03 12:31:00,059 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-03 12:31:00,061 INFO L166 IcfgInterpreter]: Building call graph [2020-12-03 12:31:00,062 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:31:00,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:31:00,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 25] total 33 [2020-12-03 12:31:00,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178807464] [2020-12-03 12:31:00,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-03 12:31:00,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:00,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-03 12:31:00,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2020-12-03 12:31:00,067 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand 33 states. [2020-12-03 12:31:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:01,484 INFO L93 Difference]: Finished difference Result 211 states and 397 transitions. [2020-12-03 12:31:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-03 12:31:01,485 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 568 [2020-12-03 12:31:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:01,488 INFO L225 Difference]: With dead ends: 211 [2020-12-03 12:31:01,488 INFO L226 Difference]: Without dead ends: 133 [2020-12-03 12:31:01,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1194 GetRequests, 1130 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=971, Invalid=3061, Unknown=0, NotChecked=0, Total=4032 [2020-12-03 12:31:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-03 12:31:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 108. [2020-12-03 12:31:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-03 12:31:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 152 transitions. [2020-12-03 12:31:01,509 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 152 transitions. Word has length 568 [2020-12-03 12:31:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:01,511 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 152 transitions. [2020-12-03 12:31:01,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-03 12:31:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 152 transitions. [2020-12-03 12:31:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2020-12-03 12:31:01,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:01,515 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2020-12-03 12:31:01,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:31:01,716 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:31:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2068824531, now seen corresponding path program 6 times [2020-12-03 12:31:01,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:01,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897043250] [2020-12-03 12:31:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 12:31:01,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 12:31:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 12:31:01,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 12:31:02,115 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-03 12:31:02,115 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 12:31:02,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-03 12:31:02,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:31:02 BoogieIcfgContainer [2020-12-03 12:31:02,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 12:31:02,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 12:31:02,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 12:31:02,326 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 12:31:02,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:30:38" (3/4) ... [2020-12-03 12:31:02,330 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-03 12:31:02,500 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c272552a-54b8-46e0-99fa-b7eb8e79af0a/bin/utaipan/witness.graphml [2020-12-03 12:31:02,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 12:31:02,502 INFO L168 Benchmark]: Toolchain (without parser) took 24441.27 ms. Allocated memory was 90.2 MB in the beginning and 585.1 MB in the end (delta: 494.9 MB). Free memory was 56.6 MB in the beginning and 428.6 MB in the end (delta: -372.0 MB). Peak memory consumption was 121.8 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:02,502 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 90.2 MB. Free memory was 60.6 MB in the beginning and 60.6 MB in the end (delta: 25.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 12:31:02,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.57 ms. Allocated memory is still 90.2 MB. Free memory was 56.5 MB in the beginning and 67.5 MB in the end (delta: -11.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:02,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.43 ms. Allocated memory is still 90.2 MB. Free memory was 67.5 MB in the beginning and 66.4 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 12:31:02,503 INFO L168 Benchmark]: Boogie Preprocessor took 43.73 ms. Allocated memory is still 90.2 MB. Free memory was 66.4 MB in the beginning and 65.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:02,504 INFO L168 Benchmark]: RCFGBuilder took 383.61 ms. Allocated memory is still 90.2 MB. Free memory was 65.3 MB in the beginning and 52.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:02,504 INFO L168 Benchmark]: TraceAbstraction took 23536.22 ms. Allocated memory was 90.2 MB in the beginning and 585.1 MB in the end (delta: 494.9 MB). Free memory was 51.7 MB in the beginning and 448.5 MB in the end (delta: -396.8 MB). Peak memory consumption was 101.3 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:02,505 INFO L168 Benchmark]: Witness Printer took 174.62 ms. Allocated memory is still 585.1 MB. Free memory was 448.5 MB in the beginning and 428.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:02,507 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.21 ms. Allocated memory is still 90.2 MB. Free memory was 60.6 MB in the beginning and 60.6 MB in the end (delta: 25.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 254.57 ms. Allocated memory is still 90.2 MB. Free memory was 56.5 MB in the beginning and 67.5 MB in the end (delta: -11.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.43 ms. Allocated memory is still 90.2 MB. Free memory was 67.5 MB in the beginning and 66.4 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.73 ms. Allocated memory is still 90.2 MB. Free memory was 66.4 MB in the beginning and 65.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 383.61 ms. Allocated memory is still 90.2 MB. Free memory was 65.3 MB in the beginning and 52.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23536.22 ms. Allocated memory was 90.2 MB in the beginning and 585.1 MB in the end (delta: 494.9 MB). Free memory was 51.7 MB in the beginning and 448.5 MB in the end (delta: -396.8 MB). Peak memory consumption was 101.3 MB. Max. memory is 16.1 GB. * Witness Printer took 174.62 ms. Allocated memory is still 585.1 MB. Free memory was 448.5 MB in the beginning and 428.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.2s, OverallIterations: 9, TraceHistogramMax: 83, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 140 SDtfs, 891 SDslu, 555 SDs, 0 SdLazy, 1555 SolverSat, 1123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2841 GetRequests, 2634 SyntacticMatches, 8 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 3142 NumberOfCodeBlocks, 2746 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3995 ConstructedInterpolants, 0 QuantifiedInterpolants, 2134051 SizeOfPredicates, 45 NumberOfNonLiveVariables, 2217 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 70456/86745 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: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...