./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18ab16c8226f43cf595901df83a1f895912e466b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:38:35,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:38:35,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:38:35,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:38:35,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:38:35,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:38:35,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:38:36,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:38:36,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:38:36,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:38:36,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:38:36,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:38:36,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:38:36,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:38:36,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:38:36,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:38:36,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:38:36,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:38:36,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:38:36,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:38:36,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:38:36,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:38:36,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:38:36,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:38:36,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:38:36,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:38:36,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:38:36,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:38:36,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:38:36,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:38:36,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:38:36,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:38:36,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:38:36,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:38:36,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:38:36,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:38:36,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:38:36,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:38:36,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:38:36,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:38:36,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:38:36,101 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:38:36,149 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:38:36,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:38:36,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:38:36,152 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:38:36,152 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:38:36,153 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:38:36,153 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:38:36,153 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:38:36,154 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:38:36,154 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:38:36,155 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:38:36,156 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:38:36,156 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:38:36,156 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:38:36,157 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:38:36,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:38:36,158 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:38:36,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:38:36,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:38:36,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:38:36,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:38:36,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:38:36,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:38:36,160 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:38:36,160 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:38:36,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:38:36,161 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:38:36,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:38:36,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:38:36,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:38:36,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:38:36,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:38:36,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:38:36,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:38:36,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:38:36,164 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:38:36,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:38:36,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:38:36,165 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:38:36,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:38:36,166 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_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18ab16c8226f43cf595901df83a1f895912e466b [2020-11-30 02:38:36,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:38:36,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:38:36,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:38:36,568 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:38:36,569 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:38:36,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci05.c [2020-11-30 02:38:36,666 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/data/e0a88fb67/2d74b3dd956242feb1a09d0fc97d8495/FLAG7a247cd80 [2020-11-30 02:38:37,237 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:38:37,238 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/sv-benchmarks/c/recursive/Fibonacci05.c [2020-11-30 02:38:37,250 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/data/e0a88fb67/2d74b3dd956242feb1a09d0fc97d8495/FLAG7a247cd80 [2020-11-30 02:38:37,598 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/data/e0a88fb67/2d74b3dd956242feb1a09d0fc97d8495 [2020-11-30 02:38:37,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:38:37,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:38:37,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:38:37,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:38:37,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:38:37,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:37,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f00d67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37, skipping insertion in model container [2020-11-30 02:38:37,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:37,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:38:37,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:38:37,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:38:37,944 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:38:37,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:38:37,993 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:38:37,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37 WrapperNode [2020-11-30 02:38:37,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:38:38,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:38:38,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:38:38,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:38:38,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:38:38,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:38:38,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:38:38,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:38:38,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... [2020-11-30 02:38:38,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:38:38,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:38:38,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:38:38,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:38:38,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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-11-30 02:38:38,182 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-30 02:38:38,183 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-30 02:38:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:38:38,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:38:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:38:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:38:38,725 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:38:38,725 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 02:38:38,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:38 BoogieIcfgContainer [2020-11-30 02:38:38,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:38:38,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:38:38,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:38:38,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:38:38,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:38:37" (1/3) ... [2020-11-30 02:38:38,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3d82eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:38:38, skipping insertion in model container [2020-11-30 02:38:38,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:37" (2/3) ... [2020-11-30 02:38:38,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3d82eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:38:38, skipping insertion in model container [2020-11-30 02:38:38,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:38" (3/3) ... [2020-11-30 02:38:38,741 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-11-30 02:38:38,755 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:38:38,761 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 02:38:38,776 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 02:38:38,817 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:38:38,817 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:38:38,818 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:38:38,818 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:38:38,818 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:38:38,819 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:38:38,819 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:38:38,819 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:38:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-11-30 02:38:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 02:38:38,843 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:38,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:38,844 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:38,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1744630214, now seen corresponding path program 1 times [2020-11-30 02:38:38,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:38:38,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912322469] [2020-11-30 02:38:38,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:38:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:39,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912322469] [2020-11-30 02:38:39,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:39,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:38:39,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855839616] [2020-11-30 02:38:39,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:38:39,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:38:39,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:38:39,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:39,184 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2020-11-30 02:38:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:39,414 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-11-30 02:38:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:38:39,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-30 02:38:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:39,440 INFO L225 Difference]: With dead ends: 27 [2020-11-30 02:38:39,441 INFO L226 Difference]: Without dead ends: 17 [2020-11-30 02:38:39,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-11-30 02:38:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-11-30 02:38:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-30 02:38:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-11-30 02:38:39,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2020-11-30 02:38:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:39,504 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-11-30 02:38:39,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:38:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-11-30 02:38:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:38:39,507 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:39,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:39,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:38:39,509 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:39,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1849803624, now seen corresponding path program 1 times [2020-11-30 02:38:39,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:38:39,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372916875] [2020-11-30 02:38:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:38:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:39,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372916875] [2020-11-30 02:38:39,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:39,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:38:39,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591888905] [2020-11-30 02:38:39,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:38:39,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:38:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:38:39,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:39,643 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2020-11-30 02:38:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:39,795 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-11-30 02:38:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:38:39,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-30 02:38:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:39,799 INFO L225 Difference]: With dead ends: 23 [2020-11-30 02:38:39,799 INFO L226 Difference]: Without dead ends: 19 [2020-11-30 02:38:39,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-11-30 02:38:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-11-30 02:38:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-30 02:38:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-11-30 02:38:39,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2020-11-30 02:38:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:39,813 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-11-30 02:38:39,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:38:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-11-30 02:38:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 02:38:39,817 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:39,818 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:39,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:38:39,818 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash 604295251, now seen corresponding path program 1 times [2020-11-30 02:38:39,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:38:39,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282288552] [2020-11-30 02:38:39,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:38:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:38:39,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282288552] [2020-11-30 02:38:39,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899121222] [2020-11-30 02:38:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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-11-30 02:38:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:40,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:38:40,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:38:40,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:40,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:38:40,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:38:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 02:38:40,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1379672013] [2020-11-30 02:38:40,583 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:38:40,583 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:38:40,589 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:38:40,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:38:40,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2020-11-30 02:38:40,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726165461] [2020-11-30 02:38:40,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 02:38:40,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:38:40,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 02:38:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:38:40,600 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 12 states. [2020-11-30 02:38:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:40,857 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2020-11-30 02:38:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:38:40,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-30 02:38:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:40,860 INFO L225 Difference]: With dead ends: 41 [2020-11-30 02:38:40,860 INFO L226 Difference]: Without dead ends: 24 [2020-11-30 02:38:40,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-11-30 02:38:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-30 02:38:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-30 02:38:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-30 02:38:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-11-30 02:38:40,879 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 22 [2020-11-30 02:38:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:40,880 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-11-30 02:38:40,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 02:38:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2020-11-30 02:38:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-30 02:38:40,895 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:40,896 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:41,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-30 02:38:41,117 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1300676118, now seen corresponding path program 1 times [2020-11-30 02:38:41,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:38:41,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415804291] [2020-11-30 02:38:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:38:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-11-30 02:38:41,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415804291] [2020-11-30 02:38:41,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896178294] [2020-11-30 02:38:41,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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-11-30 02:38:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:41,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:38:41,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-11-30 02:38:41,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:41,619 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-11-30 02:38:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2020-11-30 02:38:42,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1163167656] [2020-11-30 02:38:42,272 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:38:42,273 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:38:42,273 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:38:42,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:38:42,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2020-11-30 02:38:42,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492783754] [2020-11-30 02:38:42,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 02:38:42,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:38:42,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 02:38:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:38:42,282 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 12 states. [2020-11-30 02:38:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:42,609 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. [2020-11-30 02:38:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:38:42,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-11-30 02:38:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:42,613 INFO L225 Difference]: With dead ends: 43 [2020-11-30 02:38:42,613 INFO L226 Difference]: Without dead ends: 37 [2020-11-30 02:38:42,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-11-30 02:38:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-30 02:38:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-11-30 02:38:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-30 02:38:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2020-11-30 02:38:42,632 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 63 [2020-11-30 02:38:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:42,633 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2020-11-30 02:38:42,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 02:38:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2020-11-30 02:38:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-11-30 02:38:42,638 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:42,638 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 15, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:42,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:42,842 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash -107948683, now seen corresponding path program 2 times [2020-11-30 02:38:42,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:38:42,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846575513] [2020-11-30 02:38:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:38:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2020-11-30 02:38:43,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846575513] [2020-11-30 02:38:43,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067640600] [2020-11-30 02:38:43,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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-11-30 02:38:43,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-11-30 02:38:43,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:38:43,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:38:43,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 383 proven. 12 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2020-11-30 02:38:43,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 383 proven. 14 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2020-11-30 02:38:45,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [429142049] [2020-11-30 02:38:45,174 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:38:45,174 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:38:45,175 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:38:45,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:38:45,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2020-11-30 02:38:45,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894827917] [2020-11-30 02:38:45,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 02:38:45,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:38:45,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 02:38:45,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-30 02:38:45,182 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand 17 states. [2020-11-30 02:38:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:45,939 INFO L93 Difference]: Finished difference Result 86 states and 173 transitions. [2020-11-30 02:38:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-30 02:38:45,940 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 156 [2020-11-30 02:38:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:45,943 INFO L225 Difference]: With dead ends: 86 [2020-11-30 02:38:45,944 INFO L226 Difference]: Without dead ends: 54 [2020-11-30 02:38:45,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2020-11-30 02:38:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-30 02:38:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-30 02:38:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-30 02:38:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2020-11-30 02:38:45,970 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 156 [2020-11-30 02:38:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:45,971 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-11-30 02:38:45,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 02:38:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2020-11-30 02:38:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-11-30 02:38:45,976 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:45,976 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:46,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:46,202 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:46,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1090944440, now seen corresponding path program 3 times [2020-11-30 02:38:46,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:38:46,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656061997] [2020-11-30 02:38:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:38:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2020-11-30 02:38:46,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656061997] [2020-11-30 02:38:46,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197073856] [2020-11-30 02:38:46,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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-11-30 02:38:46,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 02:38:46,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:38:46,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-30 02:38:46,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 453 proven. 734 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2020-11-30 02:38:46,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 453 proven. 782 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2020-11-30 02:38:50,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1270461576] [2020-11-30 02:38:50,799 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:38:50,799 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:38:50,800 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:38:50,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:38:50,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 23] total 27 [2020-11-30 02:38:50,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191255627] [2020-11-30 02:38:50,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-30 02:38:50,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:38:50,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-30 02:38:50,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2020-11-30 02:38:50,806 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand 27 states. [2020-11-30 02:38:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:52,104 INFO L93 Difference]: Finished difference Result 133 states and 224 transitions. [2020-11-30 02:38:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-30 02:38:52,105 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 200 [2020-11-30 02:38:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:52,109 INFO L225 Difference]: With dead ends: 133 [2020-11-30 02:38:52,109 INFO L226 Difference]: Without dead ends: 81 [2020-11-30 02:38:52,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 372 SyntacticMatches, 16 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=564, Invalid=1692, Unknown=0, NotChecked=0, Total=2256 [2020-11-30 02:38:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-30 02:38:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2020-11-30 02:38:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-30 02:38:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2020-11-30 02:38:52,134 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 200 [2020-11-30 02:38:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:52,135 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2020-11-30 02:38:52,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-30 02:38:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2020-11-30 02:38:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2020-11-30 02:38:52,143 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:52,143 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:52,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:52,356 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:52,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash -29224664, now seen corresponding path program 4 times [2020-11-30 02:38:52,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:38:52,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075321928] [2020-11-30 02:38:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:38:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-11-30 02:38:52,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075321928] [2020-11-30 02:38:52,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806821665] [2020-11-30 02:38:52,837 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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-11-30 02:38:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:53,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 02:38:53,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-11-30 02:38:53,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2020-11-30 02:38:56,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [740935269] [2020-11-30 02:38:56,528 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:38:56,529 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:38:56,529 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:38:56,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:38:56,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 18 [2020-11-30 02:38:56,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260113254] [2020-11-30 02:38:56,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-30 02:38:56,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:38:56,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 02:38:56,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-11-30 02:38:56,535 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand 18 states. [2020-11-30 02:38:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:56,893 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2020-11-30 02:38:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:56,894 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 282 [2020-11-30 02:38:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:56,899 INFO L225 Difference]: With dead ends: 86 [2020-11-30 02:38:56,900 INFO L226 Difference]: Without dead ends: 82 [2020-11-30 02:38:56,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 553 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-11-30 02:38:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-30 02:38:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-30 02:38:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-30 02:38:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2020-11-30 02:38:56,922 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 282 [2020-11-30 02:38:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:56,924 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2020-11-30 02:38:56,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-30 02:38:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2020-11-30 02:38:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2020-11-30 02:38:56,947 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:56,948 INFO L422 BasicCegarLoop]: trace histogram [93, 93, 75, 46, 46, 46, 46, 46, 46, 46, 29, 18, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:57,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 02:38:57,164 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:57,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1787204754, now seen corresponding path program 5 times [2020-11-30 02:38:57,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:38:57,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497002678] [2020-11-30 02:38:57,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:38:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 24027 backedges. 1238 proven. 4045 refuted. 0 times theorem prover too weak. 18744 trivial. 0 not checked. [2020-11-30 02:38:58,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497002678] [2020-11-30 02:38:58,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493514548] [2020-11-30 02:38:58,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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-11-30 02:38:58,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2020-11-30 02:38:58,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:38:58,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 02:38:58,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 24027 backedges. 3338 proven. 293 refuted. 0 times theorem prover too weak. 20396 trivial. 0 not checked. [2020-11-30 02:38:58,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:39:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24027 backedges. 3338 proven. 314 refuted. 0 times theorem prover too weak. 20375 trivial. 0 not checked. [2020-11-30 02:39:03,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1674662936] [2020-11-30 02:39:03,623 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:39:03,623 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:39:03,624 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:39:03,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:39:03,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 17] total 27 [2020-11-30 02:39:03,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346091840] [2020-11-30 02:39:03,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-30 02:39:03,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:39:03,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-30 02:39:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2020-11-30 02:39:03,630 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand 27 states. [2020-11-30 02:39:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:39:04,924 INFO L93 Difference]: Finished difference Result 192 states and 318 transitions. [2020-11-30 02:39:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-30 02:39:04,925 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 636 [2020-11-30 02:39:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:39:04,928 INFO L225 Difference]: With dead ends: 192 [2020-11-30 02:39:04,929 INFO L226 Difference]: Without dead ends: 114 [2020-11-30 02:39:04,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1318 GetRequests, 1258 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=600, Invalid=1950, Unknown=0, NotChecked=0, Total=2550 [2020-11-30 02:39:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-30 02:39:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2020-11-30 02:39:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-30 02:39:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2020-11-30 02:39:04,973 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 636 [2020-11-30 02:39:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:39:04,975 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2020-11-30 02:39:04,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-30 02:39:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2020-11-30 02:39:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2020-11-30 02:39:04,993 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:39:04,993 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1] [2020-11-30 02:39:05,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:39:05,206 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:39:05,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:39:05,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2002163755, now seen corresponding path program 6 times [2020-11-30 02:39:05,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:39:05,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180901741] [2020-11-30 02:39:05,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:39:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:39:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2020-11-30 02:39:06,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180901741] [2020-11-30 02:39:06,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540982180] [2020-11-30 02:39:06,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/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-11-30 02:39:06,479 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 02:39:06,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:39:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-30 02:39:06,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:39:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1969 proven. 3803 refuted. 0 times theorem prover too weak. 13331 trivial. 0 not checked. [2020-11-30 02:39:06,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:39:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1969 proven. 3911 refuted. 0 times theorem prover too weak. 13223 trivial. 0 not checked. [2020-11-30 02:39:14,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [83641261] [2020-11-30 02:39:14,882 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:39:14,882 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:39:14,883 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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-11-30 02:39:14,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:39:14,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 31] total 35 [2020-11-30 02:39:14,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037405818] [2020-11-30 02:39:14,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-11-30 02:39:14,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:39:14,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-11-30 02:39:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2020-11-30 02:39:14,888 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand 35 states. [2020-11-30 02:39:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:39:16,549 INFO L93 Difference]: Finished difference Result 208 states and 329 transitions. [2020-11-30 02:39:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-11-30 02:39:16,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 568 [2020-11-30 02:39:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:39:16,555 INFO L225 Difference]: With dead ends: 208 [2020-11-30 02:39:16,555 INFO L226 Difference]: Without dead ends: 122 [2020-11-30 02:39:16,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1193 GetRequests, 1105 SyntacticMatches, 24 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1045, Invalid=3245, Unknown=0, NotChecked=0, Total=4290 [2020-11-30 02:39:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-30 02:39:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2020-11-30 02:39:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-30 02:39:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 152 transitions. [2020-11-30 02:39:16,596 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 152 transitions. Word has length 568 [2020-11-30 02:39:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:39:16,600 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 152 transitions. [2020-11-30 02:39:16,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-11-30 02:39:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 152 transitions. [2020-11-30 02:39:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2020-11-30 02:39:16,605 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:39:16,606 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2020-11-30 02:39:16,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:39:16,828 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:39:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:39:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash 717206797, now seen corresponding path program 7 times [2020-11-30 02:39:16,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:39:16,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600141792] [2020-11-30 02:39:16,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:39:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:39:16,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:39:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:39:17,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:39:17,241 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 02:39:17,242 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:39:17,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 02:39:17,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:39:17 BoogieIcfgContainer [2020-11-30 02:39:17,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:39:17,489 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:39:17,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:39:17,490 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:39:17,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:38" (3/4) ... [2020-11-30 02:39:17,493 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 02:39:17,676 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9a6d81c5-021a-4b31-9ecd-fbc0bb5e54b0/bin/utaipan/witness.graphml [2020-11-30 02:39:17,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:39:17,678 INFO L168 Benchmark]: Toolchain (without parser) took 40074.44 ms. Allocated memory was 96.5 MB in the beginning and 799.0 MB in the end (delta: 702.5 MB). Free memory was 65.9 MB in the beginning and 384.1 MB in the end (delta: -318.2 MB). Peak memory consumption was 384.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:39:17,678 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 96.5 MB. Free memory is still 55.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:39:17,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.26 ms. Allocated memory was 96.5 MB in the beginning and 119.5 MB in the end (delta: 23.1 MB). Free memory was 65.8 MB in the beginning and 97.1 MB in the end (delta: -31.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:39:17,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.69 ms. Allocated memory is still 119.5 MB. Free memory was 97.1 MB in the beginning and 95.9 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:39:17,680 INFO L168 Benchmark]: Boogie Preprocessor took 44.36 ms. Allocated memory is still 119.5 MB. Free memory was 95.9 MB in the beginning and 95.0 MB in the end (delta: 970.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:39:17,680 INFO L168 Benchmark]: RCFGBuilder took 639.74 ms. Allocated memory is still 119.5 MB. Free memory was 95.0 MB in the beginning and 81.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:39:17,680 INFO L168 Benchmark]: TraceAbstraction took 38757.11 ms. Allocated memory was 119.5 MB in the beginning and 799.0 MB in the end (delta: 679.5 MB). Free memory was 80.8 MB in the beginning and 403.0 MB in the end (delta: -322.2 MB). Peak memory consumption was 357.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:39:17,681 INFO L168 Benchmark]: Witness Printer took 187.45 ms. Allocated memory is still 799.0 MB. Free memory was 403.0 MB in the beginning and 384.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-30 02:39:17,683 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.35 ms. Allocated memory is still 96.5 MB. Free memory is still 55.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 391.26 ms. Allocated memory was 96.5 MB in the beginning and 119.5 MB in the end (delta: 23.1 MB). Free memory was 65.8 MB in the beginning and 97.1 MB in the end (delta: -31.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.69 ms. Allocated memory is still 119.5 MB. Free memory was 97.1 MB in the beginning and 95.9 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.36 ms. Allocated memory is still 119.5 MB. Free memory was 95.9 MB in the beginning and 95.0 MB in the end (delta: 970.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 639.74 ms. Allocated memory is still 119.5 MB. Free memory was 95.0 MB in the beginning and 81.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 38757.11 ms. Allocated memory was 119.5 MB in the beginning and 799.0 MB in the end (delta: 679.5 MB). Free memory was 80.8 MB in the beginning and 403.0 MB in the end (delta: -322.2 MB). Peak memory consumption was 357.7 MB. Max. memory is 16.1 GB. * Witness Printer took 187.45 ms. Allocated memory is still 799.0 MB. Free memory was 403.0 MB in the beginning and 384.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 38.4s, OverallIterations: 10, TraceHistogramMax: 93, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 172 SDtfs, 1028 SDslu, 704 SDs, 0 SdLazy, 2039 SolverSat, 1303 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4075 GetRequests, 3752 SyntacticMatches, 73 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2239 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 47 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 4332 NumberOfCodeBlocks, 3742 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 5777 ConstructedInterpolants, 0 QuantifiedInterpolants, 3602065 SizeOfPredicates, 60 NumberOfNonLiveVariables, 3040 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 132255/154413 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 incorrect! Received shutdown request...