./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 675300a4b632e073b31d1e86ab5660e0c5ab887b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 05:17:56,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:17:56,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:17:56,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:17:56,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:17:56,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:17:56,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:17:56,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:17:56,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:17:56,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:17:56,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:17:56,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:17:56,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:17:56,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:17:56,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:17:56,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:17:56,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:17:56,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:17:56,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:17:56,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:17:56,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:17:56,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:17:56,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:17:56,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:17:56,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:17:56,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:17:56,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:17:56,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:17:56,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:17:56,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:17:56,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:17:56,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:17:56,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:17:56,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:17:56,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:17:56,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:17:56,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:17:56,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:17:56,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:17:56,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:17:56,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:17:56,111 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2020-12-09 05:17:56,138 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:17:56,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:17:56,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:17:56,139 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:17:56,139 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:17:56,139 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:17:56,139 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:17:56,139 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:17:56,144 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:17:56,144 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:17:56,145 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:17:56,145 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:17:56,145 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:17:56,145 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:17:56,145 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:17:56,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:17:56,146 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:17:56,146 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 05:17:56,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:17:56,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:17:56,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:17:56,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 05:17:56,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:17:56,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 05:17:56,147 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-12-09 05:17:56,147 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:17:56,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 05:17:56,147 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:17:56,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 05:17:56,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:17:56,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:17:56,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:17:56,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:17:56,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:17:56,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 05:17:56,149 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:17:56,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:17:56,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 05:17:56,149 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:17:56,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:17:56,149 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 675300a4b632e073b31d1e86ab5660e0c5ab887b [2020-12-09 05:17:56,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:17:56,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:17:56,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:17:56,357 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:17:56,357 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:17:56,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci02.c [2020-12-09 05:17:56,406 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/data/2ca318b10/a5eec4c01dbb4124bfa24350b9ed75aa/FLAG3118a92b8 [2020-12-09 05:17:56,753 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:17:56,754 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/sv-benchmarks/c/recursive/Fibonacci02.c [2020-12-09 05:17:56,758 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/data/2ca318b10/a5eec4c01dbb4124bfa24350b9ed75aa/FLAG3118a92b8 [2020-12-09 05:17:56,772 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/data/2ca318b10/a5eec4c01dbb4124bfa24350b9ed75aa [2020-12-09 05:17:56,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:17:56,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:17:56,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:17:56,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:17:56,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:17:56,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fcb71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56, skipping insertion in model container [2020-12-09 05:17:56,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:17:56,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:17:56,900 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/sv-benchmarks/c/recursive/Fibonacci02.c[715,728] [2020-12-09 05:17:56,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:17:56,907 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:17:56,916 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/sv-benchmarks/c/recursive/Fibonacci02.c[715,728] [2020-12-09 05:17:56,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:17:56,926 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:17:56,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56 WrapperNode [2020-12-09 05:17:56,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:17:56,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:17:56,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:17:56,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:17:56,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:17:56,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:17:56,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:17:56,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:17:56,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... [2020-12-09 05:17:56,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:17:56,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:17:56,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:17:56,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:17:56,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/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 [2020-12-09 05:17:57,017 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-12-09 05:17:57,017 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-12-09 05:17:57,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:17:57,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:17:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:17:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:17:57,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:17:57,198 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 05:17:57,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:17:57 BoogieIcfgContainer [2020-12-09 05:17:57,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:17:57,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:17:57,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:17:57,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:17:57,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:17:56" (1/3) ... [2020-12-09 05:17:57,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7640e6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:17:57, skipping insertion in model container [2020-12-09 05:17:57,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:17:56" (2/3) ... [2020-12-09 05:17:57,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7640e6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:17:57, skipping insertion in model container [2020-12-09 05:17:57,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:17:57" (3/3) ... [2020-12-09 05:17:57,207 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2020-12-09 05:17:57,217 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:17:57,219 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-12-09 05:17:57,227 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 05:17:57,243 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:17:57,243 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 05:17:57,243 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:17:57,244 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:17:57,244 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:17:57,244 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:17:57,244 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:17:57,244 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:17:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-12-09 05:17:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 05:17:57,260 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:17:57,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 05:17:57,261 INFO L429 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:17:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:17:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2020330972, now seen corresponding path program 1 times [2020-12-09 05:17:57,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:17:57,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108580067] [2020-12-09 05:17:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:17:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:17:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:17:57,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108580067] [2020-12-09 05:17:57,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:17:57,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:17:57,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060204481] [2020-12-09 05:17:57,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:17:57,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:17:57,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:17:57,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:17:57,415 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-12-09 05:17:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:17:57,476 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-12-09 05:17:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:17:57,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 05:17:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:17:57,482 INFO L225 Difference]: With dead ends: 25 [2020-12-09 05:17:57,482 INFO L226 Difference]: Without dead ends: 21 [2020-12-09 05:17:57,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:17:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-12-09 05:17:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-12-09 05:17:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-09 05:17:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-12-09 05:17:57,509 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2020-12-09 05:17:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:17:57,510 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-12-09 05:17:57,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:17:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-12-09 05:17:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 05:17:57,511 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:17:57,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:17:57,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:17:57,511 INFO L429 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:17:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:17:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1794249350, now seen corresponding path program 1 times [2020-12-09 05:17:57,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:17:57,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951356615] [2020-12-09 05:17:57,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:17:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:17:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:17:57,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951356615] [2020-12-09 05:17:57,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:17:57,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:17:57,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809515080] [2020-12-09 05:17:57,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:17:57,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:17:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:17:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:17:57,537 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2020-12-09 05:17:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:17:57,557 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-12-09 05:17:57,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:17:57,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 05:17:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:17:57,559 INFO L225 Difference]: With dead ends: 23 [2020-12-09 05:17:57,559 INFO L226 Difference]: Without dead ends: 21 [2020-12-09 05:17:57,560 INFO L677 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 [2020-12-09 05:17:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-12-09 05:17:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-12-09 05:17:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-09 05:17:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-12-09 05:17:57,567 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2020-12-09 05:17:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:17:57,568 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-12-09 05:17:57,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:17:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-12-09 05:17:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 05:17:57,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:17:57,569 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:17:57,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:17:57,569 INFO L429 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:17:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:17:57,570 INFO L82 PathProgramCache]: Analyzing trace with hash -542004053, now seen corresponding path program 1 times [2020-12-09 05:17:57,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:17:57,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141963655] [2020-12-09 05:17:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:17:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:17:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-09 05:17:57,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141963655] [2020-12-09 05:17:57,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:17:57,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:17:57,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762364839] [2020-12-09 05:17:57,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:17:57,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:17:57,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:17:57,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:17:57,650 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2020-12-09 05:17:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:17:57,685 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-12-09 05:17:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:17:57,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-12-09 05:17:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:17:57,687 INFO L225 Difference]: With dead ends: 35 [2020-12-09 05:17:57,687 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 05:17:57,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:17:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 05:17:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-12-09 05:17:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 05:17:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-12-09 05:17:57,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 28 [2020-12-09 05:17:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:17:57,696 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-12-09 05:17:57,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:17:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-12-09 05:17:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:17:57,698 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:17:57,698 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:17:57,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 05:17:57,698 INFO L429 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:17:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:17:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1711671878, now seen corresponding path program 1 times [2020-12-09 05:17:57,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:17:57,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604153082] [2020-12-09 05:17:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:17:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:17:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 05:17:57,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604153082] [2020-12-09 05:17:57,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033023882] [2020-12-09 05:17:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:17:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:17:57,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:17:57,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:17:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:17:57,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:17:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:17:57,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1476101934] [2020-12-09 05:17:57,979 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 05:17:57,979 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:17:57,983 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:17:57,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:17:57,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2020-12-09 05:17:57,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788050711] [2020-12-09 05:17:57,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 05:17:57,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:17:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 05:17:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-12-09 05:17:57,986 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 15 states. [2020-12-09 05:17:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:17:58,264 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2020-12-09 05:17:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 05:17:58,264 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-12-09 05:17:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:17:58,266 INFO L225 Difference]: With dead ends: 125 [2020-12-09 05:17:58,266 INFO L226 Difference]: Without dead ends: 92 [2020-12-09 05:17:58,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-12-09 05:17:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-12-09 05:17:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2020-12-09 05:17:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-12-09 05:17:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2020-12-09 05:17:58,284 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 23 [2020-12-09 05:17:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:17:58,284 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2020-12-09 05:17:58,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 05:17:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2020-12-09 05:17:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 05:17:58,285 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:17:58,285 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:17:58,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:17:58,488 INFO L429 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:17:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:17:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1617377023, now seen corresponding path program 2 times [2020-12-09 05:17:58,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:17:58,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006783953] [2020-12-09 05:17:58,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:17:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:17:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-09 05:17:58,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006783953] [2020-12-09 05:17:58,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420949908] [2020-12-09 05:17:58,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:17:58,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 05:17:58,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:17:58,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 05:17:58,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:17:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-09 05:17:58,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:17:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-09 05:17:58,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:17:58,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2020-12-09 05:17:58,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389807950] [2020-12-09 05:17:58,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:17:58,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:17:58,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:17:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:17:58,696 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand 6 states. [2020-12-09 05:17:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:17:58,729 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2020-12-09 05:17:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:17:58,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-12-09 05:17:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:17:58,731 INFO L225 Difference]: With dead ends: 94 [2020-12-09 05:17:58,731 INFO L226 Difference]: Without dead ends: 93 [2020-12-09 05:17:58,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:17:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-09 05:17:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2020-12-09 05:17:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-09 05:17:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2020-12-09 05:17:58,744 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 29 [2020-12-09 05:17:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:17:58,744 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2020-12-09 05:17:58,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:17:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2020-12-09 05:17:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 05:17:58,745 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:17:58,745 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:17:58,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:17:58,947 INFO L429 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:17:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:17:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1400919893, now seen corresponding path program 1 times [2020-12-09 05:17:58,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:17:58,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774411504] [2020-12-09 05:17:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:17:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:17:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-09 05:17:59,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774411504] [2020-12-09 05:17:59,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692788036] [2020-12-09 05:17:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:17:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:17:59,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:17:59,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:17:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:17:59,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:17:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:17:59,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [953106146] [2020-12-09 05:17:59,253 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:17:59,253 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:17:59,253 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:17:59,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:17:59,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2020-12-09 05:17:59,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267060585] [2020-12-09 05:17:59,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 05:17:59,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:17:59,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 05:17:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2020-12-09 05:17:59,255 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand 19 states. [2020-12-09 05:17:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:17:59,787 INFO L93 Difference]: Finished difference Result 286 states and 441 transitions. [2020-12-09 05:17:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 05:17:59,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2020-12-09 05:17:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:17:59,790 INFO L225 Difference]: With dead ends: 286 [2020-12-09 05:17:59,790 INFO L226 Difference]: Without dead ends: 210 [2020-12-09 05:17:59,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2020-12-09 05:17:59,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-12-09 05:17:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2020-12-09 05:17:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-09 05:17:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 254 transitions. [2020-12-09 05:17:59,812 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 254 transitions. Word has length 30 [2020-12-09 05:17:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:17:59,813 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 254 transitions. [2020-12-09 05:17:59,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 05:17:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 254 transitions. [2020-12-09 05:17:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-09 05:17:59,814 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:17:59,814 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:18:00,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:00,016 INFO L429 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:00,017 INFO L82 PathProgramCache]: Analyzing trace with hash 38315030, now seen corresponding path program 1 times [2020-12-09 05:18:00,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:00,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314727270] [2020-12-09 05:18:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-12-09 05:18:00,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314727270] [2020-12-09 05:18:00,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:18:00,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:18:00,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194191252] [2020-12-09 05:18:00,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:18:00,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:18:00,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:18:00,090 INFO L87 Difference]: Start difference. First operand 174 states and 254 transitions. Second operand 5 states. [2020-12-09 05:18:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:00,118 INFO L93 Difference]: Finished difference Result 191 states and 277 transitions. [2020-12-09 05:18:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:18:00,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-12-09 05:18:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:00,121 INFO L225 Difference]: With dead ends: 191 [2020-12-09 05:18:00,121 INFO L226 Difference]: Without dead ends: 189 [2020-12-09 05:18:00,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:18:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-09 05:18:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2020-12-09 05:18:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-09 05:18:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2020-12-09 05:18:00,137 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 48 [2020-12-09 05:18:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:00,138 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2020-12-09 05:18:00,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:18:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2020-12-09 05:18:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-09 05:18:00,141 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:18:00,141 INFO L422 BasicCegarLoop]: trace histogram [11, 9, 7, 7, 7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 05:18:00,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 05:18:00,141 INFO L429 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:00,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1211935813, now seen corresponding path program 1 times [2020-12-09 05:18:00,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:00,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465500867] [2020-12-09 05:18:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2020-12-09 05:18:00,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465500867] [2020-12-09 05:18:00,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957888046] [2020-12-09 05:18:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:00,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:18:00,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:18:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 116 proven. 75 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-12-09 05:18:00,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:18:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 35 proven. 175 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-09 05:18:00,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1782182699] [2020-12-09 05:18:00,604 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:18:00,604 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:18:00,604 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:18:00,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:18:00,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15, 15] total 24 [2020-12-09 05:18:00,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349027354] [2020-12-09 05:18:00,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 05:18:00,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 05:18:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2020-12-09 05:18:00,607 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand 24 states. [2020-12-09 05:18:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:01,134 INFO L93 Difference]: Finished difference Result 496 states and 796 transitions. [2020-12-09 05:18:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 05:18:01,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2020-12-09 05:18:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:01,137 INFO L225 Difference]: With dead ends: 496 [2020-12-09 05:18:01,138 INFO L226 Difference]: Without dead ends: 329 [2020-12-09 05:18:01,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 05:18:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-12-09 05:18:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 301. [2020-12-09 05:18:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-12-09 05:18:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 413 transitions. [2020-12-09 05:18:01,160 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 413 transitions. Word has length 81 [2020-12-09 05:18:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:01,160 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 413 transitions. [2020-12-09 05:18:01,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 05:18:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 413 transitions. [2020-12-09 05:18:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-09 05:18:01,163 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:18:01,163 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 05:18:01,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:01,365 INFO L429 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1558213604, now seen corresponding path program 1 times [2020-12-09 05:18:01,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:01,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570833131] [2020-12-09 05:18:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-12-09 05:18:01,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570833131] [2020-12-09 05:18:01,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522808873] [2020-12-09 05:18:01,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:01,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 05:18:01,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:18:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 108 proven. 184 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-09 05:18:01,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:18:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 3 proven. 293 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-09 05:18:01,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [133900124] [2020-12-09 05:18:01,811 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:18:01,811 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:18:01,811 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:18:01,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:18:01,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 21, 21] total 25 [2020-12-09 05:18:01,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180693534] [2020-12-09 05:18:01,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 05:18:01,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 05:18:01,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2020-12-09 05:18:01,813 INFO L87 Difference]: Start difference. First operand 301 states and 413 transitions. Second operand 25 states. [2020-12-09 05:18:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:02,271 INFO L93 Difference]: Finished difference Result 642 states and 931 transitions. [2020-12-09 05:18:02,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 05:18:02,271 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2020-12-09 05:18:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:02,273 INFO L225 Difference]: With dead ends: 642 [2020-12-09 05:18:02,274 INFO L226 Difference]: Without dead ends: 361 [2020-12-09 05:18:02,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 05:18:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-12-09 05:18:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 324. [2020-12-09 05:18:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-09 05:18:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 439 transitions. [2020-12-09 05:18:02,292 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 439 transitions. Word has length 86 [2020-12-09 05:18:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:02,292 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 439 transitions. [2020-12-09 05:18:02,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 05:18:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 439 transitions. [2020-12-09 05:18:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-09 05:18:02,294 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:18:02,294 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 05:18:02,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:02,494 INFO L429 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1652099326, now seen corresponding path program 2 times [2020-12-09 05:18:02,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:02,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026625162] [2020-12-09 05:18:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-09 05:18:02,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026625162] [2020-12-09 05:18:02,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126722796] [2020-12-09 05:18:02,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:02,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 05:18:02,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:18:02,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:18:02,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:18:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2020-12-09 05:18:02,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:18:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2020-12-09 05:18:02,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [824488396] [2020-12-09 05:18:02,906 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:18:02,907 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:18:02,907 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:18:02,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:18:02,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 27 [2020-12-09 05:18:02,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530417591] [2020-12-09 05:18:02,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 05:18:02,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 05:18:02,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:18:02,908 INFO L87 Difference]: Start difference. First operand 324 states and 439 transitions. Second operand 27 states. [2020-12-09 05:18:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:03,424 INFO L93 Difference]: Finished difference Result 492 states and 667 transitions. [2020-12-09 05:18:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-09 05:18:03,424 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2020-12-09 05:18:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:03,426 INFO L225 Difference]: With dead ends: 492 [2020-12-09 05:18:03,426 INFO L226 Difference]: Without dead ends: 188 [2020-12-09 05:18:03,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=585, Invalid=1485, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 05:18:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-09 05:18:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2020-12-09 05:18:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-12-09 05:18:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 204 transitions. [2020-12-09 05:18:03,435 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 204 transitions. Word has length 85 [2020-12-09 05:18:03,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:03,436 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 204 transitions. [2020-12-09 05:18:03,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 05:18:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 204 transitions. [2020-12-09 05:18:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-09 05:18:03,436 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:18:03,437 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 05:18:03,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:03,638 INFO L429 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:03,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash 121233731, now seen corresponding path program 3 times [2020-12-09 05:18:03,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:03,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869792539] [2020-12-09 05:18:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2020-12-09 05:18:03,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869792539] [2020-12-09 05:18:03,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973033291] [2020-12-09 05:18:03,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:03,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:18:03,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:18:03,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 05:18:03,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:18:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2020-12-09 05:18:03,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:18:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2020-12-09 05:18:04,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [933471787] [2020-12-09 05:18:04,057 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:18:04,057 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:18:04,058 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:18:04,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:18:04,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2020-12-09 05:18:04,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334732562] [2020-12-09 05:18:04,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 05:18:04,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 05:18:04,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-12-09 05:18:04,059 INFO L87 Difference]: Start difference. First operand 176 states and 204 transitions. Second operand 16 states. [2020-12-09 05:18:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:04,121 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2020-12-09 05:18:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 05:18:04,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-12-09 05:18:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:04,122 INFO L225 Difference]: With dead ends: 179 [2020-12-09 05:18:04,122 INFO L226 Difference]: Without dead ends: 177 [2020-12-09 05:18:04,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-12-09 05:18:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-12-09 05:18:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2020-12-09 05:18:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-12-09 05:18:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2020-12-09 05:18:04,129 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 79 [2020-12-09 05:18:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:04,129 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2020-12-09 05:18:04,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 05:18:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2020-12-09 05:18:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-09 05:18:04,130 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:18:04,130 INFO L422 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1] [2020-12-09 05:18:04,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:04,331 INFO L429 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 872377678, now seen corresponding path program 2 times [2020-12-09 05:18:04,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:04,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993554047] [2020-12-09 05:18:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 14 proven. 67 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2020-12-09 05:18:04,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993554047] [2020-12-09 05:18:04,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083569749] [2020-12-09 05:18:04,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:04,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-12-09 05:18:04,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:18:04,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:18:04,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:18:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2020-12-09 05:18:04,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:18:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2020-12-09 05:18:04,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1454258559] [2020-12-09 05:18:04,822 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:18:04,822 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:18:04,822 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:18:04,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:18:04,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 18 [2020-12-09 05:18:04,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307972242] [2020-12-09 05:18:04,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 05:18:04,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 05:18:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2020-12-09 05:18:04,824 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand 19 states. [2020-12-09 05:18:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:04,930 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2020-12-09 05:18:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 05:18:04,931 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 113 [2020-12-09 05:18:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:04,932 INFO L225 Difference]: With dead ends: 176 [2020-12-09 05:18:04,932 INFO L226 Difference]: Without dead ends: 174 [2020-12-09 05:18:04,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2020-12-09 05:18:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-09 05:18:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-12-09 05:18:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-09 05:18:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2020-12-09 05:18:04,941 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 113 [2020-12-09 05:18:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:04,941 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2020-12-09 05:18:04,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 05:18:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2020-12-09 05:18:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-12-09 05:18:04,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:18:04,944 INFO L422 BasicCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1] [2020-12-09 05:18:05,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-09 05:18:05,145 INFO L429 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1026358286, now seen corresponding path program 4 times [2020-12-09 05:18:05,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:05,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604535832] [2020-12-09 05:18:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 183 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2020-12-09 05:18:05,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604535832] [2020-12-09 05:18:05,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178705616] [2020-12-09 05:18:05,413 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:05,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-09 05:18:05,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:18:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2020-12-09 05:18:05,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:18:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-12-09 05:18:06,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1279602489] [2020-12-09 05:18:06,459 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:18:06,459 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:18:06,459 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:18:06,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:18:06,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2020-12-09 05:18:06,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337272983] [2020-12-09 05:18:06,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-09 05:18:06,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-09 05:18:06,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2020-12-09 05:18:06,462 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 32 states. [2020-12-09 05:18:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:06,545 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2020-12-09 05:18:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 05:18:06,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 165 [2020-12-09 05:18:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:06,547 INFO L225 Difference]: With dead ends: 175 [2020-12-09 05:18:06,547 INFO L226 Difference]: Without dead ends: 174 [2020-12-09 05:18:06,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 05:18:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-09 05:18:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-12-09 05:18:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-09 05:18:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2020-12-09 05:18:06,553 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 165 [2020-12-09 05:18:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:06,553 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2020-12-09 05:18:06,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-09 05:18:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2020-12-09 05:18:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2020-12-09 05:18:06,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:18:06,558 INFO L422 BasicCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1] [2020-12-09 05:18:06,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:06,759 INFO L429 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1349032591, now seen corresponding path program 5 times [2020-12-09 05:18:06,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:06,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466500011] [2020-12-09 05:18:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 830 proven. 1451 refuted. 0 times theorem prover too weak. 3684 trivial. 0 not checked. [2020-12-09 05:18:07,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466500011] [2020-12-09 05:18:07,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151342764] [2020-12-09 05:18:07,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:07,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2020-12-09 05:18:07,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:18:07,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 81 conjunts are in the unsatisfiable core [2020-12-09 05:18:07,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:18:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2020-12-09 05:18:07,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:18:09,933 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:10,052 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:10,174 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:10,293 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 1149 proven. 996 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2020-12-09 05:18:12,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [259171847] [2020-12-09 05:18:12,332 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:18:12,332 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:18:12,332 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:18:12,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:18:12,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 45 [2020-12-09 05:18:12,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216739569] [2020-12-09 05:18:12,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-12-09 05:18:12,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:12,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-12-09 05:18:12,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 05:18:12,335 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 46 states. [2020-12-09 05:18:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:12,443 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2020-12-09 05:18:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 05:18:12,443 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 408 [2020-12-09 05:18:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:12,445 INFO L225 Difference]: With dead ends: 175 [2020-12-09 05:18:12,445 INFO L226 Difference]: Without dead ends: 174 [2020-12-09 05:18:12,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=510, Invalid=1746, Unknown=0, NotChecked=0, Total=2256 [2020-12-09 05:18:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-09 05:18:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-12-09 05:18:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-09 05:18:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2020-12-09 05:18:12,450 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 408 [2020-12-09 05:18:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:12,451 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2020-12-09 05:18:12,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-12-09 05:18:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2020-12-09 05:18:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2020-12-09 05:18:12,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:18:12,482 INFO L422 BasicCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1] [2020-12-09 05:18:12,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:12,683 INFO L429 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-12-09 05:18:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:18:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1694597007, now seen corresponding path program 6 times [2020-12-09 05:18:12,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:18:12,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112896820] [2020-12-09 05:18:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:18:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:18:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6794 proven. 10214 refuted. 0 times theorem prover too weak. 24405 trivial. 0 not checked. [2020-12-09 05:18:14,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112896820] [2020-12-09 05:18:14,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187895212] [2020-12-09 05:18:14,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:18:14,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:18:14,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:18:14,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 1997 conjuncts, 217 conjunts are in the unsatisfiable core [2020-12-09 05:18:14,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:18:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2020-12-09 05:18:16,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:18:17,082 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:17,201 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:17,324 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:17,460 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:18,264 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-09 05:18:18,532 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-09 05:18:18,842 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 05:18:19,137 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 05:18:21,469 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:21,597 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:21,732 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:21,861 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:24,674 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:24,791 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:24,934 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:25,058 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:25,893 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-09 05:18:26,191 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-09 05:18:26,477 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 05:18:26,758 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 05:18:27,715 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:27,849 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:27,989 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:28,128 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:28,869 WARN L197 SmtUtils]: Spent 735.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2020-12-09 05:18:29,606 WARN L197 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2020-12-09 05:18:30,379 WARN L197 SmtUtils]: Spent 765.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2020-12-09 05:18:31,109 WARN L197 SmtUtils]: Spent 726.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2020-12-09 05:18:32,236 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:32,361 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:32,494 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:32,618 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:35,589 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:35,724 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:35,866 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:36,006 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:36,968 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-09 05:18:37,292 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-09 05:18:37,623 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 05:18:37,952 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-12-09 05:18:40,505 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:40,637 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 05:18:40,773 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:40,919 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 05:18:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 7863 proven. 7339 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2020-12-09 05:18:44,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229275358] [2020-12-09 05:18:44,139 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 05:18:44,139 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:18:44,139 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:18:44,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:18:44,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 41] total 59 [2020-12-09 05:18:44,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542795722] [2020-12-09 05:18:44,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-12-09 05:18:44,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:18:44,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-12-09 05:18:44,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=2770, Unknown=0, NotChecked=0, Total=3540 [2020-12-09 05:18:44,144 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 60 states. [2020-12-09 05:18:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:18:44,300 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2020-12-09 05:18:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-09 05:18:44,300 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1063 [2020-12-09 05:18:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:18:44,302 INFO L225 Difference]: With dead ends: 174 [2020-12-09 05:18:44,302 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 05:18:44,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2342 GetRequests, 2283 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=810, Invalid=2850, Unknown=0, NotChecked=0, Total=3660 [2020-12-09 05:18:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 05:18:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 05:18:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 05:18:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 05:18:44,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1063 [2020-12-09 05:18:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:18:44,305 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 05:18:44,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-12-09 05:18:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 05:18:44,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 05:18:44,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-09 05:18:44,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 05:18:45,032 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 13 [2020-12-09 05:18:45,513 WARN L197 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point L17(lines 17 23) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L265 CegarLoopResult]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L262 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,522 INFO L258 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (and (or (and (<= |fibonacci_#in~n| fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 9))) (not (<= |fibonacci_#in~n| 1))) [2020-12-09 05:18:45,523 INFO L262 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,523 INFO L262 CegarLoopResult]: For program point L22-4(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,523 INFO L262 CegarLoopResult]: For program point L22-5(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,523 INFO L258 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (let ((.cse2 (<= fibonacci_~n |fibonacci_#in~n|)) (.cse0 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse1 (<= 2 |fibonacci_#t~ret7|))) (and (or (not (<= |fibonacci_#in~n| 8)) (and .cse0 (<= |fibonacci_#t~ret7| 13) .cse1 .cse2) (not (<= 8 |fibonacci_#in~n|))) (not (<= |fibonacci_#in~n| 1)) (or (not (<= |fibonacci_#in~n| 6)) (and (<= |fibonacci_#t~ret7| 5) .cse2)) (or (not (<= |fibonacci_#in~n| 9)) (and (<= |fibonacci_#t~ret7| 21) .cse0 .cse1 .cse2) (not (<= 9 |fibonacci_#in~n|))) (or (<= |fibonacci_#t~ret7| 3) (not (<= |fibonacci_#in~n| 5))) (or (and .cse0 (= |fibonacci_#t~ret7| 1)) (not (<= |fibonacci_#in~n| 3))) (or (<= |fibonacci_#t~ret7| 2) (not (<= |fibonacci_#in~n| 4))) (or (and .cse0 (<= |fibonacci_#t~ret7| 8) .cse1 (<= fibonacci_~n 7)) (not (< 3 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 7))))) [2020-12-09 05:18:45,523 INFO L262 CegarLoopResult]: For program point L22-7(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,523 INFO L262 CegarLoopResult]: For program point L22-8(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,523 INFO L262 CegarLoopResult]: For program point L22-9(line 22) no Hoare annotation was computed. [2020-12-09 05:18:45,523 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 05:18:45,523 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 05:18:45,523 INFO L258 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2020-12-09 05:18:45,523 INFO L258 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 9) [2020-12-09 05:18:45,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:18:45 BoogieIcfgContainer [2020-12-09 05:18:45,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:18:45,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:18:45,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:18:45,533 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:18:45,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:17:57" (3/4) ... [2020-12-09 05:18:45,535 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 05:18:45,539 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2020-12-09 05:18:45,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-09 05:18:45,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 05:18:45,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 05:18:45,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 05:18:45,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c4b20779-dccc-4d46-9d2b-da90bb6f2450/bin/utaipan/witness.graphml [2020-12-09 05:18:45,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:18:45,564 INFO L168 Benchmark]: Toolchain (without parser) took 48789.09 ms. Allocated memory was 111.1 MB in the beginning and 499.1 MB in the end (delta: 388.0 MB). Free memory was 90.4 MB in the beginning and 306.7 MB in the end (delta: -216.3 MB). Peak memory consumption was 171.6 MB. Max. memory is 16.1 GB. [2020-12-09 05:18:45,564 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 73.4 MB. Free memory is still 47.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:18:45,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.58 ms. Allocated memory is still 111.1 MB. Free memory was 90.4 MB in the beginning and 85.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 05:18:45,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.49 ms. Allocated memory is still 111.1 MB. Free memory was 85.6 MB in the beginning and 84.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:18:45,565 INFO L168 Benchmark]: Boogie Preprocessor took 12.24 ms. Allocated memory is still 111.1 MB. Free memory was 84.4 MB in the beginning and 83.5 MB in the end (delta: 865.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:18:45,565 INFO L168 Benchmark]: RCFGBuilder took 237.98 ms. Allocated memory is still 111.1 MB. Free memory was 83.5 MB in the beginning and 67.6 MB in the end (delta: 15.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 05:18:45,565 INFO L168 Benchmark]: TraceAbstraction took 48331.49 ms. Allocated memory was 111.1 MB in the beginning and 499.1 MB in the end (delta: 388.0 MB). Free memory was 67.2 MB in the beginning and 308.8 MB in the end (delta: -241.6 MB). Peak memory consumption was 295.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:18:45,565 INFO L168 Benchmark]: Witness Printer took 30.00 ms. Allocated memory is still 499.1 MB. Free memory was 308.8 MB in the beginning and 306.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:18:45,567 INFO L339 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 73.4 MB. Free memory is still 47.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 151.58 ms. Allocated memory is still 111.1 MB. Free memory was 90.4 MB in the beginning and 85.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 21.49 ms. Allocated memory is still 111.1 MB. Free memory was 85.6 MB in the beginning and 84.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 12.24 ms. Allocated memory is still 111.1 MB. Free memory was 84.4 MB in the beginning and 83.5 MB in the end (delta: 865.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 237.98 ms. Allocated memory is still 111.1 MB. Free memory was 83.5 MB in the beginning and 67.6 MB in the end (delta: 15.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 48331.49 ms. Allocated memory was 111.1 MB in the beginning and 499.1 MB in the end (delta: 388.0 MB). Free memory was 67.2 MB in the beginning and 308.8 MB in the end (delta: -241.6 MB). Peak memory consumption was 295.1 MB. Max. memory is 16.1 GB. * Witness Printer took 30.00 ms. Allocated memory is still 499.1 MB. Free memory was 308.8 MB in the beginning and 306.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: 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 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: x <= 9 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 47.2s, OverallIterations: 15, TraceHistogramMax: 109, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 426 SDtfs, 2062 SDslu, 2091 SDs, 0 SdLazy, 3408 SolverSat, 666 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4824 GetRequests, 4467 SyntacticMatches, 3 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4072 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 150 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 383 PreInvPairs, 403 NumberOfFragments, 139 HoareAnnotationTreeSize, 383 FomulaSimplifications, 282 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 963 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 39.1s InterpolantComputationTime, 4413 NumberOfCodeBlocks, 4269 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 6538 ConstructedInterpolants, 0 QuantifiedInterpolants, 10417766 SizeOfPredicates, 28 NumberOfNonLiveVariables, 4070 ConjunctsInSsa, 402 ConjunctsInUnsatCore, 37 InterpolantComputations, 6 PerfectInterpolantSequences, 119636/149987 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...