./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-5842f4b [2018-11-18 14:02:45,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:02:45,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:02:45,771 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:02:45,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:02:45,772 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:02:45,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:02:45,774 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:02:45,775 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:02:45,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:02:45,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:02:45,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:02:45,777 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:02:45,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:02:45,779 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:02:45,779 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:02:45,780 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:02:45,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:02:45,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:02:45,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:02:45,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:02:45,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:02:45,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:02:45,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:02:45,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:02:45,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:02:45,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:02:45,788 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:02:45,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:02:45,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:02:45,790 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:02:45,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:02:45,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:02:45,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:02:45,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:02:45,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:02:45,792 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 14:02:45,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:02:45,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:02:45,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:02:45,802 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 14:02:45,802 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:02:45,802 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:02:45,802 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:02:45,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:02:45,803 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:02:45,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:02:45,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:02:45,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:02:45,803 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:02:45,803 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:02:45,803 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:02:45,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:02:45,804 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:02:45,804 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:02:45,804 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:02:45,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:02:45,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:02:45,804 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:02:45,804 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:02:45,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:02:45,805 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:02:45,805 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:02:45,805 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:02:45,805 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:02:45,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:02:45,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:02:45,806 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_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-11-18 14:02:45,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:02:45,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:02:45,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:02:45,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:02:45,843 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:02:45,843 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-18 14:02:45,878 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/data/aa9b756e6/4eaefe59f58f420dba922476cb8071c6/FLAGc540f583f [2018-11-18 14:02:46,218 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:02:46,218 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-18 14:02:46,223 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/data/aa9b756e6/4eaefe59f58f420dba922476cb8071c6/FLAGc540f583f [2018-11-18 14:02:46,637 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/data/aa9b756e6/4eaefe59f58f420dba922476cb8071c6 [2018-11-18 14:02:46,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:02:46,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 14:02:46,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:02:46,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:02:46,643 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:02:46,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6180e9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46, skipping insertion in model container [2018-11-18 14:02:46,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:02:46,661 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:02:46,764 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:02:46,766 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:02:46,776 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:02:46,784 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:02:46,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46 WrapperNode [2018-11-18 14:02:46,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:02:46,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:02:46,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:02:46,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:02:46,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (1/1) ... [2018-11-18 14:02:46,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:02:46,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:02:46,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:02:46,800 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:02:46,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:02:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:02:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:02:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-18 14:02:46,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:02:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 14:02:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 14:02:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-18 14:02:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:02:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:02:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:02:46,960 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:02:46,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:02:46 BoogieIcfgContainer [2018-11-18 14:02:46,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:02:46,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:02:46,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:02:46,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:02:46,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:02:46" (1/3) ... [2018-11-18 14:02:46,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:02:46, skipping insertion in model container [2018-11-18 14:02:46,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:02:46" (2/3) ... [2018-11-18 14:02:46,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:02:46, skipping insertion in model container [2018-11-18 14:02:46,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:02:46" (3/3) ... [2018-11-18 14:02:46,966 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-18 14:02:46,974 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:02:46,980 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:02:46,992 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:02:47,010 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:02:47,011 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:02:47,011 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:02:47,011 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:02:47,011 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:02:47,011 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:02:47,011 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:02:47,011 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:02:47,011 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:02:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 14:02:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 14:02:47,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:47,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:47,031 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:47,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:47,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-11-18 14:02:47,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:47,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:47,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:47,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:47,159 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-18 14:02:47,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:02:47,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:02:47,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:02:47,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:02:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:02:47,172 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-18 14:02:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:47,238 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-18 14:02:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:02:47,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 14:02:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:47,245 INFO L225 Difference]: With dead ends: 35 [2018-11-18 14:02:47,246 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 14:02:47,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:02:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 14:02:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 14:02:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 14:02:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-18 14:02:47,275 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-18 14:02:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:47,275 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 14:02:47,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:02:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-18 14:02:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 14:02:47,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:47,277 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:47,277 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:47,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-11-18 14:02:47,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:47,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:47,315 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-18 14:02:47,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:02:47,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:02:47,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:02:47,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:02:47,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:02:47,318 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-18 14:02:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:47,382 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-18 14:02:47,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:02:47,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 14:02:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:47,383 INFO L225 Difference]: With dead ends: 27 [2018-11-18 14:02:47,383 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 14:02:47,384 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:02:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 14:02:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-18 14:02:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 14:02:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-18 14:02:47,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-18 14:02:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:47,388 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 14:02:47,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:02:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-18 14:02:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 14:02:47,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:47,389 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:47,389 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:47,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-11-18 14:02:47,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:47,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:02:47,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:47,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:47,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:47,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:02:47,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:47,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-18 14:02:47,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:02:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:02:47,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 14:02:47,549 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-18 14:02:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:47,653 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-18 14:02:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:02:47,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-18 14:02:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:47,656 INFO L225 Difference]: With dead ends: 38 [2018-11-18 14:02:47,656 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 14:02:47,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:02:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 14:02:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 14:02:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 14:02:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-18 14:02:47,661 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-18 14:02:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:47,661 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-18 14:02:47,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:02:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-18 14:02:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 14:02:47,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:47,662 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:47,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:47,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:47,663 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-11-18 14:02:47,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:47,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:02:47,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:47,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:47,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:47,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:02:47,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:47,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 14:02:47,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:02:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:02:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:02:47,764 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-18 14:02:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:47,822 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-18 14:02:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:02:47,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-18 14:02:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:47,824 INFO L225 Difference]: With dead ends: 32 [2018-11-18 14:02:47,824 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 14:02:47,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 14:02:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 14:02:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 14:02:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 14:02:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 14:02:47,830 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-18 14:02:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:47,830 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 14:02:47,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:02:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-18 14:02:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 14:02:47,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:47,831 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:47,831 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:47,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-11-18 14:02:47,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:47,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 14:02:47,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:47,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:47,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:02:47,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:02:47,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:02:47,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 14:02:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:47,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-18 14:02:47,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:02:47,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:02:47,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:02:47,977 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 9 states. [2018-11-18 14:02:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:48,080 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2018-11-18 14:02:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:02:48,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-18 14:02:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:48,082 INFO L225 Difference]: With dead ends: 42 [2018-11-18 14:02:48,082 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 14:02:48,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:02:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 14:02:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-18 14:02:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 14:02:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-18 14:02:48,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-18 14:02:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:48,089 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-18 14:02:48,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:02:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-18 14:02:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 14:02:48,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:48,091 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:48,091 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:48,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2018-11-18 14:02:48,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:48,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:48,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:02:48,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-18 14:02:48,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:48,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:48,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:02:48,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 14:02:48,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:02:48,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-18 14:02:48,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:48,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-18 14:02:48,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:02:48,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:02:48,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:02:48,310 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-18 14:02:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:48,505 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-18 14:02:48,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:02:48,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-18 14:02:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:48,508 INFO L225 Difference]: With dead ends: 76 [2018-11-18 14:02:48,508 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 14:02:48,508 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:02:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 14:02:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-18 14:02:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 14:02:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-18 14:02:48,517 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-18 14:02:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:48,518 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-18 14:02:48,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:02:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-18 14:02:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 14:02:48,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:48,520 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:48,520 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:48,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1541039141, now seen corresponding path program 4 times [2018-11-18 14:02:48,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:48,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:48,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:48,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:02:48,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-18 14:02:48,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:48,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:48,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:02:48,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:02:48,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:02:48,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 74 proven. 118 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-18 14:02:48,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:48,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2018-11-18 14:02:48,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 14:02:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 14:02:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:02:48,712 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 13 states. [2018-11-18 14:02:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:48,915 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-11-18 14:02:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 14:02:48,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-11-18 14:02:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:48,915 INFO L225 Difference]: With dead ends: 91 [2018-11-18 14:02:48,916 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 14:02:48,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2018-11-18 14:02:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 14:02:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-18 14:02:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 14:02:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-18 14:02:48,921 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 82 [2018-11-18 14:02:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:48,921 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-18 14:02:48,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 14:02:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-18 14:02:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 14:02:48,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:48,923 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:48,923 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:48,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1066463687, now seen corresponding path program 5 times [2018-11-18 14:02:48,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:48,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:48,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:02:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-11-18 14:02:48,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:48,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:49,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 14:02:49,029 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-18 14:02:49,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:02:49,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-11-18 14:02:49,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:49,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 14 [2018-11-18 14:02:49,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 14:02:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 14:02:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-18 14:02:49,131 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 14 states. [2018-11-18 14:02:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:49,356 INFO L93 Difference]: Finished difference Result 114 states and 155 transitions. [2018-11-18 14:02:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 14:02:49,357 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-11-18 14:02:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:49,358 INFO L225 Difference]: With dead ends: 114 [2018-11-18 14:02:49,358 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 14:02:49,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2018-11-18 14:02:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 14:02:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-11-18 14:02:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 14:02:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-11-18 14:02:49,365 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 136 [2018-11-18 14:02:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:49,365 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-11-18 14:02:49,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 14:02:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2018-11-18 14:02:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 14:02:49,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:49,368 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:49,368 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:49,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 6 times [2018-11-18 14:02:49,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:49,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:49,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:02:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-11-18 14:02:49,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:49,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:49,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 14:02:49,502 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-18 14:02:49,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:02:49,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-11-18 14:02:49,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:49,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 14:02:49,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:02:49,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:02:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:02:49,576 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 9 states. [2018-11-18 14:02:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:49,637 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2018-11-18 14:02:49,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:02:49,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2018-11-18 14:02:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:49,639 INFO L225 Difference]: With dead ends: 78 [2018-11-18 14:02:49,639 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 14:02:49,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-18 14:02:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 14:02:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-18 14:02:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 14:02:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2018-11-18 14:02:49,646 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 177 [2018-11-18 14:02:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:49,646 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2018-11-18 14:02:49,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:02:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2018-11-18 14:02:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-18 14:02:49,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:49,650 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 31, 19, 19, 19, 19, 19, 19, 19, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:49,651 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:49,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1890572663, now seen corresponding path program 7 times [2018-11-18 14:02:49,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:49,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:02:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 999 proven. 122 refuted. 0 times theorem prover too weak. 2992 trivial. 0 not checked. [2018-11-18 14:02:49,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:49,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:49,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:49,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 184 proven. 1055 refuted. 0 times theorem prover too weak. 2874 trivial. 0 not checked. [2018-11-18 14:02:50,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:50,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2018-11-18 14:02:50,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 14:02:50,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 14:02:50,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:02:50,059 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand 19 states. [2018-11-18 14:02:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:50,544 INFO L93 Difference]: Finished difference Result 170 states and 294 transitions. [2018-11-18 14:02:50,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 14:02:50,544 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 272 [2018-11-18 14:02:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:50,545 INFO L225 Difference]: With dead ends: 170 [2018-11-18 14:02:50,545 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 14:02:50,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 14:02:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 14:02:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-11-18 14:02:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-18 14:02:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 135 transitions. [2018-11-18 14:02:50,555 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 135 transitions. Word has length 272 [2018-11-18 14:02:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:50,555 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 135 transitions. [2018-11-18 14:02:50,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 14:02:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 135 transitions. [2018-11-18 14:02:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-11-18 14:02:50,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:50,564 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 59, 36, 36, 36, 36, 36, 36, 36, 23, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:50,564 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:50,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:50,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1913375586, now seen corresponding path program 8 times [2018-11-18 14:02:50,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:50,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:50,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:50,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:02:50,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:02:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 2481 proven. 690 refuted. 0 times theorem prover too weak. 11572 trivial. 0 not checked. [2018-11-18 14:02:50,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:02:50,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:02:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:02:50,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:02:50,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:02:50,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:02:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 1780 proven. 2981 refuted. 0 times theorem prover too weak. 9982 trivial. 0 not checked. [2018-11-18 14:02:51,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:02:51,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 23 [2018-11-18 14:02:51,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 14:02:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 14:02:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-11-18 14:02:51,210 INFO L87 Difference]: Start difference. First operand 97 states and 135 transitions. Second operand 23 states. [2018-11-18 14:02:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:02:51,722 INFO L93 Difference]: Finished difference Result 222 states and 392 transitions. [2018-11-18 14:02:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 14:02:51,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 504 [2018-11-18 14:02:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:02:51,724 INFO L225 Difference]: With dead ends: 222 [2018-11-18 14:02:51,724 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 14:02:51,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 500 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=576, Invalid=2180, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 14:02:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 14:02:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2018-11-18 14:02:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 14:02:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2018-11-18 14:02:51,737 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 504 [2018-11-18 14:02:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:02:51,738 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2018-11-18 14:02:51,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 14:02:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2018-11-18 14:02:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-18 14:02:51,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:02:51,740 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:02:51,740 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:02:51,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:02:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2018-11-18 14:02:51,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:02:51,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:02:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:51,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:02:51,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:02:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:02:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:02:51,832 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 14:02:51,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:02:51 BoogieIcfgContainer [2018-11-18 14:02:51,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:02:51,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:02:51,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:02:51,878 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:02:51,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:02:46" (3/4) ... [2018-11-18 14:02:51,881 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 14:02:51,949 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5edc9d2b-f7e3-4003-aa11-64cfebc4b960/bin-2019/uautomizer/witness.graphml [2018-11-18 14:02:51,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:02:51,950 INFO L168 Benchmark]: Toolchain (without parser) took 5310.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 380.6 MB). Free memory was 959.1 MB in the beginning and 949.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 390.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:02:51,951 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:02:51,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:02:51,951 INFO L168 Benchmark]: Boogie Preprocessor took 14.96 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:02:51,952 INFO L168 Benchmark]: RCFGBuilder took 160.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -228.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:02:51,952 INFO L168 Benchmark]: TraceAbstraction took 4916.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.2 GB in the beginning and 957.9 MB in the end (delta: 216.0 MB). Peak memory consumption was 409.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:02:51,952 INFO L168 Benchmark]: Witness Printer took 71.29 ms. Allocated memory is still 1.4 GB. Free memory was 957.9 MB in the beginning and 949.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:02:51,954 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.96 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 160.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -228.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4916.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.2 GB in the beginning and 957.9 MB in the end (delta: 216.0 MB). Peak memory consumption was 409.5 MB. Max. memory is 11.5 GB. * Witness Printer took 71.29 ms. Allocated memory is still 1.4 GB. Free memory was 957.9 MB in the beginning and 949.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 4.8s OverallTime, 12 OverallIterations, 73 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 237 SDtfs, 628 SDslu, 886 SDs, 0 SdLazy, 1584 SolverSat, 737 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1567 GetRequests, 1359 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3210 NumberOfCodeBlocks, 3126 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2727 ConstructedInterpolants, 0 QuantifiedInterpolants, 1083825 SizeOfPredicates, 55 NumberOfNonLiveVariables, 2856 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 38400/44476 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...