./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:09:28,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:09:28,151 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:09:28,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:09:28,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:09:28,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:09:28,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:09:28,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:09:28,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:09:28,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:09:28,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:09:28,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:09:28,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:09:28,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:09:28,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:09:28,183 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:09:28,183 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:09:28,183 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:09:28,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:09:28,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:09:28,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:09:28,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:09:28,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:09:28,184 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:09:28,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:09:28,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2024-11-13 22:09:28,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:09:28,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:09:28,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:09:28,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:09:28,487 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:09:28,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c Unable to find full path for "g++" [2024-11-13 22:09:30,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:09:30,817 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:09:30,822 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2024-11-13 22:09:30,832 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/data/ca712bbf5/c626cc033d8945be9e08e8a6dcced5f7/FLAG472090303 [2024-11-13 22:09:30,853 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/data/ca712bbf5/c626cc033d8945be9e08e8a6dcced5f7 [2024-11-13 22:09:30,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:09:30,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:09:30,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:09:30,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:09:30,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:09:30,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:09:30" (1/1) ... [2024-11-13 22:09:30,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2223d403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:30, skipping insertion in model container [2024-11-13 22:09:30,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:09:30" (1/1) ... [2024-11-13 22:09:30,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:09:31,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2024-11-13 22:09:31,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:09:31,086 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:09:31,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2024-11-13 22:09:31,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:09:31,118 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:09:31,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31 WrapperNode [2024-11-13 22:09:31,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:09:31,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:09:31,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:09:31,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:09:31,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,151 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-13 22:09:31,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:09:31,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:09:31,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:09:31,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:09:31,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:09:31,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:09:31,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:09:31,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:09:31,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:09:31,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:09:31,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:09:31,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-13 22:09:31,266 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-13 22:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-13 22:09:31,266 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-13 22:09:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:09:31,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:09:31,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:09:31,335 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:09:31,492 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 22:09:31,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:09:31,528 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:09:31,528 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 22:09:31,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:09:31 BoogieIcfgContainer [2024-11-13 22:09:31,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:09:31,529 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:09:31,529 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:09:31,538 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:09:31,539 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:09:31" (1/1) ... [2024-11-13 22:09:31,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:09:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2024-11-13 22:09:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-13 22:09:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 22:09:31,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:09:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 30 states and 39 transitions. [2024-11-13 22:09:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-13 22:09:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 22:09:32,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:32,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:09:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2024-11-13 22:09:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-11-13 22:09:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 22:09:32,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:09:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 36 states and 50 transitions. [2024-11-13 22:09:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-11-13 22:09:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 22:09:32,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:09:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 66 transitions. [2024-11-13 22:09:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2024-11-13 22:09:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 22:09:34,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:09:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 45 states and 69 transitions. [2024-11-13 22:09:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2024-11-13 22:09:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 22:09:34,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 22:09:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 45 states and 66 transitions. [2024-11-13 22:09:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-11-13 22:09:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 22:09:36,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 22:09:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 57 states and 95 transitions. [2024-11-13 22:09:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 95 transitions. [2024-11-13 22:09:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 22:09:37,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 22:09:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 57 states and 94 transitions. [2024-11-13 22:09:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 94 transitions. [2024-11-13 22:09:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-13 22:09:38,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 22:09:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 60 states and 102 transitions. [2024-11-13 22:09:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2024-11-13 22:09:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 22:09:40,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 22:09:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 70 states and 129 transitions. [2024-11-13 22:09:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2024-11-13 22:09:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 22:09:42,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 98 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-13 22:09:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 72 states and 131 transitions. [2024-11-13 22:09:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 131 transitions. [2024-11-13 22:09:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 22:09:42,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 98 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-13 22:09:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 74 states and 133 transitions. [2024-11-13 22:09:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 133 transitions. [2024-11-13 22:09:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 22:09:43,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 44 proven. 193 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-11-13 22:09:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 84 states and 161 transitions. [2024-11-13 22:09:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 161 transitions. [2024-11-13 22:09:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 22:09:45,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 44 proven. 193 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-11-13 22:09:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 86 states and 163 transitions. [2024-11-13 22:09:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 163 transitions. [2024-11-13 22:09:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 22:09:46,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 44 proven. 193 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-11-13 22:09:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 88 states and 165 transitions. [2024-11-13 22:09:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 165 transitions. [2024-11-13 22:09:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 22:09:46,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 140 proven. 168 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-13 22:09:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 90 states and 164 transitions. [2024-11-13 22:09:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2024-11-13 22:09:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 22:09:48,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 57 proven. 313 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-13 22:09:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 102 states and 195 transitions. [2024-11-13 22:09:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 195 transitions. [2024-11-13 22:09:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 22:09:51,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:51,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 72 proven. 370 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2024-11-13 22:09:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 104 states and 197 transitions. [2024-11-13 22:09:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2024-11-13 22:09:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2024-11-13 22:09:51,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:51,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17073 backedges. 253 proven. 1747 refuted. 0 times theorem prover too weak. 15073 trivial. 0 not checked. [2024-11-13 22:09:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 114 states and 229 transitions. [2024-11-13 22:09:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 229 transitions. [2024-11-13 22:09:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2024-11-13 22:09:55,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10358 backedges. 216 proven. 1327 refuted. 0 times theorem prover too weak. 8815 trivial. 0 not checked. [2024-11-13 22:09:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 116 states and 231 transitions. [2024-11-13 22:09:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 231 transitions. [2024-11-13 22:09:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-11-13 22:09:56,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 576 proven. 701 refuted. 0 times theorem prover too weak. 3739 trivial. 0 not checked. [2024-11-13 22:09:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 116 states and 230 transitions. [2024-11-13 22:09:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 230 transitions. [2024-11-13 22:09:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-11-13 22:09:58,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:09:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7277 backedges. 208 proven. 1069 refuted. 0 times theorem prover too weak. 6000 trivial. 0 not checked. [2024-11-13 22:09:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:09:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 118 states and 232 transitions. [2024-11-13 22:09:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 232 transitions. [2024-11-13 22:09:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2024-11-13 22:09:59,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:09:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:09:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 17073 backedges. 266 proven. 2029 refuted. 0 times theorem prover too weak. 14778 trivial. 0 not checked. [2024-11-13 22:10:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 128 states and 266 transitions. [2024-11-13 22:10:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 266 transitions. [2024-11-13 22:10:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2024-11-13 22:10:02,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13525 backedges. 269 proven. 1742 refuted. 0 times theorem prover too weak. 11514 trivial. 0 not checked. [2024-11-13 22:10:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 130 states and 268 transitions. [2024-11-13 22:10:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 268 transitions. [2024-11-13 22:10:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2024-11-13 22:10:04,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:04,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17119 backedges. 308 proven. 1991 refuted. 0 times theorem prover too weak. 14820 trivial. 0 not checked. [2024-11-13 22:10:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 132 states and 270 transitions. [2024-11-13 22:10:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 270 transitions. [2024-11-13 22:10:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1100 [2024-11-13 22:10:05,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36097 backedges. 2335 proven. 2992 refuted. 0 times theorem prover too weak. 30770 trivial. 0 not checked. [2024-11-13 22:10:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 132 states and 268 transitions. [2024-11-13 22:10:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 268 transitions. [2024-11-13 22:10:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1225 [2024-11-13 22:10:09,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 44861 backedges. 651 proven. 3613 refuted. 0 times theorem prover too weak. 40597 trivial. 0 not checked. [2024-11-13 22:10:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 144 states and 305 transitions. [2024-11-13 22:10:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 305 transitions. [2024-11-13 22:10:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2024-11-13 22:10:14,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 28321 backedges. 778 proven. 2905 refuted. 0 times theorem prover too weak. 24638 trivial. 0 not checked. [2024-11-13 22:10:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 144 states and 304 transitions. [2024-11-13 22:10:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 304 transitions. [2024-11-13 22:10:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2018 [2024-11-13 22:10:16,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 122731 backedges. 1001 proven. 6189 refuted. 0 times theorem prover too weak. 115541 trivial. 0 not checked. [2024-11-13 22:10:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 146 states and 306 transitions. [2024-11-13 22:10:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 306 transitions. [2024-11-13 22:10:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1753 [2024-11-13 22:10:20,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:20,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 92369 backedges. 1183 proven. 3890 refuted. 0 times theorem prover too weak. 87296 trivial. 0 not checked. [2024-11-13 22:10:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 153 states and 262 transitions. [2024-11-13 22:10:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 262 transitions. [2024-11-13 22:10:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1977 [2024-11-13 22:10:29,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 117843 backedges. 941 proven. 6387 refuted. 0 times theorem prover too weak. 110515 trivial. 0 not checked. [2024-11-13 22:10:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 155 states and 256 transitions. [2024-11-13 22:10:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 256 transitions. [2024-11-13 22:10:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1262 [2024-11-13 22:10:34,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:34,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 47743 backedges. 944 proven. 2505 refuted. 0 times theorem prover too weak. 44294 trivial. 0 not checked. [2024-11-13 22:10:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 155 states and 255 transitions. [2024-11-13 22:10:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 255 transitions. [2024-11-13 22:10:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2024-11-13 22:10:36,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:36,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 43597 backedges. 2596 proven. 678 refuted. 0 times theorem prover too weak. 40323 trivial. 0 not checked. [2024-11-13 22:10:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 155 states and 254 transitions. [2024-11-13 22:10:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 254 transitions. [2024-11-13 22:10:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1849 [2024-11-13 22:10:39,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 2089 proven. 3263 refuted. 0 times theorem prover too weak. 97417 trivial. 0 not checked. [2024-11-13 22:10:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 155 states and 249 transitions. [2024-11-13 22:10:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 249 transitions. [2024-11-13 22:10:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1577 [2024-11-13 22:10:42,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 74555 backedges. 946 proven. 4852 refuted. 0 times theorem prover too weak. 68757 trivial. 0 not checked. [2024-11-13 22:10:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 155 states and 243 transitions. [2024-11-13 22:10:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 243 transitions. [2024-11-13 22:10:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1495 [2024-11-13 22:10:46,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:10:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 2934 proven. 1957 refuted. 0 times theorem prover too weak. 62041 trivial. 0 not checked. [2024-11-13 22:10:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:10:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 155 states and 241 transitions. [2024-11-13 22:10:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2024-11-13 22:10:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2024-11-13 22:10:50,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:10:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:10:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:10:50,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:10:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:10:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:10:51,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:10:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:10:52,141 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 37 iterations. [2024-11-13 22:10:52,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:10:52 ImpRootNode [2024-11-13 22:10:52,381 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:10:52,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:10:52,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:10:52,382 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:10:52,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:09:31" (3/4) ... [2024-11-13 22:10:52,387 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 22:10:52,558 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:10:52,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:10:52,559 INFO L158 Benchmark]: Toolchain (without parser) took 81701.47ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 119.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 494.4MB. Max. memory is 16.1GB. [2024-11-13 22:10:52,560 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:10:52,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.35ms. Allocated memory is still 142.6MB. Free memory was 119.1MB in the beginning and 108.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:10:52,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.57ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 107.2MB in the end (delta: 922.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:10:52,562 INFO L158 Benchmark]: Boogie Preprocessor took 26.96ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 106.5MB in the end (delta: 686.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:10:52,563 INFO L158 Benchmark]: RCFGBuilder took 347.48ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 95.3MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:10:52,563 INFO L158 Benchmark]: CodeCheck took 80852.30ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 95.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 452.5MB. Max. memory is 16.1GB. [2024-11-13 22:10:52,564 INFO L158 Benchmark]: Witness Printer took 176.89ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:10:52,566 INFO L338 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. OverallTime: 80.6s, OverallIterations: 37, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7797 SdHoareTripleChecker+Valid, 63.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5191 mSDsluCounter, 8940 SdHoareTripleChecker+Invalid, 53.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5995 mSDsCounter, 10477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39067 IncrementalHoareTripleChecker+Invalid, 49544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10477 mSolverCounterUnsat, 2945 mSDtfsCounter, 39067 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67163 GetRequests, 65328 SyntacticMatches, 1429 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94173 ImplicationChecksByTransitivity, 35.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 40.3s InterpolantComputationTime, 23737 NumberOfCodeBlocks, 23737 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 22493 ConstructedInterpolants, 0 QuantifiedInterpolants, 25941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 2 PerfectInterpolantSequences, 819706/871280 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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [x=10] [L41] reach_error() VAL [x=10] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.35ms. Allocated memory is still 142.6MB. Free memory was 119.1MB in the beginning and 108.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.57ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 107.2MB in the end (delta: 922.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.96ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 106.5MB in the end (delta: 686.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 347.48ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 95.3MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 80852.30ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 95.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 452.5MB. Max. memory is 16.1GB. * Witness Printer took 176.89ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 22:10:52,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_056f04e4-6dc2-4ae3-862a-16c989f69a11/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE