./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0bc64117ef8398002009c167867d7baf0a85044 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:33:32,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:33:32,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:33:32,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:33:32,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:33:32,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:33:32,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:33:32,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:33:32,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:33:32,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:33:32,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:33:32,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:33:32,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:33:32,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:33:32,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:33:32,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:33:32,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:33:32,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:33:32,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:33:32,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:33:32,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:33:32,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:33:32,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:33:32,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:33:32,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:33:32,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:33:32,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:33:32,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:33:32,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:33:32,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:33:32,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:33:32,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:33:32,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:33:32,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:33:32,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:33:32,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:33:32,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:33:32,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:33:32,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:33:32,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:33:32,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:33:32,707 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:33:32,721 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:33:32,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:33:32,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:33:32,722 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:33:32,722 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:33:32,722 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:33:32,722 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:33:32,723 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:33:32,723 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:33:32,723 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:33:32,723 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:33:32,723 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:33:32,723 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:33:32,724 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:33:32,724 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:33:32,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:33:32,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:33:32,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:33:32,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:33:32,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:33:32,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:33:32,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:33:32,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:33:32,726 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:33:32,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:33:32,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:33:32,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:33:32,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:33:32,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:33:32,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:33:32,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:33:32,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:33:32,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:33:32,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:33:32,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:33:32,728 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:33:32,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:33:32,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:33:32,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:33:32,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:33:32,729 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0bc64117ef8398002009c167867d7baf0a85044 [2019-12-07 13:33:32,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:33:32,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:33:32,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:33:32,841 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:33:32,841 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:33:32,842 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci05.c [2019-12-07 13:33:32,881 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/data/74ad4c1b1/8a8ccfd5681248a8b9448fed27bbf345/FLAG2078a6a0a [2019-12-07 13:33:33,272 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:33:33,272 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/sv-benchmarks/c/recursive/Fibonacci05.c [2019-12-07 13:33:33,276 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/data/74ad4c1b1/8a8ccfd5681248a8b9448fed27bbf345/FLAG2078a6a0a [2019-12-07 13:33:33,284 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/data/74ad4c1b1/8a8ccfd5681248a8b9448fed27bbf345 [2019-12-07 13:33:33,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:33:33,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:33:33,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:33:33,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:33:33,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:33:33,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33, skipping insertion in model container [2019-12-07 13:33:33,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:33:33,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:33:33,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:33:33,406 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:33:33,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:33:33,460 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:33:33,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33 WrapperNode [2019-12-07 13:33:33,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:33:33,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:33:33,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:33:33,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:33:33,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:33:33,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:33:33,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:33:33,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:33:33,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... [2019-12-07 13:33:33,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:33:33,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:33:33,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:33:33,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:33:33,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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 [2019-12-07 13:33:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-12-07 13:33:33,534 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-12-07 13:33:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:33:33,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:33:33,634 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:33:33,634 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 13:33:33,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:33:33 BoogieIcfgContainer [2019-12-07 13:33:33,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:33:33,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:33:33,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:33:33,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:33:33,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:33:33" (1/3) ... [2019-12-07 13:33:33,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f78a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:33:33, skipping insertion in model container [2019-12-07 13:33:33,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:33:33" (2/3) ... [2019-12-07 13:33:33,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f78a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:33:33, skipping insertion in model container [2019-12-07 13:33:33,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:33:33" (3/3) ... [2019-12-07 13:33:33,640 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2019-12-07 13:33:33,647 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:33:33,651 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:33:33,658 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:33:33,672 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:33:33,672 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:33:33,672 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:33:33,672 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:33:33,672 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:33:33,672 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:33:33,672 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:33:33,672 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:33:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-12-07 13:33:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:33:33,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:33,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:33,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:33,690 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-12-07 13:33:33,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:33,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219790182] [2019-12-07 13:33:33,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:33:33,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219790182] [2019-12-07 13:33:33,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:33:33,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:33:33,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448076790] [2019-12-07 13:33:33,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:33:33,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:33,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:33:33,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:33:33,817 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2019-12-07 13:33:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:33,882 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-12-07 13:33:33,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:33:33,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 13:33:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:33,889 INFO L225 Difference]: With dead ends: 27 [2019-12-07 13:33:33,889 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 13:33:33,891 INFO L630 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 [2019-12-07 13:33:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 13:33:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 13:33:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 13:33:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 13:33:33,918 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-12-07 13:33:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:33,919 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 13:33:33,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:33:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 13:33:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:33:33,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:33,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:33,920 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-12-07 13:33:33,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:33,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231868808] [2019-12-07 13:33:33,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:33:33,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231868808] [2019-12-07 13:33:33,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:33:33,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:33:33,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902130387] [2019-12-07 13:33:33,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:33:33,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:33:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:33:33,948 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-12-07 13:33:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:33,992 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-12-07 13:33:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:33:33,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 13:33:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:33,994 INFO L225 Difference]: With dead ends: 23 [2019-12-07 13:33:33,994 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 13:33:33,995 INFO L630 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 [2019-12-07 13:33:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 13:33:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-12-07 13:33:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 13:33:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 13:33:34,000 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-12-07 13:33:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:34,000 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 13:33:34,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:33:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 13:33:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:33:34,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:34,001 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:34,002 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:34,002 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-12-07 13:33:34,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:34,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816583919] [2019-12-07 13:33:34,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 13:33:34,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816583919] [2019-12-07 13:33:34,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686178189] [2019-12-07 13:33:34,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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 [2019-12-07 13:33:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:34,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:33:34,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 13:33:34,110 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:34,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:33:34,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2132562562] [2019-12-07 13:33:34,236 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:33:34,236 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:33:34,241 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:33:34,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:33:34,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2019-12-07 13:33:34,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823449266] [2019-12-07 13:33:34,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:33:34,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:34,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:33:34,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:33:34,244 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 10 states. [2019-12-07 13:33:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:34,333 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. [2019-12-07 13:33:34,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:33:34,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 13:33:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:34,335 INFO L225 Difference]: With dead ends: 35 [2019-12-07 13:33:34,335 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 13:33:34,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:33:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 13:33:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-12-07 13:33:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 13:33:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2019-12-07 13:33:34,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 22 [2019-12-07 13:33:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:34,344 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2019-12-07 13:33:34,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:33:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2019-12-07 13:33:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:33:34,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:34,346 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:34,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:33:34,547 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1380356029, now seen corresponding path program 1 times [2019-12-07 13:33:34,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:34,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040894353] [2019-12-07 13:33:34,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 13:33:34,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040894353] [2019-12-07 13:33:34,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354189458] [2019-12-07 13:33:34,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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 [2019-12-07 13:33:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:34,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:33:34,713 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-07 13:33:34,739 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 13:33:34,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [715355944] [2019-12-07 13:33:34,951 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:33:34,951 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:33:34,951 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:33:34,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:33:34,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2019-12-07 13:33:34,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381272516] [2019-12-07 13:33:34,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 13:33:34,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:34,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 13:33:34,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:33:34,953 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 18 states. [2019-12-07 13:33:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:35,253 INFO L93 Difference]: Finished difference Result 78 states and 153 transitions. [2019-12-07 13:33:35,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:33:35,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-12-07 13:33:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:35,255 INFO L225 Difference]: With dead ends: 78 [2019-12-07 13:33:35,256 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 13:33:35,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-12-07 13:33:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 13:33:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2019-12-07 13:33:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 13:33:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 59 transitions. [2019-12-07 13:33:35,265 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 59 transitions. Word has length 50 [2019-12-07 13:33:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:35,266 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 59 transitions. [2019-12-07 13:33:35,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 13:33:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 59 transitions. [2019-12-07 13:33:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 13:33:35,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:35,270 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:35,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:33:35,471 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 786782982, now seen corresponding path program 2 times [2019-12-07 13:33:35,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:35,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460582376] [2019-12-07 13:33:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 288 proven. 728 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-12-07 13:33:35,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460582376] [2019-12-07 13:33:35,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621375782] [2019-12-07 13:33:35,831 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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 [2019-12-07 13:33:35,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 13:33:35,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:33:35,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:33:35,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2019-12-07 13:33:35,899 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 305 proven. 3 refuted. 0 times theorem prover too weak. 1222 trivial. 0 not checked. [2019-12-07 13:33:36,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:33:36,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [25, 6] total 26 [2019-12-07 13:33:36,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875908800] [2019-12-07 13:33:36,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:33:36,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:33:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-12-07 13:33:36,141 INFO L87 Difference]: Start difference. First operand 39 states and 59 transitions. Second operand 6 states. [2019-12-07 13:33:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:36,189 INFO L93 Difference]: Finished difference Result 78 states and 137 transitions. [2019-12-07 13:33:36,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:33:36,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-12-07 13:33:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:36,190 INFO L225 Difference]: With dead ends: 78 [2019-12-07 13:33:36,191 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 13:33:36,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 357 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:33:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 13:33:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 13:33:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 13:33:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2019-12-07 13:33:36,198 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 165 [2019-12-07 13:33:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:36,198 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2019-12-07 13:33:36,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:33:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2019-12-07 13:33:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 13:33:36,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:36,200 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:36,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:33:36,402 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:36,403 INFO L82 PathProgramCache]: Analyzing trace with hash -878750094, now seen corresponding path program 2 times [2019-12-07 13:33:36,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:36,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147086836] [2019-12-07 13:33:36,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 371 proven. 662 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2019-12-07 13:33:36,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147086836] [2019-12-07 13:33:36,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395720820] [2019-12-07 13:33:36,674 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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 [2019-12-07 13:33:36,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 13:33:36,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:33:36,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:33:36,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 663 proven. 8 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2019-12-07 13:33:36,767 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 376 proven. 43 refuted. 0 times theorem prover too weak. 1181 trivial. 0 not checked. [2019-12-07 13:33:37,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1840663998] [2019-12-07 13:33:37,126 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:33:37,126 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:33:37,126 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:33:37,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:33:37,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 8] total 26 [2019-12-07 13:33:37,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195419683] [2019-12-07 13:33:37,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 13:33:37,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 13:33:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-12-07 13:33:37,128 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 26 states. [2019-12-07 13:33:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:37,519 INFO L93 Difference]: Finished difference Result 97 states and 179 transitions. [2019-12-07 13:33:37,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:33:37,520 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 170 [2019-12-07 13:33:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:37,521 INFO L225 Difference]: With dead ends: 97 [2019-12-07 13:33:37,521 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 13:33:37,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 348 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 13:33:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 13:33:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-12-07 13:33:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 13:33:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2019-12-07 13:33:37,530 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 170 [2019-12-07 13:33:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:37,530 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2019-12-07 13:33:37,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 13:33:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2019-12-07 13:33:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 13:33:37,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:37,532 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:37,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:33:37,733 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2037341067, now seen corresponding path program 3 times [2019-12-07 13:33:37,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:37,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175991425] [2019-12-07 13:33:37,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 395 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-12-07 13:33:37,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175991425] [2019-12-07 13:33:37,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929517003] [2019-12-07 13:33:37,952 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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 [2019-12-07 13:33:37,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:33:37,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:33:37,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 13:33:37,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 343 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2019-12-07 13:33:38,055 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 365 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-12-07 13:33:38,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1898860488] [2019-12-07 13:33:38,809 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:33:38,809 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:33:38,810 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:33:38,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:33:38,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 18] total 29 [2019-12-07 13:33:38,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260214103] [2019-12-07 13:33:38,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 13:33:38,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:38,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 13:33:38,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:33:38,812 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand 29 states. [2019-12-07 13:33:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:39,167 INFO L93 Difference]: Finished difference Result 121 states and 174 transitions. [2019-12-07 13:33:39,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 13:33:39,167 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2019-12-07 13:33:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:39,169 INFO L225 Difference]: With dead ends: 121 [2019-12-07 13:33:39,169 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 13:33:39,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 249 SyntacticMatches, 16 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=462, Invalid=1518, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 13:33:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 13:33:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2019-12-07 13:33:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 13:33:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-12-07 13:33:39,176 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 132 [2019-12-07 13:33:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:39,176 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-12-07 13:33:39,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 13:33:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-12-07 13:33:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 13:33:39,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:39,178 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:39,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:33:39,380 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 418459252, now seen corresponding path program 4 times [2019-12-07 13:33:39,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:39,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864986798] [2019-12-07 13:33:39,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-12-07 13:33:39,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864986798] [2019-12-07 13:33:39,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813142753] [2019-12-07 13:33:39,483 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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 [2019-12-07 13:33:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:39,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 13:33:39,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-12-07 13:33:39,579 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2019-12-07 13:33:40,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1245173806] [2019-12-07 13:33:40,341 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:33:40,341 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:33:40,341 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:33:40,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:33:40,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2019-12-07 13:33:40,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939453667] [2019-12-07 13:33:40,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 13:33:40,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 13:33:40,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:33:40,343 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 18 states. [2019-12-07 13:33:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:40,480 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2019-12-07 13:33:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:33:40,481 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2019-12-07 13:33:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:40,483 INFO L225 Difference]: With dead ends: 77 [2019-12-07 13:33:40,483 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 13:33:40,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 332 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:33:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 13:33:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 13:33:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 13:33:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-12-07 13:33:40,492 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 173 [2019-12-07 13:33:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:40,492 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-12-07 13:33:40,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 13:33:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2019-12-07 13:33:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-12-07 13:33:40,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:40,509 INFO L410 BasicCegarLoop]: trace histogram [95, 95, 77, 47, 47, 47, 47, 47, 47, 47, 30, 18, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:40,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:33:40,710 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash 154271215, now seen corresponding path program 5 times [2019-12-07 13:33:40,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:40,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39384006] [2019-12-07 13:33:40,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 5722 proven. 8911 refuted. 0 times theorem prover too weak. 10477 trivial. 0 not checked. [2019-12-07 13:33:41,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39384006] [2019-12-07 13:33:41,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879500829] [2019-12-07 13:33:41,475 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/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 [2019-12-07 13:33:41,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-12-07 13:33:41,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:33:41,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 13:33:41,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 2191 proven. 3241 refuted. 0 times theorem prover too weak. 19678 trivial. 0 not checked. [2019-12-07 13:33:41,835 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 2191 proven. 3316 refuted. 0 times theorem prover too weak. 19603 trivial. 0 not checked. [2019-12-07 13:33:44,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1569334117] [2019-12-07 13:33:44,439 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:33:44,439 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:33:44,439 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:33:44,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:33:44,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 25] total 41 [2019-12-07 13:33:44,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104500488] [2019-12-07 13:33:44,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 13:33:44,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:33:44,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 13:33:44,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 13:33:44,442 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand 41 states. [2019-12-07 13:33:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:45,436 INFO L93 Difference]: Finished difference Result 196 states and 367 transitions. [2019-12-07 13:33:45,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 13:33:45,436 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 650 [2019-12-07 13:33:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:45,438 INFO L225 Difference]: With dead ends: 196 [2019-12-07 13:33:45,438 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 13:33:45,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1459 GetRequests, 1366 SyntacticMatches, 23 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1080, Invalid=4032, Unknown=0, NotChecked=0, Total=5112 [2019-12-07 13:33:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 13:33:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-12-07 13:33:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 13:33:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 152 transitions. [2019-12-07 13:33:45,452 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 152 transitions. Word has length 650 [2019-12-07 13:33:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:45,452 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 152 transitions. [2019-12-07 13:33:45,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 13:33:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 152 transitions. [2019-12-07 13:33:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-12-07 13:33:45,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:45,454 INFO L410 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2019-12-07 13:33:45,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:33:45,656 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:45,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:45,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1653353793, now seen corresponding path program 6 times [2019-12-07 13:33:45,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:33:45,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081565302] [2019-12-07 13:33:45,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:33:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:33:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:33:45,805 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:33:45,805 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:33:45,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:33:45 BoogieIcfgContainer [2019-12-07 13:33:45,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:33:45,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:33:45,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:33:45,862 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:33:45,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:33:33" (3/4) ... [2019-12-07 13:33:45,864 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:33:45,938 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4386c50d-ab58-4bb4-9040-22fdd6a3d065/bin/utaipan/witness.graphml [2019-12-07 13:33:45,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:33:45,939 INFO L168 Benchmark]: Toolchain (without parser) took 12652.07 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 433.6 MB). Free memory was 943.5 MB in the beginning and 1.3 GB in the end (delta: -382.8 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:45,939 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:33:45,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:45,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:33:45,940 INFO L168 Benchmark]: Boogie Preprocessor took 11.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:33:45,940 INFO L168 Benchmark]: RCFGBuilder took 142.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:45,940 INFO L168 Benchmark]: TraceAbstraction took 12226.00 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -258.5 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:45,941 INFO L168 Benchmark]: Witness Printer took 75.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:45,942 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 142.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12226.00 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -258.5 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. * Witness Printer took 75.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 10, TraceHistogramMax: 95, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 162 SDtfs, 1172 SDslu, 723 SDs, 0 SdLazy, 1941 SolverSat, 1319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3101 GetRequests, 2787 SyntacticMatches, 69 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2286 ImplicationChecksByTransitivity, 2.6s 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3202 NumberOfCodeBlocks, 2539 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 4082 ConstructedInterpolants, 0 QuantifiedInterpolants, 2853900 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1565 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 73008/92835 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...