./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/afterrec_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_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/afterrec_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e8f83f4c04fbac90273b8f8e733ac05d1463068f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:47:56,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:47:56,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:47:57,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:47:57,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:47:57,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:47:57,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:47:57,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:47:57,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:47:57,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:47:57,011 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:47:57,011 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:47:57,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:47:57,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:47:57,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:47:57,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:47:57,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:47:57,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:47:57,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:47:57,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:47:57,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:47:57,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:47:57,023 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:47:57,023 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:47:57,023 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:47:57,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:47:57,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:47:57,026 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:47:57,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:47:57,027 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:47:57,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:47:57,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:47:57,029 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:47:57,029 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:47:57,030 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:47:57,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:47:57,031 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 13:47:57,042 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:47:57,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:47:57,043 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:47:57,043 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:47:57,044 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:47:57,044 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:47:57,044 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:47:57,044 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 13:47:57,044 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:47:57,044 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:47:57,044 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 13:47:57,044 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 13:47:57,044 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:47:57,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:47:57,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:47:57,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:47:57,046 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:47:57,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:47:57,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:47:57,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:47:57,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:47:57,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:47:57,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:47:57,047 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:47:57,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:47:57,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:47:57,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:47:57,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:47:57,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:47:57,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:47:57,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:47:57,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:47:57,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:47:57,049 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 13:47:57,049 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:47:57,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:47:57,049 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:47:57,049 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e8f83f4c04fbac90273b8f8e733ac05d1463068f [2018-11-23 13:47:57,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:47:57,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:47:57,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:47:57,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:47:57,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:47:57,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/afterrec_false-unreach-call_true-termination.c [2018-11-23 13:47:57,127 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/data/451ac69ee/499c09ef894343739a95766f265bf783/FLAG4d04df237 [2018-11-23 13:47:57,472 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:47:57,473 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/sv-benchmarks/c/recursive-simple/afterrec_false-unreach-call_true-termination.c [2018-11-23 13:47:57,477 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/data/451ac69ee/499c09ef894343739a95766f265bf783/FLAG4d04df237 [2018-11-23 13:47:57,893 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/data/451ac69ee/499c09ef894343739a95766f265bf783 [2018-11-23 13:47:57,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:47:57,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:47:57,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:47:57,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:47:57,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:47:57,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:47:57" (1/1) ... [2018-11-23 13:47:57,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3605d9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:57, skipping insertion in model container [2018-11-23 13:47:57,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:47:57" (1/1) ... [2018-11-23 13:47:57,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:47:57,929 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:47:58,031 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:47:58,034 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:47:58,045 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:47:58,054 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:47:58,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58 WrapperNode [2018-11-23 13:47:58,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:47:58,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:47:58,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:47:58,055 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:47:58,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:47:58,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:47:58,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:47:58,070 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:47:58,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... [2018-11-23 13:47:58,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:47:58,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:47:58,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:47:58,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:47:58,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:47:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:47:58,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:47:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 13:47:58,165 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 13:47:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:47:58,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:47:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:47:58,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:47:58,251 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:47:58,251 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:47:58,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:58 BoogieIcfgContainer [2018-11-23 13:47:58,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:47:58,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:47:58,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:47:58,255 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:47:58,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:47:57" (1/3) ... [2018-11-23 13:47:58,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6982af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:47:58, skipping insertion in model container [2018-11-23 13:47:58,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:58" (2/3) ... [2018-11-23 13:47:58,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6982af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:47:58, skipping insertion in model container [2018-11-23 13:47:58,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:58" (3/3) ... [2018-11-23 13:47:58,259 INFO L112 eAbstractionObserver]: Analyzing ICFG afterrec_false-unreach-call_true-termination.c [2018-11-23 13:47:58,265 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:47:58,270 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:47:58,282 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:47:58,306 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:47:58,306 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:47:58,306 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:47:58,306 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:47:58,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:47:58,307 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:47:58,307 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:47:58,307 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:47:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-23 13:47:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:47:58,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:47:58,328 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:47:58,330 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:47:58,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:47:58,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1715138264, now seen corresponding path program 1 times [2018-11-23 13:47:58,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:47:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:47:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:47:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:47:58,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:47:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:47:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:47:58,421 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #19#return; [?] CALL call #t~ret1 := main(); [?] CALL call f(4); VAL [|f_#in~n|=4] [?] ~n := #in~n; VAL [f_~n=4, |f_#in~n|=4] [?] assume !(~n < 3);#t~post0 := ~n;~n := #t~post0 - 1;havoc #t~post0; VAL [f_~n=3, |f_#in~n|=4] [?] CALL call f(~n); VAL [|f_#in~n|=3] [?] ~n := #in~n; VAL [f_~n=3, |f_#in~n|=3] [?] assume !(~n < 3);#t~post0 := ~n;~n := #t~post0 - 1;havoc #t~post0; VAL [f_~n=2, |f_#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 #17#return; VAL [f_~n=2, |f_#in~n|=3] [?] assume !false; VAL [f_~n=2, |f_#in~n|=3] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] assume !(~n < 3); [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] assume !(~n < 3); [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] assume ~n < 3; VAL [#in~n=2, ~n=2] [L3-L8] ensures true; VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] assume !(~n < 3); [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] assume !(~n < 3); [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] assume ~n < 3; VAL [#in~n=2, ~n=2] [L3-L8] ensures true; VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] COND TRUE ~n < 3 VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] COND TRUE ~n < 3 VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] COND TRUE ~n < 3 VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] COND TRUE ~n < 3 VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] [L11] CALL f(4) VAL [\old(n)=4] [L4] COND FALSE !(n<3) [L5] n-- VAL [\old(n)=4, n=3] [L6] CALL f(n) VAL [\old(n)=3] [L4] COND FALSE !(n<3) [L5] n-- VAL [\old(n)=3, n=2] [L6] CALL f(n) VAL [\old(n)=2] [L4] COND TRUE n<3 VAL [\old(n)=2, n=2] [L6] RET f(n) VAL [\old(n)=3, n=2] [L7] __VERIFIER_error() VAL [\old(n)=3, n=2] ----- [2018-11-23 13:47:58,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:47:58 BoogieIcfgContainer [2018-11-23 13:47:58,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:47:58,445 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:47:58,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:47:58,445 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:47:58,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:58" (3/4) ... [2018-11-23 13:47:58,448 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #19#return; [?] CALL call #t~ret1 := main(); [?] CALL call f(4); VAL [|f_#in~n|=4] [?] ~n := #in~n; VAL [f_~n=4, |f_#in~n|=4] [?] assume !(~n < 3);#t~post0 := ~n;~n := #t~post0 - 1;havoc #t~post0; VAL [f_~n=3, |f_#in~n|=4] [?] CALL call f(~n); VAL [|f_#in~n|=3] [?] ~n := #in~n; VAL [f_~n=3, |f_#in~n|=3] [?] assume !(~n < 3);#t~post0 := ~n;~n := #t~post0 - 1;havoc #t~post0; VAL [f_~n=2, |f_#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 #17#return; VAL [f_~n=2, |f_#in~n|=3] [?] assume !false; VAL [f_~n=2, |f_#in~n|=3] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] assume !(~n < 3); [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] assume !(~n < 3); [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] assume ~n < 3; VAL [#in~n=2, ~n=2] [L3-L8] ensures true; VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] assume !(~n < 3); [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] assume !(~n < 3); [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] assume ~n < 3; VAL [#in~n=2, ~n=2] [L3-L8] ensures true; VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] COND TRUE ~n < 3 VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] COND TRUE ~n < 3 VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] COND TRUE ~n < 3 VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L11] CALL call f(4); VAL [#in~n=4] [L3-L8] ~n := #in~n; VAL [#in~n=4, ~n=4] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=4, ~n=3] [L6] CALL call f(~n); VAL [#in~n=3] [L3-L8] ~n := #in~n; VAL [#in~n=3, ~n=3] [L4] COND FALSE !(~n < 3) [L5] #t~post0 := ~n; [L5] ~n := #t~post0 - 1; [L5] havoc #t~post0; VAL [#in~n=3, ~n=2] [L6] CALL call f(~n); VAL [#in~n=2] [L3-L8] ~n := #in~n; VAL [#in~n=2, ~n=2] [L4] COND TRUE ~n < 3 VAL [#in~n=2, ~n=2] [L6] RET call f(~n); VAL [#in~n=3, ~n=2] [L7] assert false; VAL [#in~n=3, ~n=2] [L11] CALL f(4) VAL [\old(n)=4] [L4] COND FALSE !(n<3) [L5] n-- VAL [\old(n)=4, n=3] [L6] CALL f(n) VAL [\old(n)=3] [L4] COND FALSE !(n<3) [L5] n-- VAL [\old(n)=3, n=2] [L6] CALL f(n) VAL [\old(n)=2] [L4] COND TRUE n<3 VAL [\old(n)=2, n=2] [L6] RET f(n) VAL [\old(n)=3, n=2] [L7] __VERIFIER_error() VAL [\old(n)=3, n=2] ----- [2018-11-23 13:47:58,483 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5925d863-8867-421c-8b84-aed3bf1b2718/bin-2019/utaipan/witness.graphml [2018-11-23 13:47:58,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:47:58,484 INFO L168 Benchmark]: Toolchain (without parser) took 588.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:47:58,485 INFO L168 Benchmark]: CDTParser took 0.15 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 13:47:58,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:58,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.87 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:47:58,487 INFO L168 Benchmark]: Boogie Preprocessor took 12.45 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:58,487 INFO L168 Benchmark]: RCFGBuilder took 169.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:58,488 INFO L168 Benchmark]: TraceAbstraction took 191.49 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:58,488 INFO L168 Benchmark]: Witness Printer took 38.33 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 13:47:58,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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 157.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.87 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.45 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 169.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 191.49 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 38.33 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] CALL f(4) VAL [\old(n)=4] [L4] COND FALSE !(n<3) [L5] n-- VAL [\old(n)=4, n=3] [L6] CALL f(n) VAL [\old(n)=3] [L4] COND FALSE !(n<3) [L5] n-- VAL [\old(n)=3, n=2] [L6] CALL f(n) VAL [\old(n)=2] [L4] COND TRUE n<3 VAL [\old(n)=2, n=2] [L6] RET f(n) VAL [\old(n)=3, n=2] [L7] __VERIFIER_error() VAL [\old(n)=3, n=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 16 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...