./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0bc64117ef8398002009c167867d7baf0a85044 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-10-26 23:25:00,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:25:00,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:25:00,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:25:00,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:25:00,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:25:00,568 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:25:00,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:25:00,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:25:00,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:25:00,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:25:00,574 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:25:00,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:25:00,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:25:00,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:25:00,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:25:00,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:25:00,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:25:00,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:25:00,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:25:00,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:25:00,584 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:25:00,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:25:00,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:25:00,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:25:00,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:25:00,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:25:00,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:25:00,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:25:00,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:25:00,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:25:00,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:25:00,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:25:00,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:25:00,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:25:00,595 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:25:00,595 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 23:25:00,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:25:00,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:25:00,607 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:25:00,608 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 23:25:00,608 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 23:25:00,608 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 23:25:00,608 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:25:00,609 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:25:00,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:25:00,609 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:25:00,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:25:00,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:25:00,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:25:00,609 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:25:00,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:25:00,610 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:25:00,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:25:00,610 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 23:25:00,612 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 23:25:00,612 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:25:00,612 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:25:00,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 23:25:00,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:25:00,613 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:25:00,613 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:25:00,613 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 23:25:00,613 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:25:00,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:25:00,613 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_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-10-26 23:25:00,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:25:00,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:25:00,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:25:00,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:25:00,657 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:25:00,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 23:25:00,705 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/data/fbdd5c84d/6e13a7075af64bfcb7c9da57a8f73978/FLAG05dadfd1d [2018-10-26 23:25:01,071 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:25:01,072 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 23:25:01,077 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/data/fbdd5c84d/6e13a7075af64bfcb7c9da57a8f73978/FLAG05dadfd1d [2018-10-26 23:25:01,089 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/data/fbdd5c84d/6e13a7075af64bfcb7c9da57a8f73978 [2018-10-26 23:25:01,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:25:01,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:25:01,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:25:01,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:25:01,100 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:25:01,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe2c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01, skipping insertion in model container [2018-10-26 23:25:01,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:25:01,126 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:25:01,243 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:25:01,247 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:25:01,260 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:25:01,271 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:25:01,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01 WrapperNode [2018-10-26 23:25:01,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:25:01,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:25:01,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:25:01,273 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:25:01,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:25:01,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:25:01,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:25:01,301 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:25:01,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:25:01,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:25:01,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:25:01,317 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:25:01,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 23:25:01,466 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-10-26 23:25:01,467 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-10-26 23:25:01,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:25:01,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:25:01,743 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:25:01,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:25:01 BoogieIcfgContainer [2018-10-26 23:25:01,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:25:01,744 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 23:25:01,744 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 23:25:01,755 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 23:25:01,755 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:25:01" (1/1) ... [2018-10-26 23:25:01,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2018-10-26 23:25:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-10-26 23:25:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 23:25:01,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:25:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-10-26 23:25:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-10-26 23:25:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 23:25:02,286 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:25:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2018-10-26 23:25:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-10-26 23:25:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 23:25:02,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:25:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2018-10-26 23:25:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-10-26 23:25:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 23:25:03,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:25:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2018-10-26 23:25:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2018-10-26 23:25:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 23:25:03,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:25:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 32 states and 48 transitions. [2018-10-26 23:25:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2018-10-26 23:25:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 23:25:03,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 23:25:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 37 states and 60 transitions. [2018-10-26 23:25:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2018-10-26 23:25:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 23:25:04,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 23:25:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 39 states and 64 transitions. [2018-10-26 23:25:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions. [2018-10-26 23:25:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 23:25:04,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-26 23:25:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 44 states and 78 transitions. [2018-10-26 23:25:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-10-26 23:25:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 23:25:04,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-26 23:25:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 46 states and 82 transitions. [2018-10-26 23:25:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 82 transitions. [2018-10-26 23:25:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:25:05,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-10-26 23:25:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 53 states and 102 transitions. [2018-10-26 23:25:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 102 transitions. [2018-10-26 23:25:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-26 23:25:06,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 171 proven. 747 refuted. 0 times theorem prover too weak. 3195 trivial. 0 not checked. [2018-10-26 23:25:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 60 states and 124 transitions. [2018-10-26 23:25:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 124 transitions. [2018-10-26 23:25:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-26 23:25:06,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7758 backedges. 422 proven. 1230 refuted. 0 times theorem prover too weak. 6106 trivial. 0 not checked. [2018-10-26 23:25:09,400 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-26 23:25:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 62 states and 126 transitions. [2018-10-26 23:25:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions. [2018-10-26 23:25:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-26 23:25:09,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6549 backedges. 820 proven. 366 refuted. 0 times theorem prover too weak. 5363 trivial. 0 not checked. [2018-10-26 23:25:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 67 states and 146 transitions. [2018-10-26 23:25:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 146 transitions. [2018-10-26 23:25:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-26 23:25:10,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 299 proven. 1577 refuted. 0 times theorem prover too weak. 9071 trivial. 0 not checked. [2018-10-26 23:25:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 69 states and 150 transitions. [2018-10-26 23:25:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 150 transitions. [2018-10-26 23:25:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-10-26 23:25:11,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 991 proven. 3782 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked. [2018-10-26 23:25:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 71 states and 152 transitions. [2018-10-26 23:25:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 152 transitions. [2018-10-26 23:25:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-10-26 23:25:12,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 991 proven. 3782 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked. [2018-10-26 23:25:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 71 states and 152 transitions. [2018-10-26 23:25:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 152 transitions. [2018-10-26 23:25:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-10-26 23:25:13,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 935 proven. 3838 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked. [2018-10-26 23:25:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 71 states and 152 transitions. [2018-10-26 23:25:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 152 transitions. [2018-10-26 23:25:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-10-26 23:25:14,328 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 1305 proven. 4613 refuted. 0 times theorem prover too weak. 23597 trivial. 0 not checked. [2018-10-26 23:25:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 73 states and 154 transitions. [2018-10-26 23:25:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 154 transitions. [2018-10-26 23:25:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-26 23:25:15,825 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1915 proven. 3262 refuted. 0 times theorem prover too weak. 13926 trivial. 0 not checked. [2018-10-26 23:25:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 75 states and 156 transitions. [2018-10-26 23:25:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 156 transitions. [2018-10-26 23:25:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-26 23:25:17,328 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1915 proven. 3262 refuted. 0 times theorem prover too weak. 13926 trivial. 0 not checked. [2018-10-26 23:25:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 75 states and 156 transitions. [2018-10-26 23:25:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 156 transitions. [2018-10-26 23:25:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-10-26 23:25:17,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27189 backedges. 780 proven. 3500 refuted. 0 times theorem prover too weak. 22909 trivial. 0 not checked. [2018-10-26 23:25:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 77 states and 158 transitions. [2018-10-26 23:25:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 158 transitions. [2018-10-26 23:25:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-10-26 23:25:18,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 1305 proven. 4613 refuted. 0 times theorem prover too weak. 23597 trivial. 0 not checked. [2018-10-26 23:25:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 77 states and 158 transitions. [2018-10-26 23:25:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 158 transitions. [2018-10-26 23:25:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-26 23:25:19,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1915 proven. 3262 refuted. 0 times theorem prover too weak. 13926 trivial. 0 not checked. [2018-10-26 23:25:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 77 states and 158 transitions. [2018-10-26 23:25:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 158 transitions. [2018-10-26 23:25:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-10-26 23:25:19,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 1305 proven. 4613 refuted. 0 times theorem prover too weak. 23597 trivial. 0 not checked. [2018-10-26 23:25:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 77 states and 158 transitions. [2018-10-26 23:25:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 158 transitions. [2018-10-26 23:25:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-26 23:25:20,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:25:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:25:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:25:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:25:21,259 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 25 iterations. [2018-10-26 23:25:21,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 11:25:21 ImpRootNode [2018-10-26 23:25:21,385 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 23:25:21,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:25:21,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:25:21,386 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:25:21,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:25:01" (3/4) ... [2018-10-26 23:25:21,388 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:25:21,540 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ef852a2-9cbf-435e-b38d-7cce8acaeb53/bin-2019/ukojak/witness.graphml [2018-10-26 23:25:21,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:25:21,541 INFO L168 Benchmark]: Toolchain (without parser) took 20446.14 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 582.5 MB). Free memory was 963.4 MB in the beginning and 1.3 GB in the end (delta: -376.0 MB). Peak memory consumption was 206.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:21,541 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:25:21,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.73 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:21,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.42 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:25:21,542 INFO L168 Benchmark]: Boogie Preprocessor took 15.76 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 947.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:21,542 INFO L168 Benchmark]: RCFGBuilder took 426.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -208.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:21,543 INFO L168 Benchmark]: CodeCheck took 19641.03 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 413.7 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -184.1 MB). Peak memory consumption was 229.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:21,543 INFO L168 Benchmark]: Witness Printer took 154.77 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-10-26 23:25:21,544 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 19 locations, 1 error locations. UNSAFE Result, 19.4s OverallTime, 25 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 120314272 SDtfs, 124565920 SDslu, 198800192 SDs, 0 SdLazy, 535288176 SolverSat, 145357168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22915 GetRequests, 21884 SyntacticMatches, 887 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18473 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 8763 NumberOfCodeBlocks, 8763 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 8280 ConstructedInterpolants, 0 QuantifiedInterpolants, 5942920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 236518/279386 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L27] EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() * 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 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.73 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 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 28.42 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.76 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 947.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 426.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -208.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * CodeCheck took 19641.03 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 413.7 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -184.1 MB). Peak memory consumption was 229.6 MB. Max. memory is 11.5 GB. * Witness Printer took 154.77 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...