./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-numeric/Fibonacci01_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-numeric/Fibonacci01_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/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 64bit --witnessprinter.graph.data.programhash 72a153493a873036c1f42f91ea85c7d993e2a590 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 05:45:30,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:45:30,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:45:30,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:45:30,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:45:30,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:45:30,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:45:30,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:45:30,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:45:30,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:45:30,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:45:30,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:45:30,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:45:31,000 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:45:31,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:45:31,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:45:31,002 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:45:31,003 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:45:31,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:45:31,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:45:31,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:45:31,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:45:31,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:45:31,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:45:31,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:45:31,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:45:31,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:45:31,016 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:45:31,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:45:31,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:45:31,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:45:31,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:45:31,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:45:31,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:45:31,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:45:31,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:45:31,022 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-10-27 05:45:31,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:45:31,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:45:31,036 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:45:31,036 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 05:45:31,036 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 05:45:31,036 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 05:45:31,036 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 05:45:31,036 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 05:45:31,037 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 05:45:31,037 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 05:45:31,037 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 05:45:31,037 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:45:31,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:45:31,039 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:45:31,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:45:31,039 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:45:31,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:45:31,039 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:45:31,039 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:45:31,039 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:45:31,039 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:45:31,040 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:45:31,040 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:45:31,040 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:45:31,040 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:45:31,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:45:31,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:45:31,040 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:45:31,041 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:45:31,041 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 05:45:31,041 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:45:31,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:45:31,041 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 05:45:31,041 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_b2ab9aa4-bc81-4f84-87af-b50b01febd34/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72a153493a873036c1f42f91ea85c7d993e2a590 [2018-10-27 05:45:31,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:45:31,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:45:31,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:45:31,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:45:31,082 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:45:31,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/../../sv-benchmarks/c/termination-numeric/Fibonacci01_true-termination_true-no-overflow.c [2018-10-27 05:45:31,130 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/data/a8346ec2c/a37e06b6bfc441ea8f0feb84bf86846a/FLAGd66b7f794 [2018-10-27 05:45:31,506 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:45:31,506 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/sv-benchmarks/c/termination-numeric/Fibonacci01_true-termination_true-no-overflow.c [2018-10-27 05:45:31,513 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/data/a8346ec2c/a37e06b6bfc441ea8f0feb84bf86846a/FLAGd66b7f794 [2018-10-27 05:45:31,525 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/data/a8346ec2c/a37e06b6bfc441ea8f0feb84bf86846a [2018-10-27 05:45:31,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:45:31,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 05:45:31,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:45:31,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:45:31,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:45:31,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f0132f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31, skipping insertion in model container [2018-10-27 05:45:31,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:45:31,559 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:45:31,672 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:45:31,675 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:45:31,688 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:45:31,700 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:45:31,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31 WrapperNode [2018-10-27 05:45:31,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:45:31,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 05:45:31,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 05:45:31,702 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 05:45:31,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 05:45:31,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:45:31,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:45:31,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:45:31,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... [2018-10-27 05:45:31,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:45:31,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:45:31,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:45:31,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:45:31,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/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-10-27 05:45:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-10-27 05:45:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-10-27 05:45:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:45:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:45:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:45:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:45:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:45:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:45:32,259 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:45:32,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:45:32 BoogieIcfgContainer [2018-10-27 05:45:32,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:45:32,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:45:32,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:45:32,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:45:32,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:45:31" (1/3) ... [2018-10-27 05:45:32,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163ba346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:45:32, skipping insertion in model container [2018-10-27 05:45:32,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:31" (2/3) ... [2018-10-27 05:45:32,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163ba346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:45:32, skipping insertion in model container [2018-10-27 05:45:32,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:45:32" (3/3) ... [2018-10-27 05:45:32,267 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci01_true-termination_true-no-overflow.c [2018-10-27 05:45:32,275 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:45:32,283 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-27 05:45:32,297 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-10-27 05:45:32,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:45:32,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:45:32,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:45:32,329 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:45:32,329 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:45:32,329 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:45:32,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:45:32,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:45:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-10-27 05:45:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 05:45:32,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:32,359 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:32,361 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:32,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -587647383, now seen corresponding path program 1 times [2018-10-27 05:45:32,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:32,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:32,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:32,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:45:32,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:32,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:45:32,585 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:32,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:45:32,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:45:32,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:45:32,600 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 5 states. [2018-10-27 05:45:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:32,768 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-10-27 05:45:32,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:45:32,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-10-27 05:45:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:32,779 INFO L225 Difference]: With dead ends: 39 [2018-10-27 05:45:32,779 INFO L226 Difference]: Without dead ends: 26 [2018-10-27 05:45:32,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:45:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-27 05:45:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-27 05:45:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 05:45:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-10-27 05:45:32,818 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2018-10-27 05:45:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:32,818 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-10-27 05:45:32,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:45:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-10-27 05:45:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 05:45:32,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:32,820 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:32,820 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:32,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:32,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1037199647, now seen corresponding path program 1 times [2018-10-27 05:45:32,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:32,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:32,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:45:32,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:32,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:45:32,859 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:32,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:45:32,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:45:32,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:45:32,860 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-10-27 05:45:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:32,935 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-10-27 05:45:32,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:45:32,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-27 05:45:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:32,939 INFO L225 Difference]: With dead ends: 28 [2018-10-27 05:45:32,939 INFO L226 Difference]: Without dead ends: 26 [2018-10-27 05:45:32,940 INFO L605 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-10-27 05:45:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-27 05:45:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-10-27 05:45:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 05:45:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-10-27 05:45:32,946 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 12 [2018-10-27 05:45:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:32,946 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-10-27 05:45:32,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:45:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-10-27 05:45:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 05:45:32,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:32,948 INFO L375 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, 1] [2018-10-27 05:45:32,948 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:32,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1104671679, now seen corresponding path program 1 times [2018-10-27 05:45:32,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:32,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:32,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:32,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:32,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 05:45:33,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:33,208 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:33,209 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-27 05:45:33,210 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [14], [16], [18], [20], [21], [25], [26], [30], [34], [44], [45], [46], [47], [48], [49], [50], [52] [2018-10-27 05:45:33,246 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:45:33,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:45:33,359 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:45:33,361 INFO L272 AbstractInterpreter]: Visited 14 different actions 35 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-10-27 05:45:33,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:33,394 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:45:33,475 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-10-27 05:45:33,475 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:45:33,716 INFO L415 sIntCurrentIteration]: We unified 32 AI predicates to 32 [2018-10-27 05:45:33,717 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:45:33,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:33,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-27 05:45:33,718 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:33,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 05:45:33,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 05:45:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:45:33,720 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 12 states. [2018-10-27 05:45:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:34,897 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2018-10-27 05:45:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 05:45:34,898 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-10-27 05:45:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:34,899 INFO L225 Difference]: With dead ends: 100 [2018-10-27 05:45:34,899 INFO L226 Difference]: Without dead ends: 79 [2018-10-27 05:45:34,900 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-10-27 05:45:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-27 05:45:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-10-27 05:45:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 05:45:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2018-10-27 05:45:34,915 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 33 [2018-10-27 05:45:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:34,915 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2018-10-27 05:45:34,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 05:45:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2018-10-27 05:45:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 05:45:34,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:34,917 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:34,917 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:34,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1265115323, now seen corresponding path program 1 times [2018-10-27 05:45:34,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:34,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:34,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:34,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:34,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 05:45:34,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:34,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:45:34,979 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:34,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:45:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:45:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:45:34,981 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 6 states. [2018-10-27 05:45:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:35,177 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2018-10-27 05:45:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:45:35,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-10-27 05:45:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:35,183 INFO L225 Difference]: With dead ends: 118 [2018-10-27 05:45:35,183 INFO L226 Difference]: Without dead ends: 117 [2018-10-27 05:45:35,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:45:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-27 05:45:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-10-27 05:45:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-27 05:45:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2018-10-27 05:45:35,199 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 28 [2018-10-27 05:45:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:35,199 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2018-10-27 05:45:35,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:45:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2018-10-27 05:45:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 05:45:35,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:35,201 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:35,201 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:35,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash -563869295, now seen corresponding path program 1 times [2018-10-27 05:45:35,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:35,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:35,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:35,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:35,203 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 05:45:35,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:35,254 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:35,254 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 05:45:35,255 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [22], [23], [25], [26], [30], [34], [44], [45], [46], [47], [48], [49], [50], [52] [2018-10-27 05:45:35,257 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:45:35,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:45:35,538 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:45:35,538 INFO L272 AbstractInterpreter]: Visited 25 different actions 502 times. Merged at 5 different actions 65 times. Never widened. Found 19 fixpoints after 2 different actions. Largest state had 5 variables. [2018-10-27 05:45:35,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:35,546 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:45:35,584 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 46.49% of their original sizes. [2018-10-27 05:45:35,584 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:45:35,925 INFO L415 sIntCurrentIteration]: We unified 28 AI predicates to 28 [2018-10-27 05:45:35,925 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:45:35,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:35,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 17 [2018-10-27 05:45:35,926 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:35,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 05:45:35,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 05:45:35,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:45:35,927 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand 15 states. [2018-10-27 05:45:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:41,051 INFO L93 Difference]: Finished difference Result 265 states and 412 transitions. [2018-10-27 05:45:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 05:45:41,051 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-10-27 05:45:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:41,053 INFO L225 Difference]: With dead ends: 265 [2018-10-27 05:45:41,053 INFO L226 Difference]: Without dead ends: 207 [2018-10-27 05:45:41,055 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 05:45:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-27 05:45:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 172. [2018-10-27 05:45:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-27 05:45:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 233 transitions. [2018-10-27 05:45:41,107 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 233 transitions. Word has length 29 [2018-10-27 05:45:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:41,107 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 233 transitions. [2018-10-27 05:45:41,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 05:45:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 233 transitions. [2018-10-27 05:45:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 05:45:41,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:41,110 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:41,110 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:41,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash 575623792, now seen corresponding path program 1 times [2018-10-27 05:45:41,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:41,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 05:45:41,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:41,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:41,669 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-27 05:45:41,669 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [21], [22], [24], [25], [26], [30], [34], [44], [45], [46], [47], [48], [49], [50], [52] [2018-10-27 05:45:41,670 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:45:41,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:45:44,615 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:45:44,616 INFO L272 AbstractInterpreter]: Visited 26 different actions 10255 times. Merged at 10 different actions 2758 times. Never widened. Found 730 fixpoints after 5 different actions. Largest state had 5 variables. [2018-10-27 05:45:44,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:44,674 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:45:44,710 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 49.07% of their original sizes. [2018-10-27 05:45:44,710 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:45:46,161 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-10-27 05:45:46,161 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:45:46,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:46,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [7] total 30 [2018-10-27 05:45:46,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:46,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 05:45:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 05:45:46,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-10-27 05:45:46,162 INFO L87 Difference]: Start difference. First operand 172 states and 233 transitions. Second operand 25 states. [2018-10-27 05:45:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:59,621 INFO L93 Difference]: Finished difference Result 534 states and 766 transitions. [2018-10-27 05:45:59,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-27 05:45:59,621 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-10-27 05:45:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:59,625 INFO L225 Difference]: With dead ends: 534 [2018-10-27 05:45:59,626 INFO L226 Difference]: Without dead ends: 527 [2018-10-27 05:45:59,627 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 114 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1462, Invalid=5678, Unknown=0, NotChecked=0, Total=7140 [2018-10-27 05:45:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-27 05:45:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 190. [2018-10-27 05:45:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-27 05:45:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2018-10-27 05:45:59,683 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 48 [2018-10-27 05:45:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:59,684 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2018-10-27 05:45:59,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 05:45:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2018-10-27 05:45:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 05:45:59,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:59,687 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:59,687 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:59,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash -146526913, now seen corresponding path program 2 times [2018-10-27 05:45:59,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:59,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:59,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 29 proven. 41 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-27 05:46:00,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:00,133 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:00,133 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:46:00,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:46:00,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:00,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/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-10-27 05:46:00,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:46:00,146 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:46:00,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 05:46:00,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:46:00,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:46:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-27 05:46:00,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:46:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 05:46:01,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:46:01,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 13 [2018-10-27 05:46:01,629 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:46:01,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:46:01,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:46:01,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-10-27 05:46:01,630 INFO L87 Difference]: Start difference. First operand 190 states and 245 transitions. Second operand 8 states. [2018-10-27 05:46:02,091 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-27 05:46:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:02,616 INFO L93 Difference]: Finished difference Result 421 states and 589 transitions. [2018-10-27 05:46:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 05:46:02,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-27 05:46:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:02,620 INFO L225 Difference]: With dead ends: 421 [2018-10-27 05:46:02,625 INFO L226 Difference]: Without dead ends: 260 [2018-10-27 05:46:02,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-10-27 05:46:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-27 05:46:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 226. [2018-10-27 05:46:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-27 05:46:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 283 transitions. [2018-10-27 05:46:02,667 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 283 transitions. Word has length 74 [2018-10-27 05:46:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:02,667 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 283 transitions. [2018-10-27 05:46:02,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:46:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 283 transitions. [2018-10-27 05:46:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-27 05:46:02,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:02,670 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:02,671 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:02,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1974951518, now seen corresponding path program 3 times [2018-10-27 05:46:02,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:02,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:46:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:02,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:03,198 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-27 05:46:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 94 proven. 10 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-27 05:46:03,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:03,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:03,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:46:03,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:46:03,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:03,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/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-10-27 05:46:03,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:46:03,381 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:46:03,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:46:03,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:46:03,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:46:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 50 proven. 83 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-27 05:46:03,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:46:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 50 proven. 85 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-27 05:46:03,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:46:03,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2018-10-27 05:46:03,803 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:46:03,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 05:46:03,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 05:46:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-10-27 05:46:03,804 INFO L87 Difference]: Start difference. First operand 226 states and 283 transitions. Second operand 14 states. [2018-10-27 05:46:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:04,266 INFO L93 Difference]: Finished difference Result 507 states and 682 transitions. [2018-10-27 05:46:04,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 05:46:04,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2018-10-27 05:46:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:04,272 INFO L225 Difference]: With dead ends: 507 [2018-10-27 05:46:04,272 INFO L226 Difference]: Without dead ends: 323 [2018-10-27 05:46:04,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 169 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2018-10-27 05:46:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-27 05:46:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 283. [2018-10-27 05:46:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-27 05:46:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 348 transitions. [2018-10-27 05:46:04,305 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 348 transitions. Word has length 92 [2018-10-27 05:46:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:04,305 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 348 transitions. [2018-10-27 05:46:04,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 05:46:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 348 transitions. [2018-10-27 05:46:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-27 05:46:04,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:04,309 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:04,309 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:04,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash -522456999, now seen corresponding path program 4 times [2018-10-27 05:46:04,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:04,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:46:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:04,311 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 113 proven. 98 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-27 05:46:05,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:05,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:05,134 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:46:05,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:46:05,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:05,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/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-10-27 05:46:05,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:05,141 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:46:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:05,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:46:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 70 proven. 156 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-27 05:46:05,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:46:05,773 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 05:46:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 69 proven. 167 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-27 05:46:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:46:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 20 [2018-10-27 05:46:06,038 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:46:06,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 05:46:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 05:46:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-10-27 05:46:06,039 INFO L87 Difference]: Start difference. First operand 283 states and 348 transitions. Second operand 14 states. [2018-10-27 05:46:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:06,298 INFO L93 Difference]: Finished difference Result 589 states and 777 transitions. [2018-10-27 05:46:06,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 05:46:06,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-10-27 05:46:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:06,306 INFO L225 Difference]: With dead ends: 589 [2018-10-27 05:46:06,306 INFO L226 Difference]: Without dead ends: 364 [2018-10-27 05:46:06,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 197 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2018-10-27 05:46:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-27 05:46:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 338. [2018-10-27 05:46:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-27 05:46:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 421 transitions. [2018-10-27 05:46:06,332 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 421 transitions. Word has length 107 [2018-10-27 05:46:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:06,332 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 421 transitions. [2018-10-27 05:46:06,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 05:46:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 421 transitions. [2018-10-27 05:46:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-27 05:46:06,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:06,344 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 13, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:06,344 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:06,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1101995469, now seen corresponding path program 5 times [2018-10-27 05:46:06,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:06,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:06,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2018-10-27 05:46:06,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:06,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:06,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:46:06,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:46:06,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:06,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/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-10-27 05:46:06,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:46:06,589 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:46:06,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-10-27 05:46:06,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:46:06,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:46:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2018-10-27 05:46:06,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:46:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-10-27 05:46:07,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:46:07,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2018-10-27 05:46:07,758 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:46:07,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 05:46:07,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 05:46:07,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-10-27 05:46:07,759 INFO L87 Difference]: Start difference. First operand 338 states and 421 transitions. Second operand 17 states. [2018-10-27 05:46:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:07,882 INFO L93 Difference]: Finished difference Result 635 states and 843 transitions. [2018-10-27 05:46:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 05:46:07,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 152 [2018-10-27 05:46:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:07,889 INFO L225 Difference]: With dead ends: 635 [2018-10-27 05:46:07,889 INFO L226 Difference]: Without dead ends: 634 [2018-10-27 05:46:07,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 291 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-10-27 05:46:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-10-27 05:46:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 476. [2018-10-27 05:46:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-10-27 05:46:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 616 transitions. [2018-10-27 05:46:07,924 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 616 transitions. Word has length 152 [2018-10-27 05:46:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:07,925 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 616 transitions. [2018-10-27 05:46:07,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 05:46:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 616 transitions. [2018-10-27 05:46:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 05:46:07,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:07,929 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 15, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:07,929 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:07,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:07,929 INFO L82 PathProgramCache]: Analyzing trace with hash -108383138, now seen corresponding path program 6 times [2018-10-27 05:46:07,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:07,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:07,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:46:07,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:07,930 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 160 proven. 257 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2018-10-27 05:46:08,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:08,153 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:08,153 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:46:08,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:46:08,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:08,153 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/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-10-27 05:46:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:46:08,159 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:46:08,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:46:08,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:46:08,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:46:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 561 proven. 31 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-10-27 05:46:08,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:46:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 161 proven. 256 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2018-10-27 05:46:08,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:46:08,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 16 [2018-10-27 05:46:08,693 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:46:08,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 05:46:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 05:46:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:46:08,694 INFO L87 Difference]: Start difference. First operand 476 states and 616 transitions. Second operand 12 states. [2018-10-27 05:46:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:08,849 INFO L93 Difference]: Finished difference Result 758 states and 1016 transitions. [2018-10-27 05:46:08,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 05:46:08,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-10-27 05:46:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:08,852 INFO L225 Difference]: With dead ends: 758 [2018-10-27 05:46:08,854 INFO L226 Difference]: Without dead ends: 432 [2018-10-27 05:46:08,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 333 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2018-10-27 05:46:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-10-27 05:46:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2018-10-27 05:46:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-27 05:46:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 533 transitions. [2018-10-27 05:46:08,884 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 533 transitions. Word has length 172 [2018-10-27 05:46:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:08,886 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 533 transitions. [2018-10-27 05:46:08,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 05:46:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 533 transitions. [2018-10-27 05:46:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-27 05:46:08,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:08,890 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 13, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:08,890 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:08,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash 197878883, now seen corresponding path program 1 times [2018-10-27 05:46:08,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:08,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:46:08,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:08,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 76 proven. 189 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-27 05:46:09,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:09,566 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:09,567 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-10-27 05:46:09,567 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [14], [16], [18], [20], [22], [23], [24], [25], [26], [30], [34], [44], [45], [46], [47], [48], [49], [50], [52] [2018-10-27 05:46:09,568 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:46:09,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:46:11,959 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:46:11,959 INFO L272 AbstractInterpreter]: Visited 26 different actions 10255 times. Merged at 10 different actions 2758 times. Never widened. Found 730 fixpoints after 5 different actions. Largest state had 5 variables. [2018-10-27 05:46:12,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:12,002 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:46:12,096 INFO L227 lantSequenceWeakener]: Weakened 103 states. On average, predicates are now at 44.58% of their original sizes. [2018-10-27 05:46:12,097 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:46:14,693 INFO L415 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2018-10-27 05:46:14,693 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:46:14,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:46:14,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [12] total 57 [2018-10-27 05:46:14,694 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:14,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-27 05:46:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-27 05:46:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1751, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 05:46:14,695 INFO L87 Difference]: Start difference. First operand 432 states and 533 transitions. Second operand 46 states. [2018-10-27 05:46:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:15,972 INFO L93 Difference]: Finished difference Result 444 states and 557 transitions. [2018-10-27 05:46:15,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 05:46:15,973 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 153 [2018-10-27 05:46:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:15,973 INFO L225 Difference]: With dead ends: 444 [2018-10-27 05:46:15,973 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 05:46:15,977 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 98 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=599, Invalid=2941, Unknown=0, NotChecked=0, Total=3540 [2018-10-27 05:46:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 05:46:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 05:46:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 05:46:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 05:46:15,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2018-10-27 05:46:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:15,978 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 05:46:15,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-27 05:46:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 05:46:15,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 05:46:15,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 05:46:16,389 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 17 [2018-10-27 05:46:16,540 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 21 [2018-10-27 05:46:16,542 INFO L425 ceAbstractionStarter]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,542 INFO L425 ceAbstractionStarter]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,542 INFO L425 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-10-27 05:46:16,542 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-10-27 05:46:16,543 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-10-27 05:46:16,543 INFO L425 ceAbstractionStarter]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,543 INFO L425 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-10-27 05:46:16,543 INFO L428 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-10-27 05:46:16,543 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,543 INFO L425 ceAbstractionStarter]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,543 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,543 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (* 2 |fibonacci_#in~n|))) (and (or (< 1 |fibonacci_#in~n|) (< .cse0 0)) (or (and (<= |fibonacci_#in~n| fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) (< 2147483647 |fibonacci_#in~n|) (< .cse0 2)))) [2018-10-27 05:46:16,543 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,543 INFO L425 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L421 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse0 (* 2 |fibonacci_#in~n|))) (and (or (< 4294967286 .cse0) (< .cse0 0)) (or (< 2147483647 |fibonacci_#in~n|) (< .cse0 2)))) [2018-10-27 05:46:16,544 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L425 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L425 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L425 ceAbstractionStarter]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L425 ceAbstractionStarter]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 05:46:16,544 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:46:16,544 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 05:46:16,544 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 05:46:16,545 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 05:46:16,545 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-27 05:46:16,545 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 34) no Hoare annotation was computed. [2018-10-27 05:46:16,545 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 25 35) the Hoare annotation is: true [2018-10-27 05:46:16,545 INFO L421 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (* 2 main_~x~0))) (and (<= 2 .cse0) (<= .cse0 4294967294))) [2018-10-27 05:46:16,545 INFO L425 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-10-27 05:46:16,545 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 28) no Hoare annotation was computed. [2018-10-27 05:46:16,545 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 25 35) no Hoare annotation was computed. [2018-10-27 05:46:16,545 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 25 35) no Hoare annotation was computed. [2018-10-27 05:46:16,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:46:16 BoogieIcfgContainer [2018-10-27 05:46:16,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:46:16,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:46:16,548 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:46:16,548 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:46:16,549 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:45:32" (3/4) ... [2018-10-27 05:46:16,552 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 05:46:16,559 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-10-27 05:46:16,559 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 05:46:16,559 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 05:46:16,563 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-27 05:46:16,563 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 05:46:16,564 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:46:16,608 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b2ab9aa4-bc81-4f84-87af-b50b01febd34/bin-2019/utaipan/witness.graphml [2018-10-27 05:46:16,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:46:16,609 INFO L168 Benchmark]: Toolchain (without parser) took 45081.18 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 740.3 MB). Free memory was 960.7 MB in the beginning and 895.7 MB in the end (delta: 65.0 MB). Peak memory consumption was 805.3 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:16,610 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:46:16,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.45 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:16,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.20 ms. Allocated memory is still 1.0 GB. Free memory is still 950.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:46:16,611 INFO L168 Benchmark]: Boogie Preprocessor took 17.88 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:16,611 INFO L168 Benchmark]: RCFGBuilder took 521.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:16,612 INFO L168 Benchmark]: TraceAbstraction took 44287.63 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 584.6 MB). Free memory was 1.1 GB in the beginning and 912.0 MB in the end (delta: 230.4 MB). Peak memory consumption was 814.9 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:16,612 INFO L168 Benchmark]: Witness Printer took 60.30 ms. Allocated memory is still 1.8 GB. Free memory was 912.0 MB in the beginning and 895.7 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:16,618 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.45 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.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 19.20 ms. Allocated memory is still 1.0 GB. Free memory is still 950.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.88 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 521.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44287.63 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 584.6 MB). Free memory was 1.1 GB in the beginning and 912.0 MB in the end (delta: 230.4 MB). Peak memory consumption was 814.9 MB. Max. memory is 11.5 GB. * Witness Printer took 60.30 ms. Allocated memory is still 1.8 GB. Free memory was 912.0 MB in the beginning and 895.7 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. 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, 35 locations, 6 error locations. SAFE Result, 44.2s OverallTime, 12 OverallIterations, 18 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 301 SDtfs, 1462 SDslu, 1078 SDs, 0 SdLazy, 2000 SolverSat, 777 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1680 GetRequests, 1287 SyntacticMatches, 70 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4571 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.9s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9297297297297309 AbsIntWeakeningRatio, 0.4015444015444015 AbsIntAvgWeakeningVarsNumRemoved, 3.5714285714285716 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 659 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 476 PreInvPairs, 494 NumberOfFragments, 71 HoareAnnotationTreeSize, 476 FomulaSimplifications, 2005 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2001 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1381 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2083 ConstructedInterpolants, 0 QuantifiedInterpolants, 515967 SizeOfPredicates, 22 NumberOfNonLiveVariables, 932 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 6152/7969 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...