./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e40a98558d0111ea95f3ee60a44cc14c7768182 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:36:27,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:36:27,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:36:27,240 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:36:27,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:36:27,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:36:27,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:36:27,242 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:36:27,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:36:27,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:36:27,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:36:27,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:36:27,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:36:27,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:36:27,245 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:36:27,246 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:36:27,246 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:36:27,247 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:36:27,248 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:36:27,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:36:27,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:36:27,250 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:36:27,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:36:27,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:36:27,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:36:27,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:36:27,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:36:27,253 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:36:27,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:36:27,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:36:27,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:36:27,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:36:27,255 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:36:27,255 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:36:27,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:36:27,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:36:27,256 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-12-02 21:36:27,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:36:27,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:36:27,264 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:36:27,264 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:36:27,264 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:36:27,264 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:36:27,264 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:36:27,264 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:36:27,264 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:36:27,264 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:36:27,264 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:36:27,265 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:36:27,265 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:36:27,265 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:36:27,265 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:36:27,265 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:36:27,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:36:27,265 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:36:27,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:36:27,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:36:27,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:36:27,267 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:36:27,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:36:27,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:36:27,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:36:27,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:36:27,267 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:36:27,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:36:27,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:36:27,267 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:36:27,267 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_20cb0298-3ae3-4db0-83f0-fd81c99fc584/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 ! overflow) ) 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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2018-12-02 21:36:27,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:36:27,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:36:27,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:36:27,295 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:36:27,295 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:36:27,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:36:27,331 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/data/55344ab29/93fe9d0631e8496794ac3e77ac47c887/FLAG6a5e27c95 [2018-12-02 21:36:27,796 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:36:27,797 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:36:27,800 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/data/55344ab29/93fe9d0631e8496794ac3e77ac47c887/FLAG6a5e27c95 [2018-12-02 21:36:27,808 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/data/55344ab29/93fe9d0631e8496794ac3e77ac47c887 [2018-12-02 21:36:27,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:36:27,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:36:27,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:36:27,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:36:27,813 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:36:27,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1782ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27, skipping insertion in model container [2018-12-02 21:36:27,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:36:27,827 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:36:27,907 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:36:27,909 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:36:27,917 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:36:27,925 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:36:27,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27 WrapperNode [2018-12-02 21:36:27,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:36:27,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:36:27,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:36:27,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:36:27,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:36:27,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:36:27,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:36:27,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:36:27,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... [2018-12-02 21:36:27,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:36:27,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:36:27,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:36:27,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:36:27,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/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-02 21:36:28,007 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-02 21:36:28,007 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-02 21:36:28,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:36:28,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:36:28,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:36:28,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:36:28,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:36:28,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:36:28,101 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:36:28,101 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 21:36:28,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:36:28 BoogieIcfgContainer [2018-12-02 21:36:28,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:36:28,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:36:28,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:36:28,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:36:28,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:36:27" (1/3) ... [2018-12-02 21:36:28,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6457f6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:36:28, skipping insertion in model container [2018-12-02 21:36:28,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:27" (2/3) ... [2018-12-02 21:36:28,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6457f6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:36:28, skipping insertion in model container [2018-12-02 21:36:28,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:36:28" (3/3) ... [2018-12-02 21:36:28,108 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:36:28,115 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:36:28,121 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-02 21:36:28,134 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-02 21:36:28,157 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:36:28,157 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:36:28,157 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:36:28,157 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:36:28,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:36:28,157 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:36:28,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:36:28,157 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:36:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-12-02 21:36:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:36:28,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:28,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:28,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:28,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:28,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1707029017, now seen corresponding path program 1 times [2018-12-02 21:36:28,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:28,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:28,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:28,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:28,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:28,273 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-02 21:36:28,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:28,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:36:28,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:28,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:36:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:36:28,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:36:28,288 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-12-02 21:36:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:28,344 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-02 21:36:28,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:36:28,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-02 21:36:28,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:28,350 INFO L225 Difference]: With dead ends: 38 [2018-12-02 21:36:28,351 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 21:36:28,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-02 21:36:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 21:36:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 21:36:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 21:36:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-02 21:36:28,375 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2018-12-02 21:36:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:28,375 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-02 21:36:28,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:36:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-02 21:36:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 21:36:28,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:28,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:28,376 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:28,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1378291933, now seen corresponding path program 1 times [2018-12-02 21:36:28,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:28,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:28,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:28,387 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-02 21:36:28,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:28,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:36:28,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:28,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:36:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:36:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:28,389 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-12-02 21:36:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:28,400 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-12-02 21:36:28,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:36:28,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 21:36:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:28,401 INFO L225 Difference]: With dead ends: 27 [2018-12-02 21:36:28,402 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 21:36:28,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 21:36:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-02 21:36:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 21:36:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-02 21:36:28,406 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 11 [2018-12-02 21:36:28,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:28,406 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 21:36:28,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:36:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-02 21:36:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:36:28,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:28,407 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:28,407 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:28,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash -995069271, now seen corresponding path program 1 times [2018-12-02 21:36:28,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:28,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:28,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:28,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:28,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:36:28,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:28,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:28,460 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-02 21:36:28,462 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [14], [16], [18], [20], [21], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-12-02 21:36:28,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:36:28,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:36:28,679 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 21:36:28,680 INFO L272 AbstractInterpreter]: Visited 22 different actions 405 times. Never merged. Widened at 2 different actions 25 times. Performed 807 root evaluator evaluations with a maximum evaluation depth of 4. Performed 807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 20 fixpoints after 2 different actions. Largest state had 5 variables. [2018-12-02 21:36:28,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:28,685 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 21:36:28,715 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 21:36:28,716 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 21:36:28,740 INFO L418 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-12-02 21:36:28,740 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 21:36:28,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:36:28,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-02 21:36:28,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:28,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:36:28,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:36:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:36:28,742 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 9 states. [2018-12-02 21:36:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:29,001 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-12-02 21:36:29,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:36:29,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-02 21:36:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:29,002 INFO L225 Difference]: With dead ends: 91 [2018-12-02 21:36:29,002 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 21:36:29,003 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:36:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 21:36:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2018-12-02 21:36:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 21:36:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-12-02 21:36:29,010 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 32 [2018-12-02 21:36:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:29,010 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-12-02 21:36:29,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:36:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-12-02 21:36:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 21:36:29,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:29,011 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:29,012 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:29,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1617198389, now seen corresponding path program 2 times [2018-12-02 21:36:29,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:29,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:29,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 21:36:29,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:29,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:29,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:36:29,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:36:29,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:29,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/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-02 21:36:29,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:36:29,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:36:29,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 21:36:29,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:36:29,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 21:36:29,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 21:36:29,162 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:36:29,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-12-02 21:36:29,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:29,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:36:29,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:36:29,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:36:29,163 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 5 states. [2018-12-02 21:36:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:29,183 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-12-02 21:36:29,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:36:29,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-02 21:36:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:29,185 INFO L225 Difference]: With dead ends: 81 [2018-12-02 21:36:29,185 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 21:36:29,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:36:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 21:36:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-02 21:36:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 21:36:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2018-12-02 21:36:29,192 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 38 [2018-12-02 21:36:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:29,193 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2018-12-02 21:36:29,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:36:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-12-02 21:36:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 21:36:29,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:29,194 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:29,194 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:29,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1406457547, now seen corresponding path program 1 times [2018-12-02 21:36:29,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:29,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:36:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:29,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 21:36:29,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:29,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:29,232 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-02 21:36:29,232 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [14], [16], [18], [20], [22], [23], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-12-02 21:36:29,233 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:36:29,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:36:29,324 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 21:36:29,324 INFO L272 AbstractInterpreter]: Visited 23 different actions 415 times. Never merged. Widened at 2 different actions 25 times. Performed 827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 20 fixpoints after 2 different actions. Largest state had 5 variables. [2018-12-02 21:36:29,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:29,330 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 21:36:29,342 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 21:36:29,342 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 21:36:29,386 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-02 21:36:29,386 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 21:36:29,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:36:29,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-12-02 21:36:29,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:29,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:36:29,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:36:29,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:36:29,387 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 11 states. [2018-12-02 21:36:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:29,784 INFO L93 Difference]: Finished difference Result 153 states and 187 transitions. [2018-12-02 21:36:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:36:29,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-12-02 21:36:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:29,785 INFO L225 Difference]: With dead ends: 153 [2018-12-02 21:36:29,785 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 21:36:29,785 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:36:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 21:36:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-12-02 21:36:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 21:36:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2018-12-02 21:36:29,793 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 39 [2018-12-02 21:36:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:29,793 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2018-12-02 21:36:29,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:36:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2018-12-02 21:36:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 21:36:29,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:29,794 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:29,794 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:29,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1228913769, now seen corresponding path program 2 times [2018-12-02 21:36:29,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:29,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:29,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:29,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:29,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-02 21:36:29,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:29,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:29,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:36:29,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:36:29,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:29,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/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-02 21:36:29,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:36:29,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:36:29,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 21:36:29,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:36:29,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-02 21:36:29,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-02 21:36:29,910 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:36:29,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-12-02 21:36:29,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:29,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:36:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:36:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:36:29,910 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 5 states. [2018-12-02 21:36:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:29,931 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2018-12-02 21:36:29,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:36:29,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 21:36:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:29,932 INFO L225 Difference]: With dead ends: 104 [2018-12-02 21:36:29,932 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 21:36:29,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:36:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 21:36:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-12-02 21:36:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 21:36:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-12-02 21:36:29,938 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 45 [2018-12-02 21:36:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:29,938 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-12-02 21:36:29,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:36:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-12-02 21:36:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 21:36:29,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:29,939 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:29,940 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:29,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1240405343, now seen corresponding path program 1 times [2018-12-02 21:36:29,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:29,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:29,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:36:29,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:29,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 21:36:29,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:29,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:29,979 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-02 21:36:29,979 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [21], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-12-02 21:36:29,980 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:36:29,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:36:30,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:36:30,321 INFO L272 AbstractInterpreter]: Visited 23 different actions 2706 times. Merged at 9 different actions 767 times. Widened at 2 different actions 134 times. Performed 6647 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6647 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 179 fixpoints after 3 different actions. Largest state had 5 variables. [2018-12-02 21:36:30,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:30,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:36:30,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:30,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/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-02 21:36:30,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:30,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:36:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:30,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:36:30,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:36:30,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:36:30,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 24 [2018-12-02 21:36:30,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:36:30,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 21:36:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:36:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:36:30,528 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 15 states. [2018-12-02 21:36:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:30,698 INFO L93 Difference]: Finished difference Result 186 states and 238 transitions. [2018-12-02 21:36:30,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:36:30,698 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-12-02 21:36:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:30,699 INFO L225 Difference]: With dead ends: 186 [2018-12-02 21:36:30,699 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 21:36:30,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2018-12-02 21:36:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 21:36:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-12-02 21:36:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 21:36:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2018-12-02 21:36:30,706 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 45 [2018-12-02 21:36:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:30,706 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2018-12-02 21:36:30,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 21:36:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2018-12-02 21:36:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 21:36:30,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:30,707 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:30,707 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:30,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1942973709, now seen corresponding path program 1 times [2018-12-02 21:36:30,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:30,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:30,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-02 21:36:30,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:30,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:36:30,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:30,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:36:30,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:36:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:36:30,726 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand 5 states. [2018-12-02 21:36:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:30,751 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2018-12-02 21:36:30,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:36:30,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 21:36:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:30,752 INFO L225 Difference]: With dead ends: 121 [2018-12-02 21:36:30,752 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 21:36:30,752 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-02 21:36:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 21:36:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2018-12-02 21:36:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 21:36:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-12-02 21:36:30,758 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 46 [2018-12-02 21:36:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:30,758 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-12-02 21:36:30,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:36:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-12-02 21:36:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 21:36:30,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:30,759 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:30,759 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:30,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1616531980, now seen corresponding path program 1 times [2018-12-02 21:36:30,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:30,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:30,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 34 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 21:36:30,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:30,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:30,799 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-02 21:36:30,799 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [21], [22], [24], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-12-02 21:36:30,800 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:36:30,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:36:44,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:36:44,621 INFO L272 AbstractInterpreter]: Visited 25 different actions 189769 times. Merged at 11 different actions 64643 times. Widened at 2 different actions 7475 times. Performed 485011 root evaluator evaluations with a maximum evaluation depth of 4. Performed 485011 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17153 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-02 21:36:44,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:44,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:36:44,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:44,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/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-02 21:36:44,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:44,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:36:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:44,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 58 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 21:36:44,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 2 proven. 107 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:36:44,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:36:44,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 24 [2018-12-02 21:36:44,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:36:44,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 21:36:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 21:36:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:36:44,840 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 16 states. [2018-12-02 21:36:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:45,072 INFO L93 Difference]: Finished difference Result 200 states and 257 transitions. [2018-12-02 21:36:45,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 21:36:45,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-12-02 21:36:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:45,073 INFO L225 Difference]: With dead ends: 200 [2018-12-02 21:36:45,073 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 21:36:45,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 21:36:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 21:36:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-12-02 21:36:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 21:36:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-12-02 21:36:45,078 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 65 [2018-12-02 21:36:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:45,078 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-12-02 21:36:45,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 21:36:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-12-02 21:36:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 21:36:45,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:45,079 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:45,079 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:45,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1954123448, now seen corresponding path program 2 times [2018-12-02 21:36:45,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:45,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:45,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:45,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:45,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-12-02 21:36:45,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:45,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:45,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:36:45,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:36:45,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:45,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/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-02 21:36:45,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:36:45,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:36:45,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:36:45,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:36:45,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-12-02 21:36:45,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-12-02 21:36:45,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:36:45,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-12-02 21:36:45,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:36:45,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:36:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:36:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:36:45,257 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 9 states. [2018-12-02 21:36:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:45,301 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2018-12-02 21:36:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:36:45,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-12-02 21:36:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:45,302 INFO L225 Difference]: With dead ends: 135 [2018-12-02 21:36:45,302 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 21:36:45,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:36:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 21:36:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2018-12-02 21:36:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 21:36:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 150 transitions. [2018-12-02 21:36:45,311 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 150 transitions. Word has length 77 [2018-12-02 21:36:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:45,311 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 150 transitions. [2018-12-02 21:36:45,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:36:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 150 transitions. [2018-12-02 21:36:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 21:36:45,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:45,313 INFO L402 BasicCegarLoop]: trace histogram [13, 11, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:45,313 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:45,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash -782800990, now seen corresponding path program 3 times [2018-12-02 21:36:45,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:45,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:36:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:45,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 118 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 21:36:45,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:45,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:45,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:36:45,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:36:45,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:45,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/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-02 21:36:45,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:36:45,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:36:45,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:36:45,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:36:45,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 196 proven. 121 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 21:36:45,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 12 proven. 289 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-02 21:36:45,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:36:45,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 17] total 25 [2018-12-02 21:36:45,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:36:45,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 21:36:45,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 21:36:45,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-12-02 21:36:45,698 INFO L87 Difference]: Start difference. First operand 120 states and 150 transitions. Second operand 20 states. [2018-12-02 21:36:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:46,006 INFO L93 Difference]: Finished difference Result 256 states and 340 transitions. [2018-12-02 21:36:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 21:36:46,007 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 110 [2018-12-02 21:36:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:46,008 INFO L225 Difference]: With dead ends: 256 [2018-12-02 21:36:46,008 INFO L226 Difference]: Without dead ends: 154 [2018-12-02 21:36:46,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 203 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 21:36:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-02 21:36:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2018-12-02 21:36:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-02 21:36:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-12-02 21:36:46,014 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 110 [2018-12-02 21:36:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:46,014 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-12-02 21:36:46,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 21:36:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-12-02 21:36:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 21:36:46,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:46,015 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:46,015 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:46,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1659895493, now seen corresponding path program 4 times [2018-12-02 21:36:46,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:46,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:36:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:46,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 105 proven. 34 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 21:36:46,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:46,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:46,084 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:36:46,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:36:46,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:46,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/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-12-02 21:36:46,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:46,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:36:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:46,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 31 proven. 228 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 21:36:46,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 31 proven. 228 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 21:36:46,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:36:46,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 24 [2018-12-02 21:36:46,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:36:46,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 21:36:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 21:36:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:36:46,318 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 23 states. [2018-12-02 21:36:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:46,782 INFO L93 Difference]: Finished difference Result 480 states and 819 transitions. [2018-12-02 21:36:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 21:36:46,782 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-12-02 21:36:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:46,784 INFO L225 Difference]: With dead ends: 480 [2018-12-02 21:36:46,784 INFO L226 Difference]: Without dead ends: 357 [2018-12-02 21:36:46,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 173 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 21:36:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-12-02 21:36:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 297. [2018-12-02 21:36:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-02 21:36:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 460 transitions. [2018-12-02 21:36:46,808 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 460 transitions. Word has length 97 [2018-12-02 21:36:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:46,808 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 460 transitions. [2018-12-02 21:36:46,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 21:36:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 460 transitions. [2018-12-02 21:36:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 21:36:46,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:46,810 INFO L402 BasicCegarLoop]: trace histogram [18, 15, 12, 12, 12, 12, 10, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:46,810 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:46,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1154101107, now seen corresponding path program 5 times [2018-12-02 21:36:46,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:46,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 199 proven. 368 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-12-02 21:36:46,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:46,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:46,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:36:46,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:36:46,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:46,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/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-12-02 21:36:47,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:36:47,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:36:47,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-02 21:36:47,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:36:47,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 381 proven. 10 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-12-02 21:36:47,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 89 proven. 96 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-12-02 21:36:47,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:36:47,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8, 8] total 31 [2018-12-02 21:36:47,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:36:47,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 21:36:47,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 21:36:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2018-12-02 21:36:47,265 INFO L87 Difference]: Start difference. First operand 297 states and 460 transitions. Second operand 28 states. [2018-12-02 21:36:47,999 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-02 21:36:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:48,058 INFO L93 Difference]: Finished difference Result 427 states and 659 transitions. [2018-12-02 21:36:48,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-02 21:36:48,058 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 147 [2018-12-02 21:36:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:48,059 INFO L225 Difference]: With dead ends: 427 [2018-12-02 21:36:48,059 INFO L226 Difference]: Without dead ends: 148 [2018-12-02 21:36:48,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 287 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1074, Invalid=2832, Unknown=0, NotChecked=0, Total=3906 [2018-12-02 21:36:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-02 21:36:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2018-12-02 21:36:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-02 21:36:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-02 21:36:48,065 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 147 [2018-12-02 21:36:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:48,065 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-02 21:36:48,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 21:36:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-02 21:36:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 21:36:48,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:48,065 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:48,066 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:48,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1128501564, now seen corresponding path program 6 times [2018-12-02 21:36:48,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:48,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:36:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:48,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-12-02 21:36:48,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:48,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:48,110 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:36:48,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:36:48,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:48,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/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-12-02 21:36:48,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:36:48,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:36:48,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:36:48,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:36:48,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:36:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-12-02 21:36:48,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:36:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 46 proven. 35 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-12-02 21:36:48,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:36:48,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 19 [2018-12-02 21:36:48,386 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:36:48,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:36:48,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:36:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:36:48,386 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 13 states. [2018-12-02 21:36:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:48,419 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2018-12-02 21:36:48,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:36:48,419 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-12-02 21:36:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:48,419 INFO L225 Difference]: With dead ends: 140 [2018-12-02 21:36:48,419 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 21:36:48,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 223 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:36:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 21:36:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-12-02 21:36:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-02 21:36:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-12-02 21:36:48,425 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 116 [2018-12-02 21:36:48,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:48,425 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-12-02 21:36:48,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:36:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-12-02 21:36:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 21:36:48,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:48,426 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:48,426 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:36:48,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash -623810062, now seen corresponding path program 1 times [2018-12-02 21:36:48,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:48,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:36:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:48,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-12-02 21:36:48,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:36:48,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:36:48,460 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-12-02 21:36:48,461 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [22], [23], [24], [25], [26], [30], [40], [41], [42], [43], [44], [45], [46], [48] [2018-12-02 21:36:48,461 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:36:48,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:37:01,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:37:01,289 INFO L272 AbstractInterpreter]: Visited 25 different actions 189857 times. Merged at 11 different actions 64731 times. Widened at 2 different actions 7475 times. Performed 485427 root evaluator evaluations with a maximum evaluation depth of 4. Performed 485427 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17153 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-02 21:37:01,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:37:01,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:37:01,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:01,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:37:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:37:01,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:37:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:37:01,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:37:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-02 21:37:01,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:37:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-12-02 21:37:01,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:37:01,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 13] total 21 [2018-12-02 21:37:01,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:37:01,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 21:37:01,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:37:01,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:37:01,563 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 15 states. [2018-12-02 21:37:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:37:01,597 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-12-02 21:37:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:37:01,598 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2018-12-02 21:37:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:37:01,598 INFO L225 Difference]: With dead ends: 138 [2018-12-02 21:37:01,598 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 21:37:01,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 216 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:37:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 21:37:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-02 21:37:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 21:37:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-12-02 21:37:01,602 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 117 [2018-12-02 21:37:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:37:01,602 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2018-12-02 21:37:01,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 21:37:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2018-12-02 21:37:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-02 21:37:01,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:37:01,603 INFO L402 BasicCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:37:01,603 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:37:01,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:37:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1226786477, now seen corresponding path program 7 times [2018-12-02 21:37:01,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:37:01,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:01,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:37:01,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:01,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:37:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:37:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-12-02 21:37:01,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:01,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:37:01,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:37:01,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:37:01,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:01,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:37:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:37:01,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:37:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:37:01,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:37:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-12-02 21:37:01,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:37:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-12-02 21:37:02,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:37:02,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2018-12-02 21:37:02,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:37:02,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:37:02,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:37:02,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-12-02 21:37:02,305 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 17 states. [2018-12-02 21:37:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:37:02,335 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-02 21:37:02,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:37:02,335 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 169 [2018-12-02 21:37:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:37:02,336 INFO L225 Difference]: With dead ends: 137 [2018-12-02 21:37:02,336 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 21:37:02,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 325 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-12-02 21:37:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 21:37:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-02 21:37:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 21:37:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-12-02 21:37:02,339 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 169 [2018-12-02 21:37:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:37:02,339 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-12-02 21:37:02,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:37:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-12-02 21:37:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-02 21:37:02,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:37:02,340 INFO L402 BasicCegarLoop]: trace histogram [28, 24, 23, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 11, 11, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:37:02,340 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:37:02,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:37:02,341 INFO L82 PathProgramCache]: Analyzing trace with hash -333231388, now seen corresponding path program 8 times [2018-12-02 21:37:02,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:37:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:02,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:37:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:02,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:37:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:37:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-12-02 21:37:02,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:02,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:37:02,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:37:02,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:37:02,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:02,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:37:02,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:37:02,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:37:02,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-02 21:37:02,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:37:02,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:37:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-12-02 21:37:02,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:37:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 429 proven. 355 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2018-12-02 21:37:03,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:37:03,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 23] total 33 [2018-12-02 21:37:03,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:37:03,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 21:37:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 21:37:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 21:37:03,889 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 21 states. [2018-12-02 21:37:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:37:03,933 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-12-02 21:37:03,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:37:03,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 261 [2018-12-02 21:37:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:37:03,933 INFO L225 Difference]: With dead ends: 137 [2018-12-02 21:37:03,933 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 21:37:03,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 505 SyntacticMatches, 33 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 21:37:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 21:37:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-02 21:37:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 21:37:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2018-12-02 21:37:03,937 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 261 [2018-12-02 21:37:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:37:03,937 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2018-12-02 21:37:03,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 21:37:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2018-12-02 21:37:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-12-02 21:37:03,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:37:03,939 INFO L402 BasicCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:37:03,939 INFO L423 AbstractCegarLoop]: === Iteration 18 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:37:03,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:37:03,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1881532310, now seen corresponding path program 9 times [2018-12-02 21:37:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:37:03,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:03,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:37:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:03,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:37:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:37:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2018-12-02 21:37:04,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:04,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:37:04,296 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:37:04,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:37:04,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:04,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:37:04,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:37:04,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:37:04,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:37:04,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:37:04,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:37:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2018-12-02 21:37:04,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:37:06,217 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-02 21:37:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 1149 proven. 996 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2018-12-02 21:37:07,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:37:07,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2018-12-02 21:37:07,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:37:07,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 21:37:07,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 21:37:07,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 21:37:07,683 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand 25 states. [2018-12-02 21:37:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:37:07,755 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-12-02 21:37:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 21:37:07,755 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 412 [2018-12-02 21:37:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:37:07,756 INFO L225 Difference]: With dead ends: 137 [2018-12-02 21:37:07,756 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 21:37:07,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 803 SyntacticMatches, 62 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 21:37:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 21:37:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-02 21:37:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 21:37:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-12-02 21:37:07,762 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 412 [2018-12-02 21:37:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:37:07,762 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-12-02 21:37:07,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 21:37:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-12-02 21:37:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2018-12-02 21:37:07,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:37:07,766 INFO L402 BasicCegarLoop]: trace histogram [68, 66, 55, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 32, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:37:07,766 INFO L423 AbstractCegarLoop]: === Iteration 19 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:37:07,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:37:07,767 INFO L82 PathProgramCache]: Analyzing trace with hash 355145621, now seen corresponding path program 10 times [2018-12-02 21:37:07,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:37:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:07,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:37:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:07,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:37:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:37:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2018-12-02 21:37:08,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:08,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:37:08,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:37:08,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:37:08,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:08,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:37:08,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:37:08,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:37:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:37:08,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:37:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2018-12-02 21:37:08,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:37:09,138 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 21:37:12,186 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-02 21:37:12,383 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-02 21:37:12,599 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-02 21:37:12,823 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-02 21:37:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 3029 proven. 2721 refuted. 0 times theorem prover too weak. 9928 trivial. 0 not checked. [2018-12-02 21:37:16,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:37:16,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 35] total 47 [2018-12-02 21:37:16,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:37:16,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 21:37:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 21:37:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1761, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 21:37:16,187 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 29 states. [2018-12-02 21:37:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:37:16,256 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-12-02 21:37:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 21:37:16,256 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 661 [2018-12-02 21:37:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:37:16,258 INFO L225 Difference]: With dead ends: 137 [2018-12-02 21:37:16,258 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 21:37:16,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1454 GetRequests, 1297 SyntacticMatches, 111 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2975 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=495, Invalid=1761, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 21:37:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 21:37:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-02 21:37:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 21:37:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-12-02 21:37:16,263 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 661 [2018-12-02 21:37:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:37:16,264 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-12-02 21:37:16,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 21:37:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-12-02 21:37:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2018-12-02 21:37:16,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:37:16,269 INFO L402 BasicCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:37:16,270 INFO L423 AbstractCegarLoop]: === Iteration 20 === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:37:16,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:37:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash -642383590, now seen corresponding path program 11 times [2018-12-02 21:37:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:37:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:16,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:37:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:37:16,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:37:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:37:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2018-12-02 21:37:17,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:17,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:37:17,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:37:17,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:37:17,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:37:17,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:37:17,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:37:17,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:37:17,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-12-02 21:37:17,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:37:17,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:37:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2018-12-02 21:37:17,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:37:19,360 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-02 21:37:19,581 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-02 21:37:19,792 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-02 21:37:19,998 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-02 21:37:24,550 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-02 21:37:24,793 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-02 21:37:25,025 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-02 21:37:25,232 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-02 21:37:26,685 WARN L180 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-12-02 21:37:27,190 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-12-02 21:37:27,736 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-12-02 21:37:28,301 WARN L180 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-12-02 21:37:29,078 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-02 21:37:29,194 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-02 21:37:29,312 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-02 21:37:32,280 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-02 21:37:32,480 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-02 21:37:32,721 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-02 21:37:32,966 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-02 21:37:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 7863 proven. 7339 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2018-12-02 21:37:36,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:37:36,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2018-12-02 21:37:36,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:37:36,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 21:37:36,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 21:37:36,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 21:37:36,712 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 33 states. [2018-12-02 21:37:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:37:36,795 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-12-02 21:37:36,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 21:37:36,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1067 [2018-12-02 21:37:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:37:36,797 INFO L225 Difference]: With dead ends: 136 [2018-12-02 21:37:36,797 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:37:36,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2350 GetRequests, 2105 SyntacticMatches, 192 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 21:37:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:37:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:37:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:37:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:37:36,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1067 [2018-12-02 21:37:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:37:36,799 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:37:36,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 21:37:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:37:36,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:37:36,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 21:37:37,321 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 68 [2018-12-02 21:37:37,470 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 42 [2018-12-02 21:37:37,472 INFO L448 ceAbstractionStarter]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,472 INFO L448 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-12-02 21:37:37,472 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-12-02 21:37:37,472 INFO L448 ceAbstractionStarter]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,472 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-12-02 21:37:37,472 INFO L448 ceAbstractionStarter]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,472 INFO L448 ceAbstractionStarter]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,472 INFO L448 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-12-02 21:37:37,473 INFO L451 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-12-02 21:37:37,473 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,473 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,473 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (< 9 |fibonacci_#in~n|))) (and (or (< |fibonacci_#in~n| 9) .cse0 (<= 9 fibonacci_~n)) (or (= fibonacci_~n 8) (not (= |fibonacci_#in~n| 8))) (or (<= fibonacci_~n |fibonacci_#in~n|) .cse0) (or (not (= |fibonacci_#in~n| 7)) (<= 7 fibonacci_~n)) (or (< 5 |fibonacci_#in~n|) (< |fibonacci_#in~n| 5) (<= 5 fibonacci_~n)) (or (<= 6 fibonacci_~n) (not (= |fibonacci_#in~n| 6))) (< 1 |fibonacci_#in~n|) (or (< 4 |fibonacci_#in~n|) (<= |fibonacci_#in~n| fibonacci_~n)))) [2018-12-02 21:37:37,473 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,473 INFO L448 ceAbstractionStarter]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,473 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,473 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,473 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse3 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse0 (<= 2 |fibonacci_#t~ret0|)) (.cse1 (<= fibonacci_~n |fibonacci_#in~n|)) (.cse2 (< 9 |fibonacci_#in~n|))) (and (or (< 5 |fibonacci_#in~n|) (and (<= |fibonacci_#t~ret0| 3) .cse0 (<= 5 fibonacci_~n) .cse1) (< |fibonacci_#in~n| 5)) (or (<= 1 |fibonacci_#t~ret0|) .cse2) (or (not (= |fibonacci_#in~n| 6)) (and (<= |fibonacci_#t~ret0| 5) (<= 6 fibonacci_~n) .cse0 .cse1)) (or (and (<= |fibonacci_#t~ret0| 8) .cse3 .cse0 .cse1) (not (= |fibonacci_#in~n| 7))) (or (< 4 |fibonacci_#in~n|) (and .cse3 (<= |fibonacci_#t~ret0| 2) (<= fibonacci_~n 4) .cse0) (< |fibonacci_#in~n| 4)) (or (and (<= |fibonacci_#t~ret0| 13) .cse3 .cse0 .cse1) (not (= |fibonacci_#in~n| 8))) (let ((.cse4 (<= |fibonacci_#t~ret0| 1))) (or (and .cse4 (<= 3 fibonacci_~n) .cse1) (< 3 |fibonacci_#in~n|) (and .cse4 (<= |fibonacci_#in~n| 2) (<= 2 fibonacci_~n) .cse1))) (or (< |fibonacci_#in~n| 9) (and (<= |fibonacci_#t~ret0| 21) .cse3 .cse0 .cse1) .cse2))) [2018-12-02 21:37:37,473 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 21:37:37,474 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 25 33) the Hoare annotation is: true [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 25 33) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (= main_~x~0 9) [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-12-02 21:37:37,474 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 25 33) no Hoare annotation was computed. [2018-12-02 21:37:37,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:37:37 BoogieIcfgContainer [2018-12-02 21:37:37,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:37:37,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:37:37,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:37:37,477 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:37:37,477 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:36:28" (3/4) ... [2018-12-02 21:37:37,480 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 21:37:37,485 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-12-02 21:37:37,485 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 21:37:37,485 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 21:37:37,488 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 21:37:37,488 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 21:37:37,488 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 21:37:37,512 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_20cb0298-3ae3-4db0-83f0-fd81c99fc584/bin-2019/utaipan/witness.graphml [2018-12-02 21:37:37,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:37:37,513 INFO L168 Benchmark]: Toolchain (without parser) took 69703.04 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 957.8 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 21:37:37,513 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:37:37,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 114.98 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:37:37,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.55 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:37:37,514 INFO L168 Benchmark]: Boogie Preprocessor took 10.05 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:37:37,514 INFO L168 Benchmark]: RCFGBuilder took 154.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:37:37,514 INFO L168 Benchmark]: TraceAbstraction took 69374.20 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 21:37:37,515 INFO L168 Benchmark]: Witness Printer took 35.13 ms. Allocated memory is still 5.4 GB. Free memory is still 3.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:37:37,516 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 114.98 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 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.55 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.05 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 154.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69374.20 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 35.13 ms. Allocated memory is still 5.4 GB. Free memory is still 3.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. SAFE Result, 69.3s OverallTime, 20 OverallIterations, 109 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 625 SDtfs, 2088 SDslu, 3804 SDs, 0 SdLazy, 3205 SolverSat, 895 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 7653 GetRequests, 6691 SyntacticMatches, 476 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13632 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 27.3s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.8188405797101449 AbsIntWeakeningRatio, 0.4057971014492754 AbsIntAvgWeakeningVarsNumRemoved, 0.391304347826087 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 153 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 314 PreInvPairs, 378 NumberOfFragments, 234 HoareAnnotationTreeSize, 314 FomulaSimplifications, 452 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1605 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 35.7s InterpolantComputationTime, 6992 NumberOfCodeBlocks, 6784 NumberOfCodeBlocksAsserted, 145 NumberOfCheckSat, 10369 ConstructedInterpolants, 0 QuantifiedInterpolants, 14220555 SizeOfPredicates, 33 NumberOfNonLiveVariables, 6011 ConjunctsInSsa, 622 ConjunctsInUnsatCore, 50 InterpolantComputations, 7 PerfectInterpolantSequences, 169476/207702 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...