./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_2_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_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_2_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d7907681604b1ce9d21af31806cc60e045b313d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-23 12:23:50,692 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:23:50,694 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:23:50,701 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:23:50,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:23:50,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:23:50,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:23:50,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:23:50,704 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:23:50,705 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:23:50,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:23:50,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:23:50,706 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:23:50,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:23:50,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:23:50,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:23:50,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:23:50,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:23:50,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:23:50,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:23:50,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:23:50,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:23:50,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:23:50,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:23:50,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:23:50,714 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:23:50,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:23:50,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:23:50,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:23:50,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:23:50,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:23:50,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:23:50,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:23:50,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:23:50,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:23:50,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:23:50,719 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:23:50,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:23:50,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:23:50,727 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:23:50,727 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:23:50,727 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:23:50,727 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:23:50,727 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:23:50,727 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:23:50,727 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:23:50,728 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:23:50,728 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:23:50,728 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:23:50,728 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:23:50,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:23:50,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:23:50,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:23:50,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:23:50,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:23:50,729 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:23:50,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:23:50,729 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:23:50,729 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:23:50,730 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:23:50,730 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:23:50,730 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:23:50,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:23:50,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:23:50,730 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:23:50,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:23:50,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:50,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:23:50,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:23:50,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:23:50,731 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:23:50,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:23:50,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:23:50,731 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:23:50,732 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d7907681604b1ce9d21af31806cc60e045b313d [2018-11-23 12:23:50,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:23:50,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:23:50,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:23:50,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:23:50,768 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:23:50,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_2_false-unreach-call_true-termination.c [2018-11-23 12:23:50,813 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/data/e63ddced2/e83364017cc6416681a12b96ff73aba9/FLAGbfd2e1216 [2018-11-23 12:23:51,207 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:23:51,207 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/sv-benchmarks/c/recursive-simple/fibo_2calls_2_false-unreach-call_true-termination.c [2018-11-23 12:23:51,212 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/data/e63ddced2/e83364017cc6416681a12b96ff73aba9/FLAGbfd2e1216 [2018-11-23 12:23:51,220 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/data/e63ddced2/e83364017cc6416681a12b96ff73aba9 [2018-11-23 12:23:51,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:23:51,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:23:51,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:51,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:23:51,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:23:51,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9989bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51, skipping insertion in model container [2018-11-23 12:23:51,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:23:51,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:23:51,359 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:51,361 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:23:51,371 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:51,379 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:23:51,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51 WrapperNode [2018-11-23 12:23:51,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:51,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:51,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:23:51,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:23:51,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:51,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:23:51,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:23:51,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:23:51,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... [2018-11-23 12:23:51,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:23:51,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:23:51,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:23:51,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:23:51,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:23:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:23:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:23:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:23:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:23:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:23:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-23 12:23:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-23 12:23:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-23 12:23:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-23 12:23:51,586 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:23:51,586 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:23:51,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:51 BoogieIcfgContainer [2018-11-23 12:23:51,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:23:51,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:23:51,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:23:51,589 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:23:51,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:23:51" (1/3) ... [2018-11-23 12:23:51,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b5bbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:51, skipping insertion in model container [2018-11-23 12:23:51,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:51" (2/3) ... [2018-11-23 12:23:51,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b5bbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:51, skipping insertion in model container [2018-11-23 12:23:51,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:51" (3/3) ... [2018-11-23 12:23:51,591 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2_false-unreach-call_true-termination.c [2018-11-23 12:23:51,600 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:23:51,605 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:23:51,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:23:51,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:23:51,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:23:51,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:23:51,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:23:51,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:23:51,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:23:51,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:23:51,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:23:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 12:23:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:23:51,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:51,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:51,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:51,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-23 12:23:51,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:23:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:51,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:51,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:23:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:51,761 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-23 12:23:51,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:51,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:23:51,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:23:51,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:23:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:23:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:23:51,776 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-23 12:23:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:51,854 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 12:23:51,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:23:51,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:23:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:51,861 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:23:51,861 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:23:51,863 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-23 12:23:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:23:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:23:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:23:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 12:23:51,889 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-23 12:23:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:51,889 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 12:23:51,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:23:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:23:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:23:51,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:51,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:51,891 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:51,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:51,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-23 12:23:51,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:23:51,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:51,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:51,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:51,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:23:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:51,923 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-23 12:23:51,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:51,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:23:51,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:23:51,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:23:51,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:23:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:23:51,933 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-23 12:23:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:51,993 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 12:23:51,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:23:51,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:23:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:51,994 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:23:51,994 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:23:51,995 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-23 12:23:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:23:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 12:23:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:23:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 12:23:52,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-23 12:23:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:52,001 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 12:23:52,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:23:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:23:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:23:52,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:52,002 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-23 12:23:52,002 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:52,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:52,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-23 12:23:52,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:23:52,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:52,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:52,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:52,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:23:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:52,074 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-23 12:23:52,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:52,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:23:52,075 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-23 12:23:52,077 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-11-23 12:23:52,100 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:23:52,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:23:52,168 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 12:23:52,168 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-11-23 12:23:52,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:52,173 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 12:23:52,202 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-23 12:23:52,202 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 12:23:52,218 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-23 12:23:52,219 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 12:23:52,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:23:52,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-23 12:23:52,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:23:52,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:23:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:23:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:23:52,220 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-23 12:23:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:52,356 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2018-11-23 12:23:52,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:23:52,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:23:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:52,357 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:23:52,357 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:23:52,357 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 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-23 12:23:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:23:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 12:23:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:23:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 12:23:52,362 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 26 [2018-11-23 12:23:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:52,363 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 12:23:52,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:23:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:23:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:23:52,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:52,364 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-23 12:23:52,364 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:52,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:52,364 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-23 12:23:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:23:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:52,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:52,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:23:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:23:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:23:52,391 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 := 2; VAL [main_~x~0=2] [?] CALL call #t~ret4 := fibo1(~x~0); 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 #51#return; VAL [main_~x~0=2, |main_#t~ret4|=1] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=1, main_~x~0=2] [?] assume 1 == ~result~0; VAL [main_~result~0=1, main_~x~0=2] [?] assume !false; VAL [main_~result~0=1, main_~x~0=2] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38-L40] assume 1 == ~result~0; VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] ----- ----- 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 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38-L40] assume 1 == ~result~0; VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38] COND TRUE 1 == ~result~0 VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] ----- ----- 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 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38] COND TRUE 1 == ~result~0 VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38] COND TRUE 1 == ~result~0 VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] ----- ----- 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 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38] COND TRUE 1 == ~result~0 VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] [L36] int x = 2; VAL [x=2] [L37] CALL, EXPR fibo1(x) 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); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=1, x=2] [L37] int result = fibo1(x); [L38] COND TRUE result == 1 VAL [result=1, x=2] [L39] __VERIFIER_error() VAL [result=1, x=2] ----- [2018-11-23 12:23:52,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:23:52 BoogieIcfgContainer [2018-11-23 12:23:52,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:23:52,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:23:52,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:23:52,416 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:23:52,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:51" (3/4) ... [2018-11-23 12:23:52,418 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 := 2; VAL [main_~x~0=2] [?] CALL call #t~ret4 := fibo1(~x~0); 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 #51#return; VAL [main_~x~0=2, |main_#t~ret4|=1] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~result~0=1, main_~x~0=2] [?] assume 1 == ~result~0; VAL [main_~result~0=1, main_~x~0=2] [?] assume !false; VAL [main_~result~0=1, main_~x~0=2] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38-L40] assume 1 == ~result~0; VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] ----- ----- 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 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38-L40] assume 1 == ~result~0; VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38] COND TRUE 1 == ~result~0 VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] ----- ----- 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 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38] COND TRUE 1 == ~result~0 VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L36] ~x~0 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38] COND TRUE 1 == ~result~0 VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] ----- ----- 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 := 2; VAL [~x~0=2] [L37] CALL call #t~ret4 := fibo1(~x~0); 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] [L37] RET call #t~ret4 := fibo1(~x~0); VAL [#t~ret4=1, ~x~0=2] [L37] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L37] ~result~0 := #t~ret4; [L37] havoc #t~ret4; VAL [~result~0=1, ~x~0=2] [L38] COND TRUE 1 == ~result~0 VAL [~result~0=1, ~x~0=2] [L39] assert false; VAL [~result~0=1, ~x~0=2] [L36] int x = 2; VAL [x=2] [L37] CALL, EXPR fibo1(x) 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); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=1, x=2] [L37] int result = fibo1(x); [L38] COND TRUE result == 1 VAL [result=1, x=2] [L39] __VERIFIER_error() VAL [result=1, x=2] ----- [2018-11-23 12:23:52,456 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_003eff7a-bc1b-40e1-adb1-7d13916e32d4/bin-2019/utaipan/witness.graphml [2018-11-23 12:23:52,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:23:52,457 INFO L168 Benchmark]: Toolchain (without parser) took 1234.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -73.6 MB). Peak memory consumption was 63.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:23:52,458 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:23:52,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.44 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:23:52,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:23:52,459 INFO L168 Benchmark]: Boogie Preprocessor took 10.29 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:23:52,460 INFO L168 Benchmark]: RCFGBuilder took 185.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:23:52,460 INFO L168 Benchmark]: TraceAbstraction took 828.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.1 MB). Peak memory consumption was 87.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:23:52,460 INFO L168 Benchmark]: Witness Printer took 40.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:23:52,463 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.44 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.29 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 185.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 828.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.1 MB). Peak memory consumption was 87.1 MB. Max. memory is 11.5 GB. * Witness Printer took 40.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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 = 2; VAL [x=2] [L37] CALL, EXPR fibo1(x) 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); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=1, x=2] [L37] int result = fibo1(x); [L38] COND TRUE result == 1 VAL [result=1, x=2] [L39] __VERIFIER_error() VAL [result=1, x=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 90 SDtfs, 44 SDslu, 279 SDs, 0 SdLazy, 63 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.84 AbsIntWeakeningRatio, 0.56 AbsIntAvgWeakeningVarsNumRemoved, 0.16 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 1414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...