./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/afterrec_2calls_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_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/afterrec_2calls_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/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 7757e3f263599cd02799bfad01adb3bcaa895e82
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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 08:28:29,695 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 08:28:29,696 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 08:28:29,703 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 08:28:29,703 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 08:28:29,704 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 08:28:29,705 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 08:28:29,706 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 08:28:29,707 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 08:28:29,708 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 08:28:29,708 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 08:28:29,708 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 08:28:29,709 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 08:28:29,710 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 08:28:29,711 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 08:28:29,711 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 08:28:29,712 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 08:28:29,713 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 08:28:29,715 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 08:28:29,716 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 08:28:29,717 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 08:28:29,718 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 08:28:29,719 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 08:28:29,719 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 08:28:29,720 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 08:28:29,720 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 08:28:29,721 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 08:28:29,722 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 08:28:29,722 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 08:28:29,723 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 08:28:29,723 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 08:28:29,724 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 08:28:29,724 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 08:28:29,724 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 08:28:29,725 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 08:28:29,725 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 08:28:29,725 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf
[2018-11-23 08:28:29,736 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 08:28:29,736 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 08:28:29,737 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-23 08:28:29,737 INFO  L133        SettingsManager]:  * ... to procedures called more than once=ALWAYS
[2018-11-23 08:28:29,738 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 08:28:29,738 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 08:28:29,738 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 08:28:29,738 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 08:28:29,738 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-23 08:28:29,738 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 08:28:29,739 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 08:28:29,739 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-23 08:28:29,739 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-23 08:28:29,739 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-23 08:28:29,739 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 08:28:29,739 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-23 08:28:29,739 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 08:28:29,739 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-23 08:28:29,739 INFO  L131        SettingsManager]: Preferences of CodeCheck differ from their defaults:
[2018-11-23 08:28:29,740 INFO  L133        SettingsManager]:  * Timeout in seconds=1000000
[2018-11-23 08:28:29,744 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 08:28:29,744 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-23 08:28:29,744 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000
[2018-11-23 08:28:29,744 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 08:28:29,744 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-23 08:28:29,745 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-23 08:28:29,745 INFO  L133        SettingsManager]:  * Trace refinement strategy=PENGUIN
[2018-11-23 08:28:29,745 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-23 08:28:29,745 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-11-23 08:28:29,745 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_b0fa1743-dfff-4b85-8b82-421952e38144/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 -> 7757e3f263599cd02799bfad01adb3bcaa895e82
[2018-11-23 08:28:29,770 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 08:28:29,779 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 08:28:29,782 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 08:28:29,783 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 08:28:29,783 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 08:28:29,784 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/../../sv-benchmarks/c/recursive-simple/afterrec_2calls_false-unreach-call_true-termination.c
[2018-11-23 08:28:29,832 INFO  L221              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/data/e26f7338e/f0035b9099ba4cb4b3b0a72f2ccb11c7/FLAG12d8de2c1
[2018-11-23 08:28:30,194 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 08:28:30,194 INFO  L161              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/sv-benchmarks/c/recursive-simple/afterrec_2calls_false-unreach-call_true-termination.c
[2018-11-23 08:28:30,200 INFO  L355              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/data/e26f7338e/f0035b9099ba4cb4b3b0a72f2ccb11c7/FLAG12d8de2c1
[2018-11-23 08:28:30,595 INFO  L363              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/data/e26f7338e/f0035b9099ba4cb4b3b0a72f2ccb11c7
[2018-11-23 08:28:30,598 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 08:28:30,599 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-23 08:28:30,599 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 08:28:30,599 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 08:28:30,602 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 08:28:30,602 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,604 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9b2349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30, skipping insertion in model container
[2018-11-23 08:28:30,604 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,610 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 08:28:30,622 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 08:28:30,720 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 08:28:30,722 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 08:28:30,730 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 08:28:30,738 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 08:28:30,738 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30 WrapperNode
[2018-11-23 08:28:30,738 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 08:28:30,738 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-23 08:28:30,739 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-23 08:28:30,739 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-23 08:28:30,744 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,747 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,756 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-23 08:28:30,756 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 08:28:30,756 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 08:28:30,756 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 08:28:30,761 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,762 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,762 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,762 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,763 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,764 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,764 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,765 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 08:28:30,765 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 08:28:30,765 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 08:28:30,765 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 08:28:30,766 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:30" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/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-11-23 08:28:30,835 INFO  L130     BoogieDeclarations]: Found specification of procedure f
[2018-11-23 08:28:30,835 INFO  L138     BoogieDeclarations]: Found implementation of procedure f
[2018-11-23 08:28:30,835 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 08:28:30,835 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 08:28:30,835 INFO  L130     BoogieDeclarations]: Found specification of procedure f2
[2018-11-23 08:28:30,835 INFO  L138     BoogieDeclarations]: Found implementation of procedure f2
[2018-11-23 08:28:30,923 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 08:28:30,923 INFO  L280             CfgBuilder]: Removed 4 assue(true) statements.
[2018-11-23 08:28:30,924 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:28:30 BoogieIcfgContainer
[2018-11-23 08:28:30,924 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 08:28:30,924 INFO  L113        PluginConnector]: ------------------------CodeCheck----------------------------
[2018-11-23 08:28:30,924 INFO  L271        PluginConnector]: Initializing CodeCheck...
[2018-11-23 08:28:30,931 INFO  L276        PluginConnector]: CodeCheck initialized
[2018-11-23 08:28:30,931 INFO  L185        PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:28:30" (1/1) ...
[2018-11-23 08:28:30,940 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 08:28:30,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-11-23 08:28:30,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 18 states and 20 transitions.
[2018-11-23 08:28:30,975 INFO  L276                IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2018-11-23 08:28:30,980 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2018-11-23 08:28:30,980 INFO  L427      CodeCheckObserver]: Error Path is FOUND.
[2018-11-23 08:28:31,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 08:28:31,105 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 08:28:31,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-11-23 08:28:31,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 19 states and 20 transitions.
[2018-11-23 08:28:31,226 INFO  L276                IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions.
[2018-11-23 08:28:31,227 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-11-23 08:28:31,227 INFO  L427      CodeCheckObserver]: Error Path is FOUND.
[2018-11-23 08:28:31,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 08:28:31,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 08:28:31,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 08:28:31,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 08:28:31,267 WARN  L493      CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations.
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator
[?]        havoc main_#res;
[?]  CALL  call f(4);
     VAL   [|f_#in~n|=4]
[?]        ~n := #in~n;
     VAL   [f_~n=4, |f_#in~n|=4]
[?]        assume !(~n < 3);#t~post2 := ~n;~n := #t~post2 - 1;havoc #t~post2;
     VAL   [f_~n=3, |f_#in~n|=4]
[?]  CALL  call f2(~n);
     VAL   [|f2_#in~n|=3]
[?]        ~n := #in~n;
     VAL   [f2_~n=3, |f2_#in~n|=3]
[?]        assume !(~n < 3);#t~post3 := ~n;~n := #t~post3 - 1;havoc #t~post3;
     VAL   [f2_~n=2, |f2_#in~n|=3]
[?]  CALL  call f(~n);
     VAL   [|f_#in~n|=2]
[?]        ~n := #in~n;
     VAL   [f_~n=2, |f_#in~n|=2]
[?]        assume ~n < 3;
     VAL   [f_~n=2, |f_#in~n|=2]
[?]        assume true;
     VAL   [f_~n=2, |f_#in~n|=2]
[?]  RET   #31#return;
     VAL   [f2_~n=2, |f2_#in~n|=3]
[?]        assume !false;
     VAL   [f2_~n=2, |f2_#in~n|=3]


[?]              havoc main_#res;
[L21]      CALL  call f(4);
           VAL   [#in~n=4]
[L6-L11]         ~n := #in~n;
           VAL   [#in~n=4, ~n=4]
[L7]             assume !(~n < 3);
[L8]             #t~post2 := ~n;
[L8]             ~n := #t~post2 - 1;
[L8]             havoc #t~post2;
           VAL   [#in~n=4, ~n=3]
[L9]       CALL  call f2(~n);
           VAL   [#in~n=3]
[L13-L18]        ~n := #in~n;
           VAL   [#in~n=3, ~n=3]
[L14]            assume !(~n < 3);
[L15]            #t~post3 := ~n;
[L15]            ~n := #t~post3 - 1;
[L15]            havoc #t~post3;
           VAL   [#in~n=3, ~n=2]
[L16]      CALL  call f(~n);
           VAL   [#in~n=2]
[L6-L11]         ~n := #in~n;
           VAL   [#in~n=2, ~n=2]
[L7]             assume ~n < 3;
           VAL   [#in~n=2, ~n=2]
[L3]             ensures true;
           VAL   [#in~n=2, ~n=2]
[L16]      RET   call f(~n);
           VAL   [#in~n=3, ~n=2]
[L17]            assert false;
           VAL   [#in~n=3, ~n=2]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]              havoc main_#res;
[L21]      CALL  call f(4);
           VAL   [#in~n=4]
[L6-L11]         ~n := #in~n;
           VAL   [#in~n=4, ~n=4]
[L7]             assume !(~n < 3);
[L8]             #t~post2 := ~n;
[L8]             ~n := #t~post2 - 1;
[L8]             havoc #t~post2;
           VAL   [#in~n=4, ~n=3]
[L9]       CALL  call f2(~n);
           VAL   [#in~n=3]
[L13-L18]        ~n := #in~n;
           VAL   [#in~n=3, ~n=3]
[L14]            assume !(~n < 3);
[L15]            #t~post3 := ~n;
[L15]            ~n := #t~post3 - 1;
[L15]            havoc #t~post3;
           VAL   [#in~n=3, ~n=2]
[L16]      CALL  call f(~n);
           VAL   [#in~n=2]
[L6-L11]         ~n := #in~n;
           VAL   [#in~n=2, ~n=2]
[L7]             assume ~n < 3;
           VAL   [#in~n=2, ~n=2]
[L3]             ensures true;
           VAL   [#in~n=2, ~n=2]
[L16]      RET   call f(~n);
           VAL   [#in~n=3, ~n=2]
[L17]            assert false;
           VAL   [#in~n=3, ~n=2]


[?]                    havoc main_#res;
[L21]      CALL        call f(4);
           VAL         [#in~n=4]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=4, ~n=4]
[L7]       COND FALSE  !(~n < 3)
[L8]                   #t~post2 := ~n;
[L8]                   ~n := #t~post2 - 1;
[L8]                   havoc #t~post2;
           VAL         [#in~n=4, ~n=3]
[L9]       CALL        call f2(~n);
           VAL         [#in~n=3]
[L13-L18]              ~n := #in~n;
           VAL         [#in~n=3, ~n=3]
[L14]      COND FALSE  !(~n < 3)
[L15]                  #t~post3 := ~n;
[L15]                  ~n := #t~post3 - 1;
[L15]                  havoc #t~post3;
           VAL         [#in~n=3, ~n=2]
[L16]      CALL        call f(~n);
           VAL         [#in~n=2]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=2, ~n=2]
[L7]       COND TRUE   ~n < 3
           VAL         [#in~n=2, ~n=2]
[L16]      RET         call f(~n);
           VAL         [#in~n=3, ~n=2]
[L17]                  assert false;
           VAL         [#in~n=3, ~n=2]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator
[?]                    havoc main_#res;
[L21]      CALL        call f(4);
           VAL         [#in~n=4]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=4, ~n=4]
[L7]       COND FALSE  !(~n < 3)
[L8]                   #t~post2 := ~n;
[L8]                   ~n := #t~post2 - 1;
[L8]                   havoc #t~post2;
           VAL         [#in~n=4, ~n=3]
[L9]       CALL        call f2(~n);
           VAL         [#in~n=3]
[L13-L18]              ~n := #in~n;
           VAL         [#in~n=3, ~n=3]
[L14]      COND FALSE  !(~n < 3)
[L15]                  #t~post3 := ~n;
[L15]                  ~n := #t~post3 - 1;
[L15]                  havoc #t~post3;
           VAL         [#in~n=3, ~n=2]
[L16]      CALL        call f(~n);
           VAL         [#in~n=2]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=2, ~n=2]
[L7]       COND TRUE   ~n < 3
           VAL         [#in~n=2, ~n=2]
[L16]      RET         call f(~n);
           VAL         [#in~n=3, ~n=2]
[L17]                  assert false;
           VAL         [#in~n=3, ~n=2]


[L21]      CALL        call f(4);
           VAL         [#in~n=4]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=4, ~n=4]
[L7]       COND FALSE  !(~n < 3)
[L8]                   #t~post2 := ~n;
[L8]                   ~n := #t~post2 - 1;
[L8]                   havoc #t~post2;
           VAL         [#in~n=4, ~n=3]
[L9]       CALL        call f2(~n);
           VAL         [#in~n=3]
[L13-L18]              ~n := #in~n;
           VAL         [#in~n=3, ~n=3]
[L14]      COND FALSE  !(~n < 3)
[L15]                  #t~post3 := ~n;
[L15]                  ~n := #t~post3 - 1;
[L15]                  havoc #t~post3;
           VAL         [#in~n=3, ~n=2]
[L16]      CALL        call f(~n);
           VAL         [#in~n=2]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=2, ~n=2]
[L7]       COND TRUE   ~n < 3
           VAL         [#in~n=2, ~n=2]
[L16]      RET         call f(~n);
           VAL         [#in~n=3, ~n=2]
[L17]                  assert false;
           VAL         [#in~n=3, ~n=2]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[L21]      CALL        call f(4);
           VAL         [#in~n=4]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=4, ~n=4]
[L7]       COND FALSE  !(~n < 3)
[L8]                   #t~post2 := ~n;
[L8]                   ~n := #t~post2 - 1;
[L8]                   havoc #t~post2;
           VAL         [#in~n=4, ~n=3]
[L9]       CALL        call f2(~n);
           VAL         [#in~n=3]
[L13-L18]              ~n := #in~n;
           VAL         [#in~n=3, ~n=3]
[L14]      COND FALSE  !(~n < 3)
[L15]                  #t~post3 := ~n;
[L15]                  ~n := #t~post3 - 1;
[L15]                  havoc #t~post3;
           VAL         [#in~n=3, ~n=2]
[L16]      CALL        call f(~n);
           VAL         [#in~n=2]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=2, ~n=2]
[L7]       COND TRUE   ~n < 3
           VAL         [#in~n=2, ~n=2]
[L16]      RET         call f(~n);
           VAL         [#in~n=3, ~n=2]
[L17]                  assert false;
           VAL         [#in~n=3, ~n=2]


[L21]  CALL        f(4)
       VAL         [\old(n)=4]
[L7]   COND FALSE  !(n<3)
[L8]               n--
       VAL         [\old(n)=4, n=3]
[L9]   CALL        f2(n)
       VAL         [\old(n)=3]
[L14]  COND FALSE  !(n<3)
[L15]              n--
       VAL         [\old(n)=3, n=2]
[L16]  CALL        f(n)
       VAL         [\old(n)=2]
[L7]   COND TRUE   n<3
       VAL         [\old(n)=2, n=2]
[L16]  RET         f(n)
       VAL         [\old(n)=3, n=2]
[L17]              __VERIFIER_error()
       VAL         [\old(n)=3, n=2]

-----
[2018-11-23 08:28:31,291 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 08:28:31 ImpRootNode
[2018-11-23 08:28:31,291 INFO  L132        PluginConnector]: ------------------------ END CodeCheck----------------------------
[2018-11-23 08:28:31,292 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 08:28:31,292 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 08:28:31,292 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 08:28:31,292 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:28:30" (3/4) ...
[2018-11-23 08:28:31,294 INFO  L138         WitnessPrinter]: Generating witness for reachability counterexample
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator
[?]        havoc main_#res;
[?]  CALL  call f(4);
     VAL   [|f_#in~n|=4]
[?]        ~n := #in~n;
     VAL   [f_~n=4, |f_#in~n|=4]
[?]        assume !(~n < 3);#t~post2 := ~n;~n := #t~post2 - 1;havoc #t~post2;
     VAL   [f_~n=3, |f_#in~n|=4]
[?]  CALL  call f2(~n);
     VAL   [|f2_#in~n|=3]
[?]        ~n := #in~n;
     VAL   [f2_~n=3, |f2_#in~n|=3]
[?]        assume !(~n < 3);#t~post3 := ~n;~n := #t~post3 - 1;havoc #t~post3;
     VAL   [f2_~n=2, |f2_#in~n|=3]
[?]  CALL  call f(~n);
     VAL   [|f_#in~n|=2]
[?]        ~n := #in~n;
     VAL   [f_~n=2, |f_#in~n|=2]
[?]        assume ~n < 3;
     VAL   [f_~n=2, |f_#in~n|=2]
[?]        assume true;
     VAL   [f_~n=2, |f_#in~n|=2]
[?]  RET   #31#return;
     VAL   [f2_~n=2, |f2_#in~n|=3]
[?]        assume !false;
     VAL   [f2_~n=2, |f2_#in~n|=3]


[?]              havoc main_#res;
[L21]      CALL  call f(4);
           VAL   [#in~n=4]
[L6-L11]         ~n := #in~n;
           VAL   [#in~n=4, ~n=4]
[L7]             assume !(~n < 3);
[L8]             #t~post2 := ~n;
[L8]             ~n := #t~post2 - 1;
[L8]             havoc #t~post2;
           VAL   [#in~n=4, ~n=3]
[L9]       CALL  call f2(~n);
           VAL   [#in~n=3]
[L13-L18]        ~n := #in~n;
           VAL   [#in~n=3, ~n=3]
[L14]            assume !(~n < 3);
[L15]            #t~post3 := ~n;
[L15]            ~n := #t~post3 - 1;
[L15]            havoc #t~post3;
           VAL   [#in~n=3, ~n=2]
[L16]      CALL  call f(~n);
           VAL   [#in~n=2]
[L6-L11]         ~n := #in~n;
           VAL   [#in~n=2, ~n=2]
[L7]             assume ~n < 3;
           VAL   [#in~n=2, ~n=2]
[L3]             ensures true;
           VAL   [#in~n=2, ~n=2]
[L16]      RET   call f(~n);
           VAL   [#in~n=3, ~n=2]
[L17]            assert false;
           VAL   [#in~n=3, ~n=2]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]              havoc main_#res;
[L21]      CALL  call f(4);
           VAL   [#in~n=4]
[L6-L11]         ~n := #in~n;
           VAL   [#in~n=4, ~n=4]
[L7]             assume !(~n < 3);
[L8]             #t~post2 := ~n;
[L8]             ~n := #t~post2 - 1;
[L8]             havoc #t~post2;
           VAL   [#in~n=4, ~n=3]
[L9]       CALL  call f2(~n);
           VAL   [#in~n=3]
[L13-L18]        ~n := #in~n;
           VAL   [#in~n=3, ~n=3]
[L14]            assume !(~n < 3);
[L15]            #t~post3 := ~n;
[L15]            ~n := #t~post3 - 1;
[L15]            havoc #t~post3;
           VAL   [#in~n=3, ~n=2]
[L16]      CALL  call f(~n);
           VAL   [#in~n=2]
[L6-L11]         ~n := #in~n;
           VAL   [#in~n=2, ~n=2]
[L7]             assume ~n < 3;
           VAL   [#in~n=2, ~n=2]
[L3]             ensures true;
           VAL   [#in~n=2, ~n=2]
[L16]      RET   call f(~n);
           VAL   [#in~n=3, ~n=2]
[L17]            assert false;
           VAL   [#in~n=3, ~n=2]


[?]                    havoc main_#res;
[L21]      CALL        call f(4);
           VAL         [#in~n=4]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=4, ~n=4]
[L7]       COND FALSE  !(~n < 3)
[L8]                   #t~post2 := ~n;
[L8]                   ~n := #t~post2 - 1;
[L8]                   havoc #t~post2;
           VAL         [#in~n=4, ~n=3]
[L9]       CALL        call f2(~n);
           VAL         [#in~n=3]
[L13-L18]              ~n := #in~n;
           VAL         [#in~n=3, ~n=3]
[L14]      COND FALSE  !(~n < 3)
[L15]                  #t~post3 := ~n;
[L15]                  ~n := #t~post3 - 1;
[L15]                  havoc #t~post3;
           VAL         [#in~n=3, ~n=2]
[L16]      CALL        call f(~n);
           VAL         [#in~n=2]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=2, ~n=2]
[L7]       COND TRUE   ~n < 3
           VAL         [#in~n=2, ~n=2]
[L16]      RET         call f(~n);
           VAL         [#in~n=3, ~n=2]
[L17]                  assert false;
           VAL         [#in~n=3, ~n=2]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator
[?]                    havoc main_#res;
[L21]      CALL        call f(4);
           VAL         [#in~n=4]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=4, ~n=4]
[L7]       COND FALSE  !(~n < 3)
[L8]                   #t~post2 := ~n;
[L8]                   ~n := #t~post2 - 1;
[L8]                   havoc #t~post2;
           VAL         [#in~n=4, ~n=3]
[L9]       CALL        call f2(~n);
           VAL         [#in~n=3]
[L13-L18]              ~n := #in~n;
           VAL         [#in~n=3, ~n=3]
[L14]      COND FALSE  !(~n < 3)
[L15]                  #t~post3 := ~n;
[L15]                  ~n := #t~post3 - 1;
[L15]                  havoc #t~post3;
           VAL         [#in~n=3, ~n=2]
[L16]      CALL        call f(~n);
           VAL         [#in~n=2]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=2, ~n=2]
[L7]       COND TRUE   ~n < 3
           VAL         [#in~n=2, ~n=2]
[L16]      RET         call f(~n);
           VAL         [#in~n=3, ~n=2]
[L17]                  assert false;
           VAL         [#in~n=3, ~n=2]


[L21]      CALL        call f(4);
           VAL         [#in~n=4]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=4, ~n=4]
[L7]       COND FALSE  !(~n < 3)
[L8]                   #t~post2 := ~n;
[L8]                   ~n := #t~post2 - 1;
[L8]                   havoc #t~post2;
           VAL         [#in~n=4, ~n=3]
[L9]       CALL        call f2(~n);
           VAL         [#in~n=3]
[L13-L18]              ~n := #in~n;
           VAL         [#in~n=3, ~n=3]
[L14]      COND FALSE  !(~n < 3)
[L15]                  #t~post3 := ~n;
[L15]                  ~n := #t~post3 - 1;
[L15]                  havoc #t~post3;
           VAL         [#in~n=3, ~n=2]
[L16]      CALL        call f(~n);
           VAL         [#in~n=2]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=2, ~n=2]
[L7]       COND TRUE   ~n < 3
           VAL         [#in~n=2, ~n=2]
[L16]      RET         call f(~n);
           VAL         [#in~n=3, ~n=2]
[L17]                  assert false;
           VAL         [#in~n=3, ~n=2]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[L21]      CALL        call f(4);
           VAL         [#in~n=4]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=4, ~n=4]
[L7]       COND FALSE  !(~n < 3)
[L8]                   #t~post2 := ~n;
[L8]                   ~n := #t~post2 - 1;
[L8]                   havoc #t~post2;
           VAL         [#in~n=4, ~n=3]
[L9]       CALL        call f2(~n);
           VAL         [#in~n=3]
[L13-L18]              ~n := #in~n;
           VAL         [#in~n=3, ~n=3]
[L14]      COND FALSE  !(~n < 3)
[L15]                  #t~post3 := ~n;
[L15]                  ~n := #t~post3 - 1;
[L15]                  havoc #t~post3;
           VAL         [#in~n=3, ~n=2]
[L16]      CALL        call f(~n);
           VAL         [#in~n=2]
[L6-L11]               ~n := #in~n;
           VAL         [#in~n=2, ~n=2]
[L7]       COND TRUE   ~n < 3
           VAL         [#in~n=2, ~n=2]
[L16]      RET         call f(~n);
           VAL         [#in~n=3, ~n=2]
[L17]                  assert false;
           VAL         [#in~n=3, ~n=2]


[L21]  CALL        f(4)
       VAL         [\old(n)=4]
[L7]   COND FALSE  !(n<3)
[L8]               n--
       VAL         [\old(n)=4, n=3]
[L9]   CALL        f2(n)
       VAL         [\old(n)=3]
[L14]  COND FALSE  !(n<3)
[L15]              n--
       VAL         [\old(n)=3, n=2]
[L16]  CALL        f(n)
       VAL         [\old(n)=2]
[L7]   COND TRUE   n<3
       VAL         [\old(n)=2, n=2]
[L16]  RET         f(n)
       VAL         [\old(n)=3, n=2]
[L17]              __VERIFIER_error()
       VAL         [\old(n)=3, n=2]

-----
[2018-11-23 08:28:31,328 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b0fa1743-dfff-4b85-8b82-421952e38144/bin-2019/ukojak/witness.graphml
[2018-11-23 08:28:31,329 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 08:28:31,329 INFO  L168              Benchmark]: Toolchain (without parser) took 730.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -121.0 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB.
[2018-11-23 08:28:31,331 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 08:28:31,331 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 138.82 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-11-23 08:28:31,331 INFO  L168              Benchmark]: Boogie Procedure Inliner took 17.67 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
[2018-11-23 08:28:31,332 INFO  L168              Benchmark]: Boogie Preprocessor took 8.84 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-23 08:28:31,332 INFO  L168              Benchmark]: RCFGBuilder took 158.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB.
[2018-11-23 08:28:31,332 INFO  L168              Benchmark]: CodeCheck took 367.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB.
[2018-11-23 08:28:31,333 INFO  L168              Benchmark]: Witness Printer took 37.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-23 08:28:31,335 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 3 procedures, 19 locations, 2 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11 SDtfs, 2 SDslu, 2 SDs, 0 SdLazy, 22 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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: 17]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L21]  CALL        f(4)
       VAL         [\old(n)=4]
[L7]   COND FALSE  !(n<3)
[L8]               n--
       VAL         [\old(n)=4, n=3]
[L9]   CALL        f2(n)
       VAL         [\old(n)=3]
[L14]  COND FALSE  !(n<3)
[L15]              n--
       VAL         [\old(n)=3, n=2]
[L16]  CALL        f(n)
       VAL         [\old(n)=2]
[L7]   COND TRUE   n<3
       VAL         [\old(n)=2, n=2]
[L16]  RET         f(n)
       VAL         [\old(n)=3, n=2]
[L17]              __VERIFIER_error()
       VAL         [\old(n)=3, n=2]

 * 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 138.82 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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 17.67 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 8.84 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * RCFGBuilder took 158.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB.
 * CodeCheck took 367.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB.
 * Witness Printer took 37.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...