./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3562c726fb0df5872bc6ae08c11ec0d40862c19 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-08 19:16:51,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:16:51,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:16:51,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:16:51,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:16:51,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:16:51,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:16:51,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:16:51,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:16:51,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:16:51,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:16:51,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:16:51,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:16:51,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:16:51,274 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:16:51,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:16:51,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:16:51,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:16:51,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:16:51,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:16:51,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:16:51,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:16:51,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:16:51,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:16:51,279 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:16:51,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:16:51,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:16:51,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:16:51,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:16:51,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:16:51,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:16:51,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:16:51,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:16:51,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:16:51,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:16:51,283 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:16:51,283 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 19:16:51,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:16:51,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:16:51,291 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:16:51,291 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 19:16:51,291 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 19:16:51,291 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 19:16:51,291 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 19:16:51,291 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 19:16:51,291 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 19:16:51,292 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 19:16:51,292 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 19:16:51,292 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 19:16:51,292 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 19:16:51,292 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:16:51,292 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:16:51,292 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:16:51,292 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:16:51,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:16:51,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:16:51,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 19:16:51,294 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2018-12-08 19:16:51,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:16:51,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:16:51,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:16:51,325 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:16:51,325 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:16:51,326 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-12-08 19:16:51,373 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/data/0b5836c87/82e47a6c24ba4c36b70eb2e808521549/FLAG01fe7f711 [2018-12-08 19:16:51,788 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:16:51,789 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-12-08 19:16:51,792 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/data/0b5836c87/82e47a6c24ba4c36b70eb2e808521549/FLAG01fe7f711 [2018-12-08 19:16:51,800 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/data/0b5836c87/82e47a6c24ba4c36b70eb2e808521549 [2018-12-08 19:16:51,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:16:51,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:16:51,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:16:51,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:16:51,805 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:16:51,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdd580a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51, skipping insertion in model container [2018-12-08 19:16:51,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:16:51,820 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:16:51,902 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:16:51,904 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:16:51,913 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:16:51,920 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:16:51,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51 WrapperNode [2018-12-08 19:16:51,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:16:51,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:16:51,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:16:51,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:16:51,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:16:51,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:16:51,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:16:51,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:16:51,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... [2018-12-08 19:16:51,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:16:51,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:16:51,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:16:51,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:16:51,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:16:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-08 19:16:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-08 19:16:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 19:16:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 19:16:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:16:52,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:16:52,007 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 19:16:52,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 19:16:52,097 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:16:52,098 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 19:16:52,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:16:52 BoogieIcfgContainer [2018-12-08 19:16:52,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:16:52,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 19:16:52,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 19:16:52,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 19:16:52,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:16:51" (1/3) ... [2018-12-08 19:16:52,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44684dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:16:52, skipping insertion in model container [2018-12-08 19:16:52,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:51" (2/3) ... [2018-12-08 19:16:52,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44684dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:16:52, skipping insertion in model container [2018-12-08 19:16:52,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:16:52" (3/3) ... [2018-12-08 19:16:52,104 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-12-08 19:16:52,112 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 19:16:52,118 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 19:16:52,128 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 19:16:52,146 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 19:16:52,146 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 19:16:52,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 19:16:52,147 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:16:52,147 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:16:52,147 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 19:16:52,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:16:52,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 19:16:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-08 19:16:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 19:16:52,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:52,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:16:52,162 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:52,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:52,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-12-08 19:16:52,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:52,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:52,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:16:52,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:52,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:16:52,268 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:16:52,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:16:52,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:16:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:16:52,279 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-12-08 19:16:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:52,336 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-08 19:16:52,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:16:52,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-08 19:16:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:16:52,343 INFO L225 Difference]: With dead ends: 35 [2018-12-08 19:16:52,343 INFO L226 Difference]: Without dead ends: 21 [2018-12-08 19:16:52,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:16:52,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-08 19:16:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-08 19:16:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-08 19:16:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-08 19:16:52,369 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-12-08 19:16:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:16:52,369 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-08 19:16:52,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:16:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-08 19:16:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 19:16:52,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:52,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:16:52,371 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:52,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:52,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-12-08 19:16:52,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:52,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:52,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:52,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:16:52,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:52,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:16:52,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:16:52,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:16:52,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:16:52,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:16:52,397 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-12-08 19:16:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:52,440 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-08 19:16:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:16:52,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-08 19:16:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:16:52,441 INFO L225 Difference]: With dead ends: 27 [2018-12-08 19:16:52,442 INFO L226 Difference]: Without dead ends: 23 [2018-12-08 19:16:52,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:16:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-08 19:16:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-08 19:16:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-08 19:16:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-08 19:16:52,448 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-12-08 19:16:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:16:52,449 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-08 19:16:52,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:16:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-08 19:16:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 19:16:52,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:52,450 INFO L402 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-12-08 19:16:52,450 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:52,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-12-08 19:16:52,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:52,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:52,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 19:16:52,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:52,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:16:52,500 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-08 19:16:52,501 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-12-08 19:16:52,521 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:16:52,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:16:52,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 19:16:52,686 INFO L272 AbstractInterpreter]: Visited 21 different actions 282 times. Never merged. Never widened. Performed 588 root evaluator evaluations with a maximum evaluation depth of 4. Performed 588 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 32 fixpoints after 3 different actions. Largest state had 5 variables. [2018-12-08 19:16:52,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:52,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 19:16:52,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:52,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/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-12-08 19:16:52,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:52,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:16:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:52,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:16:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 19:16:52,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:16:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:16:52,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 19:16:52,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-12-08 19:16:52,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 19:16:52,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:16:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:16:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:16:52,889 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-12-08 19:16:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:52,952 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-12-08 19:16:52,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:16:52,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-08 19:16:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:16:52,953 INFO L225 Difference]: With dead ends: 38 [2018-12-08 19:16:52,953 INFO L226 Difference]: Without dead ends: 23 [2018-12-08 19:16:52,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-08 19:16:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-08 19:16:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-08 19:16:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 19:16:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-08 19:16:52,957 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-12-08 19:16:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:16:52,957 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-08 19:16:52,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:16:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-08 19:16:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 19:16:52,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:52,958 INFO L402 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-12-08 19:16:52,959 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:52,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-12-08 19:16:52,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:52,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 19:16:52,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:52,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:16:52,995 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-08 19:16:52,995 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-12-08 19:16:52,997 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:16:52,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:16:53,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 19:16:53,808 INFO L272 AbstractInterpreter]: Visited 22 different actions 4111 times. Merged at 10 different actions 1344 times. Never widened. Performed 10008 root evaluator evaluations with a maximum evaluation depth of 4. Performed 10008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 592 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-08 19:16:53,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:53,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 19:16:53,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:53,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/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-12-08 19:16:53,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:53,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:16:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:53,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:16:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 19:16:53,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:16:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:16:53,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 19:16:53,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-12-08 19:16:53,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 19:16:53,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:16:53,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:16:53,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:16:53,955 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-12-08 19:16:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:53,998 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-12-08 19:16:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:16:53,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-08 19:16:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:16:53,999 INFO L225 Difference]: With dead ends: 32 [2018-12-08 19:16:53,999 INFO L226 Difference]: Without dead ends: 28 [2018-12-08 19:16:53,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:16:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-08 19:16:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-08 19:16:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 19:16:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-08 19:16:54,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-12-08 19:16:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:16:54,004 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-08 19:16:54,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:16:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-12-08 19:16:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 19:16:54,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:54,005 INFO L402 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-12-08 19:16:54,005 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:54,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-12-08 19:16:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:54,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:54,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 19:16:54,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:54,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:16:54,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 19:16:54,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 19:16:54,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:54,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/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-12-08 19:16:54,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 19:16:54,043 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 19:16:54,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 19:16:54,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 19:16:54,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:16:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 19:16:54,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:16:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 19:16:54,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 19:16:54,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-12-08 19:16:54,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 19:16:54,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:16:54,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:16:54,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:16:54,167 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 6 states. [2018-12-08 19:16:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:54,200 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-12-08 19:16:54,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:16:54,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-08 19:16:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:16:54,202 INFO L225 Difference]: With dead ends: 38 [2018-12-08 19:16:54,202 INFO L226 Difference]: Without dead ends: 34 [2018-12-08 19:16:54,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:16:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-08 19:16:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-12-08 19:16:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 19:16:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-08 19:16:54,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 40 [2018-12-08 19:16:54,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:16:54,208 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-08 19:16:54,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:16:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-12-08 19:16:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 19:16:54,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:54,210 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:16:54,210 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:54,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:54,210 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2018-12-08 19:16:54,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:54,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:54,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:16:54,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:54,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 19:16:54,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:54,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:16:54,248 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 19:16:54,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 19:16:54,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:54,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/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-12-08 19:16:54,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 19:16:54,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-08 19:16:54,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 19:16:54,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 19:16:54,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:16:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 19:16:54,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:16:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 19:16:54,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 19:16:54,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 12 [2018-12-08 19:16:54,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 19:16:54,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:16:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:16:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:16:54,459 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 7 states. [2018-12-08 19:16:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:54,506 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-12-08 19:16:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:16:54,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-08 19:16:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:16:54,507 INFO L225 Difference]: With dead ends: 40 [2018-12-08 19:16:54,507 INFO L226 Difference]: Without dead ends: 36 [2018-12-08 19:16:54,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:16:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-08 19:16:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-12-08 19:16:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 19:16:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-12-08 19:16:54,511 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 41 [2018-12-08 19:16:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:16:54,512 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-12-08 19:16:54,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:16:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-12-08 19:16:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 19:16:54,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:54,513 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 7, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:16:54,513 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:54,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1591893433, now seen corresponding path program 4 times [2018-12-08 19:16:54,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:54,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:54,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:16:54,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:54,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 52 proven. 69 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-12-08 19:16:54,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:54,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:16:54,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 19:16:54,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 19:16:54,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:54,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/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-12-08 19:16:54,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:54,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:16:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:54,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:16:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 22 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-12-08 19:16:54,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:16:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 22 proven. 134 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-08 19:16:54,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 19:16:54,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 18 [2018-12-08 19:16:54,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 19:16:54,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 19:16:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 19:16:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-12-08 19:16:54,940 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 14 states. [2018-12-08 19:16:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:55,189 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2018-12-08 19:16:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 19:16:55,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-12-08 19:16:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:16:55,191 INFO L225 Difference]: With dead ends: 79 [2018-12-08 19:16:55,191 INFO L226 Difference]: Without dead ends: 50 [2018-12-08 19:16:55,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 143 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2018-12-08 19:16:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-08 19:16:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-12-08 19:16:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-08 19:16:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-12-08 19:16:55,196 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 80 [2018-12-08 19:16:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:16:55,196 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-12-08 19:16:55,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 19:16:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-12-08 19:16:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-08 19:16:55,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:55,198 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:16:55,198 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:55,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:55,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2018-12-08 19:16:55,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:55,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:55,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:55,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:55,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 319 proven. 55 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2018-12-08 19:16:55,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:55,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:16:55,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 19:16:55,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 19:16:55,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:16:55,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/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-12-08 19:16:55,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 19:16:55,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 19:16:55,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-08 19:16:55,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 19:16:55,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:16:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 393 proven. 34 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-12-08 19:16:55,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:16:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 393 proven. 41 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-12-08 19:16:55,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 19:16:55,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 18 [2018-12-08 19:16:55,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 19:16:55,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 19:16:55,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 19:16:55,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-12-08 19:16:55,721 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 14 states. [2018-12-08 19:16:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:55,866 INFO L93 Difference]: Finished difference Result 112 states and 167 transitions. [2018-12-08 19:16:55,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 19:16:55,867 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 150 [2018-12-08 19:16:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:16:55,868 INFO L225 Difference]: With dead ends: 112 [2018-12-08 19:16:55,868 INFO L226 Difference]: Without dead ends: 65 [2018-12-08 19:16:55,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 285 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-12-08 19:16:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-08 19:16:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-12-08 19:16:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 19:16:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-12-08 19:16:55,873 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 150 [2018-12-08 19:16:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:16:55,873 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-12-08 19:16:55,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 19:16:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-12-08 19:16:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-08 19:16:55,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:16:55,875 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:16:55,875 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:16:55,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2018-12-08 19:16:55,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:16:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:55,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:16:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:55,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:16:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:55,918 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 19:16:55,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 07:16:55 BoogieIcfgContainer [2018-12-08 19:16:55,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 19:16:55,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:16:55,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:16:55,943 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:16:55,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:16:52" (3/4) ... [2018-12-08 19:16:55,945 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 19:16:55,980 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b1cb6437-4695-400c-a47f-e1b72e313036/bin-2019/utaipan/witness.graphml [2018-12-08 19:16:55,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:16:55,981 INFO L168 Benchmark]: Toolchain (without parser) took 4178.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.2 MB). Free memory was 952.4 MB in the beginning and 970.0 MB in the end (delta: -17.6 MB). Peak memory consumption was 267.6 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:55,982 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:16:55,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.71 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:55,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.41 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:16:55,983 INFO L168 Benchmark]: Boogie Preprocessor took 9.99 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:16:55,983 INFO L168 Benchmark]: RCFGBuilder took 155.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:55,983 INFO L168 Benchmark]: TraceAbstraction took 3843.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 979.4 MB in the end (delta: 111.2 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:55,983 INFO L168 Benchmark]: Witness Printer took 37.35 ms. Allocated memory is still 1.3 GB. Free memory was 979.4 MB in the beginning and 970.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:55,984 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.71 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.41 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.99 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 155.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3843.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 979.4 MB in the end (delta: 111.2 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. * Witness Printer took 37.35 ms. Allocated memory is still 1.3 GB. Free memory was 979.4 MB in the beginning and 970.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 3.8s OverallTime, 9 OverallIterations, 21 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 144 SDtfs, 173 SDslu, 409 SDs, 0 SdLazy, 542 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 677 SyntacticMatches, 33 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 864 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1099 ConstructedInterpolants, 0 QuantifiedInterpolants, 163419 SizeOfPredicates, 29 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 4101/4677 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...