./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99889f5d790024002a8c8a36b020b427b7a21ac2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-a4ecdab [2020-11-30 00:18:34,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:18:34,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:18:34,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:18:34,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:18:34,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:18:34,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:18:34,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:18:34,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:18:34,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:18:34,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:18:34,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:18:34,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:18:34,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:18:34,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:18:34,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:18:34,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:18:34,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:18:34,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:18:34,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:18:34,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:18:34,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:18:34,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:18:34,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:18:34,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:18:34,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:18:34,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:18:34,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:18:34,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:18:34,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:18:34,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:18:34,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:18:34,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:18:34,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:18:34,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:18:34,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:18:34,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:18:34,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:18:34,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:18:34,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:18:34,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:18:34,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-30 00:18:34,995 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:18:34,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:18:34,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 00:18:34,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-30 00:18:34,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:18:34,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:18:34,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:18:34,999 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:18:35,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:18:35,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:18:35,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:18:35,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:18:35,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:18:35,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:18:35,003 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:18:35,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:18:35,003 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:18:35,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:18:35,004 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-30 00:18:35,004 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-30 00:18:35,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:18:35,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:18:35,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-30 00:18:35,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:18:35,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:18:35,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:18:35,007 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-30 00:18:35,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:18:35,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:18:35,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/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_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak 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 -> Kojak 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 -> 99889f5d790024002a8c8a36b020b427b7a21ac2 [2020-11-30 00:18:35,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:18:35,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:18:35,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:18:35,443 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:18:35,444 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:18:35,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2020-11-30 00:18:35,551 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/data/db35c56ff/baec49e88cc84e8fa3819c2747f1ae50/FLAG3f0dbd6f7 [2020-11-30 00:18:36,243 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:18:36,244 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2020-11-30 00:18:36,258 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/data/db35c56ff/baec49e88cc84e8fa3819c2747f1ae50/FLAG3f0dbd6f7 [2020-11-30 00:18:36,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/data/db35c56ff/baec49e88cc84e8fa3819c2747f1ae50 [2020-11-30 00:18:36,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:18:36,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:18:36,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:18:36,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:18:36,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:18:36,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:36,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e0d9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36, skipping insertion in model container [2020-11-30 00:18:36,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:36,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:18:36,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:18:36,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:18:36,935 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:18:36,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:18:36,987 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:18:36,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36 WrapperNode [2020-11-30 00:18:36,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:18:36,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:18:36,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:18:36,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:18:37,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:18:37,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:18:37,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:18:37,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:18:37,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... [2020-11-30 00:18:37,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:18:37,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:18:37,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:18:37,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:18:37,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2020-11-30 00:18:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:18:37,190 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-30 00:18:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-30 00:18:37,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:18:37,192 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-30 00:18:37,192 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-30 00:18:37,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:18:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:18:37,752 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:18:37,752 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 00:18:37,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:18:37 BoogieIcfgContainer [2020-11-30 00:18:37,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:18:37,756 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-30 00:18:37,756 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-30 00:18:37,769 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-30 00:18:37,770 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:18:37" (1/1) ... [2020-11-30 00:18:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:18:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2020-11-30 00:18:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-11-30 00:18:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:18:37,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:38,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-11-30 00:18:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 30 states and 39 transitions. [2020-11-30 00:18:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-11-30 00:18:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:18:38,235 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:18:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2020-11-30 00:18:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2020-11-30 00:18:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 00:18:38,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:18:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 36 states and 50 transitions. [2020-11-30 00:18:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2020-11-30 00:18:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:18:39,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:18:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 66 transitions. [2020-11-30 00:18:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2020-11-30 00:18:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 00:18:40,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 00:18:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 45 states and 69 transitions. [2020-11-30 00:18:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2020-11-30 00:18:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 00:18:41,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-30 00:18:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 45 states and 66 transitions. [2020-11-30 00:18:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2020-11-30 00:18:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 00:18:43,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 00:18:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 57 states and 102 transitions. [2020-11-30 00:18:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 102 transitions. [2020-11-30 00:18:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-30 00:18:45,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 00:18:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 57 states and 101 transitions. [2020-11-30 00:18:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2020-11-30 00:18:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-30 00:18:46,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 00:18:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 62 states and 110 transitions. [2020-11-30 00:18:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 110 transitions. [2020-11-30 00:18:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-30 00:18:49,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-11-30 00:18:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 74 states and 147 transitions. [2020-11-30 00:18:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 147 transitions. [2020-11-30 00:18:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-30 00:18:52,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 98 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2020-11-30 00:18:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 76 states and 151 transitions. [2020-11-30 00:18:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 151 transitions. [2020-11-30 00:18:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2020-11-30 00:18:52,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 59 proven. 341 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2020-11-30 00:18:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 86 states and 188 transitions. [2020-11-30 00:18:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 188 transitions. [2020-11-30 00:18:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-11-30 00:18:55,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 44 proven. 193 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2020-11-30 00:18:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 88 states and 193 transitions. [2020-11-30 00:18:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 193 transitions. [2020-11-30 00:18:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-30 00:18:56,696 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 36 proven. 151 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2020-11-30 00:18:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:18:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 90 states and 198 transitions. [2020-11-30 00:18:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 198 transitions. [2020-11-30 00:18:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-30 00:18:57,504 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:18:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:18:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 187 proven. 228 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2020-11-30 00:19:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 92 states and 199 transitions. [2020-11-30 00:19:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 199 transitions. [2020-11-30 00:19:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-11-30 00:19:00,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 82 proven. 493 refuted. 0 times theorem prover too weak. 1670 trivial. 0 not checked. [2020-11-30 00:19:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 102 states and 238 transitions. [2020-11-30 00:19:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 238 transitions. [2020-11-30 00:19:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-11-30 00:19:03,711 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 66 proven. 401 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2020-11-30 00:19:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 104 states and 244 transitions. [2020-11-30 00:19:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 244 transitions. [2020-11-30 00:19:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2020-11-30 00:19:04,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 88 proven. 588 refuted. 0 times theorem prover too weak. 2319 trivial. 0 not checked. [2020-11-30 00:19:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 106 states and 250 transitions. [2020-11-30 00:19:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 250 transitions. [2020-11-30 00:19:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2020-11-30 00:19:05,505 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5771 backedges. 572 proven. 812 refuted. 0 times theorem prover too weak. 4387 trivial. 0 not checked. [2020-11-30 00:19:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 106 states and 249 transitions. [2020-11-30 00:19:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 249 transitions. [2020-11-30 00:19:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2020-11-30 00:19:07,300 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 39269 backedges. 407 proven. 2677 refuted. 0 times theorem prover too weak. 36185 trivial. 0 not checked. [2020-11-30 00:19:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 118 states and 298 transitions. [2020-11-30 00:19:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 298 transitions. [2020-11-30 00:19:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2020-11-30 00:19:12,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 22467 backedges. 309 proven. 2023 refuted. 0 times theorem prover too weak. 20135 trivial. 0 not checked. [2020-11-30 00:19:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 120 states and 305 transitions. [2020-11-30 00:19:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 305 transitions. [2020-11-30 00:19:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2020-11-30 00:19:14,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 19723 backedges. 318 proven. 2161 refuted. 0 times theorem prover too weak. 17244 trivial. 0 not checked. [2020-11-30 00:19:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 132 states and 359 transitions. [2020-11-30 00:19:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 359 transitions. [2020-11-30 00:19:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2020-11-30 00:19:19,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 35191 backedges. 396 proven. 2939 refuted. 0 times theorem prover too weak. 31856 trivial. 0 not checked. [2020-11-30 00:19:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 134 states and 367 transitions. [2020-11-30 00:19:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 367 transitions. [2020-11-30 00:19:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2020-11-30 00:19:21,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 44771 backedges. 582 proven. 2758 refuted. 0 times theorem prover too weak. 41431 trivial. 0 not checked. [2020-11-30 00:19:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 134 states and 366 transitions. [2020-11-30 00:19:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 366 transitions. [2020-11-30 00:19:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2020-11-30 00:19:24,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 31082 backedges. 773 proven. 2761 refuted. 0 times theorem prover too weak. 27548 trivial. 0 not checked. [2020-11-30 00:19:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 136 states and 368 transitions. [2020-11-30 00:19:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 368 transitions. [2020-11-30 00:19:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1523 [2020-11-30 00:19:26,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 69930 backedges. 3111 proven. 4408 refuted. 0 times theorem prover too weak. 62411 trivial. 0 not checked. [2020-11-30 00:19:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 136 states and 366 transitions. [2020-11-30 00:19:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 366 transitions. [2020-11-30 00:19:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2020-11-30 00:19:31,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 32718 backedges. 520 proven. 3117 refuted. 0 times theorem prover too weak. 29081 trivial. 0 not checked. [2020-11-30 00:19:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 146 states and 414 transitions. [2020-11-30 00:19:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 414 transitions. [2020-11-30 00:19:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2501 [2020-11-30 00:19:36,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 189675 backedges. 1074 proven. 7962 refuted. 0 times theorem prover too weak. 180639 trivial. 0 not checked. [2020-11-30 00:19:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 148 states and 423 transitions. [2020-11-30 00:19:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 423 transitions. [2020-11-30 00:19:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1523 [2020-11-30 00:19:43,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 69930 backedges. 804 proven. 4604 refuted. 0 times theorem prover too weak. 64522 trivial. 0 not checked. [2020-11-30 00:19:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 150 states and 432 transitions. [2020-11-30 00:19:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 432 transitions. [2020-11-30 00:19:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2177 [2020-11-30 00:19:46,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:19:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 143637 backedges. 1424 proven. 6692 refuted. 0 times theorem prover too weak. 135521 trivial. 0 not checked. [2020-11-30 00:19:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:19:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 151 states and 388 transitions. [2020-11-30 00:19:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 388 transitions. [2020-11-30 00:19:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2177 [2020-11-30 00:19:59,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:19:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 143637 backedges. 1213 proven. 6899 refuted. 0 times theorem prover too weak. 135525 trivial. 0 not checked. [2020-11-30 00:20:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 153 states and 376 transitions. [2020-11-30 00:20:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 376 transitions. [2020-11-30 00:20:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2020-11-30 00:20:06,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 93822 backedges. 1474 proven. 5048 refuted. 0 times theorem prover too weak. 87300 trivial. 0 not checked. [2020-11-30 00:20:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 155 states and 364 transitions. [2020-11-30 00:20:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 364 transitions. [2020-11-30 00:20:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1427 [2020-11-30 00:20:12,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 60942 backedges. 3178 proven. 714 refuted. 0 times theorem prover too weak. 57050 trivial. 0 not checked. [2020-11-30 00:20:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 155 states and 363 transitions. [2020-11-30 00:20:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 363 transitions. [2020-11-30 00:20:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1725 [2020-11-30 00:20:14,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 89335 backedges. 893 proven. 5472 refuted. 0 times theorem prover too weak. 82970 trivial. 0 not checked. [2020-11-30 00:20:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 155 states and 343 transitions. [2020-11-30 00:20:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2020-11-30 00:20:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1931 [2020-11-30 00:20:19,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 112122 backedges. 1529 proven. 4850 refuted. 0 times theorem prover too weak. 105743 trivial. 0 not checked. [2020-11-30 00:20:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 155 states and 339 transitions. [2020-11-30 00:20:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 339 transitions. [2020-11-30 00:20:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2285 [2020-11-30 00:20:23,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 157375 backedges. 1598 proven. 5054 refuted. 0 times theorem prover too weak. 150723 trivial. 0 not checked. [2020-11-30 00:20:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 155 states and 322 transitions. [2020-11-30 00:20:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 322 transitions. [2020-11-30 00:20:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1577 [2020-11-30 00:20:29,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 74553 backedges. 1037 proven. 3291 refuted. 0 times theorem prover too weak. 70225 trivial. 0 not checked. [2020-11-30 00:20:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 155 states and 321 transitions. [2020-11-30 00:20:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 321 transitions. [2020-11-30 00:20:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1849 [2020-11-30 00:20:32,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 1996 proven. 4105 refuted. 0 times theorem prover too weak. 96668 trivial. 0 not checked. [2020-11-30 00:20:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 155 states and 313 transitions. [2020-11-30 00:20:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 313 transitions. [2020-11-30 00:20:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1849 [2020-11-30 00:20:37,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 2088 proven. 3264 refuted. 0 times theorem prover too weak. 97417 trivial. 0 not checked. [2020-11-30 00:20:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 155 states and 308 transitions. [2020-11-30 00:20:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 308 transitions. [2020-11-30 00:20:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1495 [2020-11-30 00:20:41,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:20:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 3207 proven. 1091 refuted. 0 times theorem prover too weak. 62634 trivial. 0 not checked. [2020-11-30 00:20:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 00:20:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 155 states and 295 transitions. [2020-11-30 00:20:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 295 transitions. [2020-11-30 00:20:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2020-11-30 00:20:46,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 00:20:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:20:46,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:20:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:20:47,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:20:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:20:48,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:20:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:20:48,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:20:49,555 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 41 iterations. [2020-11-30 00:20:49,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 30.11 12:20:49 ImpRootNode [2020-11-30 00:20:49,963 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-30 00:20:49,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:20:49,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:20:49,964 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:20:49,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:18:37" (3/4) ... [2020-11-30 00:20:49,968 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:20:50,388 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_699a27c0-07ac-409e-80ee-d08f8b448aff/bin/ukojak/witness.graphml [2020-11-30 00:20:50,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:20:50,390 INFO L168 Benchmark]: Toolchain (without parser) took 133795.87 ms. Allocated memory was 90.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 59.7 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 599.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:20:50,391 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 90.2 MB. Free memory was 50.3 MB in the beginning and 50.2 MB in the end (delta: 40.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:20:50,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.88 ms. Allocated memory is still 90.2 MB. Free memory was 59.4 MB in the beginning and 68.1 MB in the end (delta: -8.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:20:50,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.69 ms. Allocated memory is still 90.2 MB. Free memory was 68.1 MB in the beginning and 66.8 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:20:50,393 INFO L168 Benchmark]: Boogie Preprocessor took 47.75 ms. Allocated memory is still 90.2 MB. Free memory was 66.8 MB in the beginning and 65.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:20:50,394 INFO L168 Benchmark]: RCFGBuilder took 667.83 ms. Allocated memory is still 90.2 MB. Free memory was 65.8 MB in the beginning and 51.1 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:20:50,394 INFO L168 Benchmark]: CodeCheck took 132206.88 ms. Allocated memory was 90.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 51.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 542.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:20:50,395 INFO L168 Benchmark]: Witness Printer took 424.56 ms. Allocated memory is still 2.7 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 49.6 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:20:50,398 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 131.7s, OverallIterations: 41, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: -1859623936 SDtfs, -861149184 SDslu, 858046464 SDs, 0 SdLazy, 255307040 SolverSat, -1464439520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 105.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95930 GetRequests, 93803 SyntacticMatches, 1689 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111280 ImplicationChecksByTransitivity, 67.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.7s SsaConstructionTime, 8.1s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 36683 NumberOfCodeBlocks, 36683 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 35435 ConstructedInterpolants, 0 QuantifiedInterpolants, 61668497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 1634342/1719648 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 10; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 55 [L4] __assert_fail("0", "fibo_2calls_10-2.c", 4, "reach_error") * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 90.2 MB. Free memory was 50.3 MB in the beginning and 50.2 MB in the end (delta: 40.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 394.88 ms. Allocated memory is still 90.2 MB. Free memory was 59.4 MB in the beginning and 68.1 MB in the end (delta: -8.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.69 ms. Allocated memory is still 90.2 MB. Free memory was 68.1 MB in the beginning and 66.8 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.75 ms. Allocated memory is still 90.2 MB. Free memory was 66.8 MB in the beginning and 65.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 667.83 ms. Allocated memory is still 90.2 MB. Free memory was 65.8 MB in the beginning and 51.1 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * CodeCheck took 132206.88 ms. Allocated memory was 90.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 51.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 542.1 MB. Max. memory is 16.1 GB. * Witness Printer took 424.56 ms. Allocated memory is still 2.7 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 49.6 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...