./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:25:27,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:25:27,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:25:27,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:25:27,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:25:27,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:25:27,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:25:27,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:25:27,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:25:27,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:25:27,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:25:27,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:25:27,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:25:27,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:25:27,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:25:27,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:25:27,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:25:27,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:25:27,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:25:27,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:25:27,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:25:27,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:25:27,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:25:27,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:25:27,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:25:27,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:25:27,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:25:27,523 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:25:27,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:25:27,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:25:27,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:25:27,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:25:27,525 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:25:27,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:25:27,526 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:25:27,527 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:25:27,527 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 22:25:27,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:25:27,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:25:27,538 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:25:27,539 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:25:27,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:25:27,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:25:27,539 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:25:27,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:25:27,540 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:25:27,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:25:27,540 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:25:27,540 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:25:27,541 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:25:27,541 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:25:27,541 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:25:27,541 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:25:27,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:25:27,541 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:25:27,541 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:25:27,542 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:25:27,542 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:25:27,542 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:25:27,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:25:27,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:25:27,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:25:27,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:25:27,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:25:27,542 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:25:27,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:25:27,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:25:27,543 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-11-22 22:25:27,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:25:27,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:25:27,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:25:27,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:25:27,581 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:25:27,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-22 22:25:27,622 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/data/04ff4780a/f336725a08dd4073adee1eea65ad8bb8/FLAG7d6ba382b [2018-11-22 22:25:27,965 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:25:27,966 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-22 22:25:27,971 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/data/04ff4780a/f336725a08dd4073adee1eea65ad8bb8/FLAG7d6ba382b [2018-11-22 22:25:28,399 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/data/04ff4780a/f336725a08dd4073adee1eea65ad8bb8 [2018-11-22 22:25:28,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:25:28,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:25:28,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:25:28,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:25:28,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:25:28,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125e25d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28, skipping insertion in model container [2018-11-22 22:25:28,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:25:28,428 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:25:28,545 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:25:28,547 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:25:28,558 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:25:28,569 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:25:28,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28 WrapperNode [2018-11-22 22:25:28,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:25:28,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:25:28,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:25:28,570 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:25:28,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:25:28,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:25:28,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:25:28,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:25:28,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... [2018-11-22 22:25:28,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:25:28,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:25:28,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:25:28,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:25:28,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:25:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:25:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:25:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:25:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:25:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:25:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:25:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-22 22:25:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-22 22:25:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-22 22:25:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-22 22:25:28,811 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:25:28,811 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 22:25:28,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:25:28 BoogieIcfgContainer [2018-11-22 22:25:28,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:25:28,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:25:28,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:25:28,815 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:25:28,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:25:28" (1/3) ... [2018-11-22 22:25:28,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24711dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:25:28, skipping insertion in model container [2018-11-22 22:25:28,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:28" (2/3) ... [2018-11-22 22:25:28,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24711dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:25:28, skipping insertion in model container [2018-11-22 22:25:28,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:25:28" (3/3) ... [2018-11-22 22:25:28,819 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-22 22:25:28,828 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:25:28,835 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:25:28,850 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:25:28,873 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:25:28,874 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:25:28,874 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:25:28,874 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:25:28,874 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:25:28,874 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:25:28,875 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:25:28,875 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:25:28,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:25:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-22 22:25:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 22:25:28,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:28,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:28,893 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:28,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-22 22:25:28,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:28,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:28,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:28,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:29,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:25:29,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:25:29,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:25:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:25:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:25:29,041 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-22 22:25:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:29,119 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-22 22:25:29,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:25:29,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-22 22:25:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:29,128 INFO L225 Difference]: With dead ends: 44 [2018-11-22 22:25:29,128 INFO L226 Difference]: Without dead ends: 30 [2018-11-22 22:25:29,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:25:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-22 22:25:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-22 22:25:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 22:25:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-22 22:25:29,165 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-22 22:25:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:29,165 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-22 22:25:29,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:25:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-22 22:25:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 22:25:29,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:29,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:29,167 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:29,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-22 22:25:29,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:29,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:29,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:29,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:29,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:29,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:25:29,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:25:29,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:25:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:25:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:25:29,203 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-22 22:25:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:29,287 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-22 22:25:29,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:25:29,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-22 22:25:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:29,289 INFO L225 Difference]: With dead ends: 36 [2018-11-22 22:25:29,289 INFO L226 Difference]: Without dead ends: 32 [2018-11-22 22:25:29,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:25:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-22 22:25:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-22 22:25:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 22:25:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-22 22:25:29,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-22 22:25:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:29,294 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-22 22:25:29,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:25:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-22 22:25:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 22:25:29,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:29,295 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:29,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:29,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-22 22:25:29,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:29,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:25:29,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:29,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:29,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:29,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:25:29,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:29,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-22 22:25:29,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:25:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:25:29,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:25:29,476 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-11-22 22:25:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:29,601 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-22 22:25:29,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:25:29,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-22 22:25:29,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:29,602 INFO L225 Difference]: With dead ends: 58 [2018-11-22 22:25:29,603 INFO L226 Difference]: Without dead ends: 34 [2018-11-22 22:25:29,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-22 22:25:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-22 22:25:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-22 22:25:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-22 22:25:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-22 22:25:29,610 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-11-22 22:25:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:29,610 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-22 22:25:29,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:25:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-22 22:25:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 22:25:29,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:29,612 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:29,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:29,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:29,613 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-22 22:25:29,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:29,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:29,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:29,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:29,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:25:29,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:29,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:29,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:29,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:25:29,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:29,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-22 22:25:29,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 22:25:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:25:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:25:29,726 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-22 22:25:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:29,838 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-22 22:25:29,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:25:29,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-22 22:25:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:29,839 INFO L225 Difference]: With dead ends: 43 [2018-11-22 22:25:29,840 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 22:25:29,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:25:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 22:25:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-22 22:25:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 22:25:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-22 22:25:29,848 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-11-22 22:25:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:29,849 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-22 22:25:29,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 22:25:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-22 22:25:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-22 22:25:29,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:29,851 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:29,851 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:29,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:29,851 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-22 22:25:29,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:29,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:29,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:29,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:29,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:25:29,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:29,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:29,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:29,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:25:29,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:29,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-22 22:25:29,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:25:29,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:25:29,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:25:29,993 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-11-22 22:25:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:30,167 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-11-22 22:25:30,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:25:30,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-22 22:25:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:30,168 INFO L225 Difference]: With dead ends: 70 [2018-11-22 22:25:30,168 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 22:25:30,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-22 22:25:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 22:25:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-22 22:25:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 22:25:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-22 22:25:30,173 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-11-22 22:25:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:30,174 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-22 22:25:30,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:25:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-22 22:25:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-22 22:25:30,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:30,175 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:30,175 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:30,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-11-22 22:25:30,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:30,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:30,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:30,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 22:25:30,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:30,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:30,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:30,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:25:30,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:30,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-22 22:25:30,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:25:30,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:25:30,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:25:30,279 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-11-22 22:25:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:30,378 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-11-22 22:25:30,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:25:30,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-22 22:25:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:30,380 INFO L225 Difference]: With dead ends: 61 [2018-11-22 22:25:30,380 INFO L226 Difference]: Without dead ends: 57 [2018-11-22 22:25:30,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:25:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-22 22:25:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-22 22:25:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 22:25:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-11-22 22:25:30,388 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-11-22 22:25:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:30,389 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-22 22:25:30,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:25:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-11-22 22:25:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-22 22:25:30,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:30,390 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:30,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:30,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:30,391 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-11-22 22:25:30,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:30,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:30,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:30,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:30,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-22 22:25:30,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:30,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:30,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:30,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-22 22:25:30,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:30,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-11-22 22:25:30,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:25:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:25:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:25:30,535 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-11-22 22:25:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:30,634 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-11-22 22:25:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:25:30,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-22 22:25:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:30,636 INFO L225 Difference]: With dead ends: 71 [2018-11-22 22:25:30,636 INFO L226 Difference]: Without dead ends: 67 [2018-11-22 22:25:30,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:25:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-22 22:25:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-22 22:25:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-22 22:25:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-11-22 22:25:30,645 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-11-22 22:25:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:30,645 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-11-22 22:25:30,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:25:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-11-22 22:25:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-22 22:25:30,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:30,648 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:30,648 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:30,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-11-22 22:25:30,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:30,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:30,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:30,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:30,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-22 22:25:30,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:30,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:30,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:25:30,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:25:30,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:25:30,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-22 22:25:30,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:30,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-22 22:25:30,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-22 22:25:30,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-22 22:25:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-22 22:25:30,879 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-11-22 22:25:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:31,251 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-11-22 22:25:31,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-22 22:25:31,251 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-11-22 22:25:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:31,254 INFO L225 Difference]: With dead ends: 146 [2018-11-22 22:25:31,254 INFO L226 Difference]: Without dead ends: 103 [2018-11-22 22:25:31,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-11-22 22:25:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-22 22:25:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-11-22 22:25:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-22 22:25:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-11-22 22:25:31,271 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-11-22 22:25:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:31,272 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-11-22 22:25:31,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-22 22:25:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-11-22 22:25:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-22 22:25:31,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:31,275 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:31,275 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:31,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:31,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2059253460, now seen corresponding path program 1 times [2018-11-22 22:25:31,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:31,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:31,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:31,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:31,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 66 proven. 113 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-22 22:25:31,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:31,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:31,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:31,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 42 proven. 134 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-11-22 22:25:31,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:31,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-22 22:25:31,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-22 22:25:31,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-22 22:25:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-22 22:25:31,575 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-11-22 22:25:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:32,055 INFO L93 Difference]: Finished difference Result 239 states and 535 transitions. [2018-11-22 22:25:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-22 22:25:32,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2018-11-22 22:25:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:32,058 INFO L225 Difference]: With dead ends: 239 [2018-11-22 22:25:32,058 INFO L226 Difference]: Without dead ends: 158 [2018-11-22 22:25:32,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2018-11-22 22:25:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-22 22:25:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2018-11-22 22:25:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-22 22:25:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 243 transitions. [2018-11-22 22:25:32,079 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 243 transitions. Word has length 135 [2018-11-22 22:25:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:32,080 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 243 transitions. [2018-11-22 22:25:32,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-22 22:25:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 243 transitions. [2018-11-22 22:25:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-22 22:25:32,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:32,083 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:32,083 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:32,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:32,083 INFO L82 PathProgramCache]: Analyzing trace with hash -789289505, now seen corresponding path program 2 times [2018-11-22 22:25:32,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:32,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:32,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 169 proven. 13 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-11-22 22:25:32,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:32,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:32,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:25:32,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:25:32,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:25:32,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 83 proven. 92 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-11-22 22:25:32,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:32,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-22 22:25:32,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 22:25:32,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 22:25:32,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:25:32,337 INFO L87 Difference]: Start difference. First operand 139 states and 243 transitions. Second operand 17 states. [2018-11-22 22:25:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:32,732 INFO L93 Difference]: Finished difference Result 349 states and 782 transitions. [2018-11-22 22:25:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-22 22:25:32,733 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2018-11-22 22:25:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:32,735 INFO L225 Difference]: With dead ends: 349 [2018-11-22 22:25:32,735 INFO L226 Difference]: Without dead ends: 201 [2018-11-22 22:25:32,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2018-11-22 22:25:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-22 22:25:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 174. [2018-11-22 22:25:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-22 22:25:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 309 transitions. [2018-11-22 22:25:32,755 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 309 transitions. Word has length 150 [2018-11-22 22:25:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:32,756 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 309 transitions. [2018-11-22 22:25:32,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 22:25:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 309 transitions. [2018-11-22 22:25:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-22 22:25:32,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:32,758 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:32,758 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:32,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash -950882599, now seen corresponding path program 1 times [2018-11-22 22:25:32,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:32,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:32,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 85 proven. 85 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-11-22 22:25:32,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:32,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:32,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:32,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 83 proven. 137 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-22 22:25:32,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:32,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-11-22 22:25:32,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 22:25:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:25:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:25:32,948 INFO L87 Difference]: Start difference. First operand 174 states and 309 transitions. Second operand 13 states. [2018-11-22 22:25:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:33,212 INFO L93 Difference]: Finished difference Result 341 states and 649 transitions. [2018-11-22 22:25:33,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 22:25:33,212 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 152 [2018-11-22 22:25:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:33,214 INFO L225 Difference]: With dead ends: 341 [2018-11-22 22:25:33,214 INFO L226 Difference]: Without dead ends: 133 [2018-11-22 22:25:33,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-11-22 22:25:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-22 22:25:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-11-22 22:25:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-22 22:25:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 165 transitions. [2018-11-22 22:25:33,225 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 165 transitions. Word has length 152 [2018-11-22 22:25:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:33,225 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 165 transitions. [2018-11-22 22:25:33,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 22:25:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2018-11-22 22:25:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-22 22:25:33,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:33,227 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:33,227 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:33,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:33,227 INFO L82 PathProgramCache]: Analyzing trace with hash -529934979, now seen corresponding path program 3 times [2018-11-22 22:25:33,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:33,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:33,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:33,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:33,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-11-22 22:25:33,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:33,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:33,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:25:33,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 22:25:33,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:25:33,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 27 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-22 22:25:33,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:33,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-11-22 22:25:33,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:25:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:25:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:25:33,392 INFO L87 Difference]: Start difference. First operand 122 states and 165 transitions. Second operand 10 states. [2018-11-22 22:25:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:33,479 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2018-11-22 22:25:33,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:25:33,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 150 [2018-11-22 22:25:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:33,481 INFO L225 Difference]: With dead ends: 134 [2018-11-22 22:25:33,482 INFO L226 Difference]: Without dead ends: 127 [2018-11-22 22:25:33,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:25:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-22 22:25:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-11-22 22:25:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-22 22:25:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 168 transitions. [2018-11-22 22:25:33,490 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 168 transitions. Word has length 150 [2018-11-22 22:25:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:33,491 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 168 transitions. [2018-11-22 22:25:33,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:25:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 168 transitions. [2018-11-22 22:25:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-22 22:25:33,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:33,494 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:33,494 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:33,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:33,495 INFO L82 PathProgramCache]: Analyzing trace with hash 214574526, now seen corresponding path program 4 times [2018-11-22 22:25:33,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:33,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:33,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:33,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:33,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 313 proven. 173 refuted. 0 times theorem prover too weak. 1517 trivial. 0 not checked. [2018-11-22 22:25:33,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:33,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:25:33,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:25:33,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:25:33,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 174 proven. 310 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2018-11-22 22:25:33,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:33,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2018-11-22 22:25:33,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 22:25:33,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 22:25:33,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:25:33,780 INFO L87 Difference]: Start difference. First operand 125 states and 168 transitions. Second operand 15 states. [2018-11-22 22:25:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:33,908 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-11-22 22:25:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:25:33,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 272 [2018-11-22 22:25:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:33,910 INFO L225 Difference]: With dead ends: 147 [2018-11-22 22:25:33,910 INFO L226 Difference]: Without dead ends: 125 [2018-11-22 22:25:33,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:25:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-22 22:25:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-22 22:25:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-22 22:25:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 165 transitions. [2018-11-22 22:25:33,918 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 165 transitions. Word has length 272 [2018-11-22 22:25:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:33,919 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 165 transitions. [2018-11-22 22:25:33,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 22:25:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 165 transitions. [2018-11-22 22:25:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-22 22:25:33,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:33,920 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:33,921 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:33,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:33,921 INFO L82 PathProgramCache]: Analyzing trace with hash -854759576, now seen corresponding path program 5 times [2018-11-22 22:25:33,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:33,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:33,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 267 proven. 35 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-11-22 22:25:34,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:34,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:34,026 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 22:25:34,073 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-22 22:25:34,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:25:34,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 171 proven. 273 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-11-22 22:25:34,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:34,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 21 [2018-11-22 22:25:34,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-22 22:25:34,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-22 22:25:34,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:25:34,237 INFO L87 Difference]: Start difference. First operand 125 states and 165 transitions. Second operand 21 states. [2018-11-22 22:25:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:34,801 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2018-11-22 22:25:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-22 22:25:34,802 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 191 [2018-11-22 22:25:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:34,803 INFO L225 Difference]: With dead ends: 318 [2018-11-22 22:25:34,803 INFO L226 Difference]: Without dead ends: 192 [2018-11-22 22:25:34,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=1661, Unknown=0, NotChecked=0, Total=1980 [2018-11-22 22:25:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-22 22:25:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2018-11-22 22:25:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-22 22:25:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 209 transitions. [2018-11-22 22:25:34,818 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 209 transitions. Word has length 191 [2018-11-22 22:25:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:34,819 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 209 transitions. [2018-11-22 22:25:34,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-22 22:25:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 209 transitions. [2018-11-22 22:25:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-22 22:25:34,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:34,820 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 14, 14, 13, 12, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:34,821 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:34,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2094292409, now seen corresponding path program 6 times [2018-11-22 22:25:34,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:34,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:34,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:34,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 108 proven. 348 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2018-11-22 22:25:35,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:25:35,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:25:35,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 22:25:35,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-22 22:25:35,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:25:35,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 402 proven. 31 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2018-11-22 22:25:35,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:25:35,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2018-11-22 22:25:35,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-22 22:25:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-22 22:25:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:25:35,204 INFO L87 Difference]: Start difference. First operand 156 states and 209 transitions. Second operand 21 states. [2018-11-22 22:25:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:35,589 INFO L93 Difference]: Finished difference Result 330 states and 488 transitions. [2018-11-22 22:25:35,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-22 22:25:35,590 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 230 [2018-11-22 22:25:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:25:35,591 INFO L225 Difference]: With dead ends: 330 [2018-11-22 22:25:35,591 INFO L226 Difference]: Without dead ends: 119 [2018-11-22 22:25:35,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2018-11-22 22:25:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-22 22:25:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-11-22 22:25:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-22 22:25:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2018-11-22 22:25:35,602 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 230 [2018-11-22 22:25:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:25:35,602 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2018-11-22 22:25:35,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-22 22:25:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2018-11-22 22:25:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-22 22:25:35,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:25:35,603 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:35,603 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:25:35,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 7 times [2018-11-22 22:25:35,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:35,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:35,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:35,651 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #47#return; [?] CALL call #t~ret5 := main(); [?] ~x~0 := 6; VAL [main_~x~0=6] [?] CALL call #t~ret4 := fibo1(~x~0); VAL [|fibo1_#in~n|=6] [?] ~n := #in~n; VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(~n < 1); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #57#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #59#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5, |fibo1_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] assume true; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] RET #51#return; VAL [main_~x~0=6, |main_#t~ret4|=8] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=8, main_~x~0=6] [?] assume 8 == ~result~0; VAL [main_~result~0=8, main_~x~0=6] [?] assume !false; VAL [main_~result~0=8, main_~x~0=6] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38-L40] assume 8 == ~result~0; VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38-L40] assume 8 == ~result~0; VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] ----- [2018-11-22 22:25:35,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:25:35 BoogieIcfgContainer [2018-11-22 22:25:35,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:25:35,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:25:35,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:25:35,925 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:25:35,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:25:28" (3/4) ... [2018-11-22 22:25:35,928 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #47#return; [?] CALL call #t~ret5 := main(); [?] ~x~0 := 6; VAL [main_~x~0=6] [?] CALL call #t~ret4 := fibo1(~x~0); VAL [|fibo1_#in~n|=6] [?] ~n := #in~n; VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(~n < 1); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] assume !(1 == ~n); VAL [fibo1_~n=6, |fibo1_#in~n|=6] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=5] [?] ~n := #in~n; VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(~n < 1); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] assume !(1 == ~n); VAL [fibo2_~n=5, |fibo2_#in~n|=5] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=4] [?] ~n := #in~n; VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(~n < 1); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo1_~n=4, |fibo1_#in~n|=4] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=3] [?] ~n := #in~n; VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(~n < 1); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo2_~n=3, |fibo2_#in~n|=3] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] assume true; VAL [fibo2_~n=3, |fibo2_#in~n|=3, |fibo2_#res|=2] [?] RET #57#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#t~ret0|=2, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] assume true; VAL [fibo1_~n=4, |fibo1_#in~n|=4, |fibo1_#res|=3] [?] RET #53#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #55#return; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#t~ret2|=3, |fibo2_#t~ret3|=2] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] assume true; VAL [fibo2_~n=5, |fibo2_#in~n|=5, |fibo2_#res|=5] [?] RET #57#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=4] [?] ~n := #in~n; VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(~n < 1); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] assume !(1 == ~n); VAL [fibo2_~n=4, |fibo2_#in~n|=4] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=3] [?] ~n := #in~n; VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(~n < 1); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] assume !(1 == ~n); VAL [fibo1_~n=3, |fibo1_#in~n|=3] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=2] [?] ~n := #in~n; VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(~n < 1); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo2_~n=2, |fibo2_#in~n|=2] [?] CALL call #t~ret2 := fibo1(~n - 1); VAL [|fibo1_#in~n|=1] [?] ~n := #in~n; VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume !(~n < 1); VAL [fibo1_~n=1, |fibo1_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=1, |fibo1_#in~n|=1, |fibo1_#res|=1] [?] RET #53#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=0] [?] ~n := #in~n; VAL [fibo1_~n=0, |fibo1_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] assume true; VAL [fibo1_~n=0, |fibo1_#in~n|=0, |fibo1_#res|=0] [?] RET #55#return; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#t~ret2|=1, |fibo2_#t~ret3|=0] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=2, |fibo2_#in~n|=2, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #59#return; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] assume true; VAL [fibo1_~n=3, |fibo1_#in~n|=3, |fibo1_#res|=2] [?] RET #53#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2] [?] CALL call #t~ret3 := fibo1(~n - 2); VAL [|fibo1_#in~n|=2] [?] ~n := #in~n; VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(~n < 1); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] assume !(1 == ~n); VAL [fibo1_~n=2, |fibo1_#in~n|=2] [?] CALL call #t~ret0 := fibo2(~n - 1); VAL [|fibo2_#in~n|=1] [?] ~n := #in~n; VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume !(~n < 1); VAL [fibo2_~n=1, |fibo2_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] assume true; VAL [fibo2_~n=1, |fibo2_#in~n|=1, |fibo2_#res|=1] [?] RET #57#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1] [?] CALL call #t~ret1 := fibo2(~n - 2); VAL [|fibo2_#in~n|=0] [?] ~n := #in~n; VAL [fibo2_~n=0, |fibo2_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] assume true; VAL [fibo2_~n=0, |fibo2_#in~n|=0, |fibo2_#res|=0] [?] RET #59#return; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#t~ret0|=1, |fibo1_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] assume true; VAL [fibo1_~n=2, |fibo1_#in~n|=2, |fibo1_#res|=1] [?] RET #55#return; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#t~ret2|=2, |fibo2_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] assume true; VAL [fibo2_~n=4, |fibo2_#in~n|=4, |fibo2_#res|=3] [?] RET #59#return; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#t~ret0|=5, |fibo1_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] assume true; VAL [fibo1_~n=6, |fibo1_#in~n|=6, |fibo1_#res|=8] [?] RET #51#return; VAL [main_~x~0=6, |main_#t~ret4|=8] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=8, main_~x~0=6] [?] assume 8 == ~result~0; VAL [main_~result~0=8, main_~x~0=6] [?] assume !false; VAL [main_~result~0=8, main_~x~0=6] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38-L40] assume 8 == ~result~0; VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8-L14] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L10-L14] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18-L24] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L20-L24] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8-L14] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L10-L14] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18-L24] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L20-L24] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L5] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L4] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L5] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18-L24] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L20-L24] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8-L14] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L10-L14] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18-L24] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L20-L24] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8-L14] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L10-L14] assume 1 == ~n; [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L4] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8-L14] assume ~n < 1; [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L4] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L5] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L4] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8-L14] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L10-L14] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18-L24] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L20-L24] assume 1 == ~n; [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L5] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18-L24] assume ~n < 1; [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L5] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L4] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L5] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L4] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38-L40] assume 8 == ~result~0; VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 6; VAL [~x~0=6] [L37] CALL call #t~ret4 := fibo1(~x~0); VAL [#in~n=6] [L7-L15] ~n := #in~n; VAL [#in~n=6, ~n=6] [L8] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L10] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=5] [L17-L25] ~n := #in~n; VAL [#in~n=5, ~n=5] [L18] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L20] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4] [L7-L15] ~n := #in~n; VAL [#in~n=4, ~n=4] [L8] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L10] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3] [L17-L25] ~n := #in~n; VAL [#in~n=3, ~n=3] [L18] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L20] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=3, #t~ret2=1, ~n=3] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3, #t~ret2=1, #t~ret3=1, ~n=3] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=3, #res=2, ~n=3] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=5, #t~ret2=3, ~n=5] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=5, #t~ret2=3, #t~ret3=2, ~n=5] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=5, #res=5, ~n=5] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=4] [L17-L25] ~n := #in~n; VAL [#in~n=4, ~n=4] [L18] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L20] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=3] [L7-L15] ~n := #in~n; VAL [#in~n=3, ~n=3] [L8] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L10] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2] [L17-L25] ~n := #in~n; VAL [#in~n=2, ~n=2] [L18] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L20] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L23] CALL call #t~ret2 := fibo1(~n - 1); VAL [#in~n=1] [L7-L15] ~n := #in~n; VAL [#in~n=1, ~n=1] [L8] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L10] COND TRUE 1 == ~n [L11] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=2, #t~ret2=1, ~n=2] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=0] [L7-L15] ~n := #in~n; VAL [#in~n=0, ~n=0] [L8] COND TRUE ~n < 1 [L9] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2, #t~ret2=1, #t~ret3=0, ~n=2] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=2, #res=1, ~n=2] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L23] RET call #t~ret2 := fibo1(~n - 1); VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~n=4, #t~ret2=2, ~n=4] [L23] CALL call #t~ret3 := fibo1(~n - 2); VAL [#in~n=2] [L7-L15] ~n := #in~n; VAL [#in~n=2, ~n=2] [L8] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L10] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L13] CALL call #t~ret0 := fibo2(~n - 1); VAL [#in~n=1] [L17-L25] ~n := #in~n; VAL [#in~n=1, ~n=1] [L18] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L20] COND TRUE 1 == ~n [L21] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L13] RET call #t~ret0 := fibo2(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L13] CALL call #t~ret1 := fibo2(~n - 2); VAL [#in~n=0] [L17-L25] ~n := #in~n; VAL [#in~n=0, ~n=0] [L18] COND TRUE ~n < 1 [L19] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L23] RET call #t~ret3 := fibo1(~n - 2); VAL [#in~n=4, #t~ret2=2, #t~ret3=1, ~n=4] [L23] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L23] #res := #t~ret2 + #t~ret3; [L23] havoc #t~ret3; [L23] havoc #t~ret2; VAL [#in~n=4, #res=3, ~n=4] [L13] RET call #t~ret1 := fibo2(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L13] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L13] #res := #t~ret0 + #t~ret1; [L13] havoc #t~ret0; [L13] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=8, ~x~0=6] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=8, ~x~0=6] [L38] COND TRUE 8 == ~result~0 VAL [~result~0=8, ~x~0=6] [L39] assert false; VAL [~result~0=8, ~x~0=6] [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] ----- [2018-11-22 22:25:36,695 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7f63cdce-b454-4d81-9dd5-050db47ba341/bin-2019/uautomizer/witness.graphml [2018-11-22 22:25:36,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:25:36,696 INFO L168 Benchmark]: Toolchain (without parser) took 8293.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 351.3 MB). Free memory was 959.1 MB in the beginning and 876.3 MB in the end (delta: 82.8 MB). Peak memory consumption was 434.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:36,697 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:25:36,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.80 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:36,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.29 ms. Allocated memory is still 1.0 GB. Free memory is still 948.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:25:36,698 INFO L168 Benchmark]: Boogie Preprocessor took 12.42 ms. Allocated memory is still 1.0 GB. Free memory was 948.0 MB in the beginning and 945.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:36,698 INFO L168 Benchmark]: RCFGBuilder took 215.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:36,698 INFO L168 Benchmark]: TraceAbstraction took 7112.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 885.7 MB in the end (delta: 221.7 MB). Peak memory consumption was 440.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:36,699 INFO L168 Benchmark]: Witness Printer took 770.27 ms. Allocated memory is still 1.4 GB. Free memory was 885.7 MB in the beginning and 876.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:36,700 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.80 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.29 ms. Allocated memory is still 1.0 GB. Free memory is still 948.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.42 ms. Allocated memory is still 1.0 GB. Free memory was 948.0 MB in the beginning and 945.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 215.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7112.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 885.7 MB in the end (delta: 221.7 MB). Peak memory consumption was 440.3 MB. Max. memory is 11.5 GB. * Witness Printer took 770.27 ms. Allocated memory is still 1.4 GB. Free memory was 885.7 MB in the beginning and 876.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 7.0s OverallTime, 16 OverallIterations, 21 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 458 SDtfs, 699 SDslu, 2883 SDs, 0 SdLazy, 4011 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1819 GetRequests, 1528 SyntacticMatches, 3 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 153 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3296 NumberOfCodeBlocks, 3046 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3091 ConstructedInterpolants, 0 QuantifiedInterpolants, 742547 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2875 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 11364/13322 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...