./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/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.23-635dfa2 [2018-12-02 21:23:32,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:23:32,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:23:32,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:23:32,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:23:32,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:23:32,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:23:32,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:23:32,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:23:32,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:23:32,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:23:32,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:23:32,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:23:32,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:23:32,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:23:32,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:23:32,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:23:32,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:23:32,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:23:32,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:23:32,401 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:23:32,402 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:23:32,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:23:32,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:23:32,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:23:32,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:23:32,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:23:32,405 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:23:32,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:23:32,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:23:32,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:23:32,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:23:32,406 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:23:32,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:23:32,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:23:32,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:23:32,407 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 21:23:32,416 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:23:32,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:23:32,417 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:23:32,417 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:23:32,417 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:23:32,417 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:23:32,417 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:23:32,417 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:23:32,418 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:23:32,418 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:23:32,418 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:23:32,418 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:23:32,418 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:23:32,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:23:32,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:23:32,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:23:32,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:23:32,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:23:32,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:23:32,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:23:32,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:23:32,420 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:23:32,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:23:32,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:23:32,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:23:32,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:23:32,421 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:23:32,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:23:32,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:23:32,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:23:32,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:23:32,421 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:23:32,421 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:23:32,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:23:32,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:23:32,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:23:32,422 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 [2018-12-02 21:23:32,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:23:32,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:23:32,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:23:32,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:23:32,455 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:23:32,455 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:23:32,489 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/data/c5493b1e3/076feac45c2f4b749c4ce1ab6e6dd13d/FLAG25ca55288 [2018-12-02 21:23:32,858 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:23:32,858 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:23:32,862 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/data/c5493b1e3/076feac45c2f4b749c4ce1ab6e6dd13d/FLAG25ca55288 [2018-12-02 21:23:33,226 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/data/c5493b1e3/076feac45c2f4b749c4ce1ab6e6dd13d [2018-12-02 21:23:33,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:23:33,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:23:33,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:23:33,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:23:33,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:23:33,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706cd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33, skipping insertion in model container [2018-12-02 21:23:33,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:23:33,252 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:23:33,332 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:23:33,334 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:23:33,343 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:23:33,350 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:23:33,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33 WrapperNode [2018-12-02 21:23:33,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:23:33,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:23:33,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:23:33,351 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:23:33,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:23:33,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:23:33,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:23:33,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:23:33,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... [2018-12-02 21:23:33,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:23:33,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:23:33,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:23:33,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:23:33,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:23:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-02 21:23:33,444 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-02 21:23:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:23:33,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:23:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:23:33,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:23:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:23:33,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:23:33,527 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:23:33,527 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 21:23:33,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:23:33 BoogieIcfgContainer [2018-12-02 21:23:33,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:23:33,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:23:33,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:23:33,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:23:33,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:23:33" (1/3) ... [2018-12-02 21:23:33,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93a2874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:23:33, skipping insertion in model container [2018-12-02 21:23:33,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:23:33" (2/3) ... [2018-12-02 21:23:33,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93a2874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:23:33, skipping insertion in model container [2018-12-02 21:23:33,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:23:33" (3/3) ... [2018-12-02 21:23:33,532 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:23:33,537 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:23:33,541 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 21:23:33,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 21:23:33,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:23:33,569 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:23:33,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:23:33,569 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:23:33,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:23:33,569 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:23:33,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:23:33,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:23:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-02 21:23:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 21:23:33,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:33,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:33,585 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:33,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-12-02 21:23:33,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:33,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:33,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:33,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:33,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:23:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:23:33,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:23:33,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:23:33,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:23:33,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:23:33,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:23:33,698 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-12-02 21:23:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:33,758 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-02 21:23:33,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:23:33,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 21:23:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:33,765 INFO L225 Difference]: With dead ends: 35 [2018-12-02 21:23:33,765 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 21:23:33,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:23:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 21:23:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 21:23:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 21:23:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 21:23:33,791 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-12-02 21:23:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:33,791 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 21:23:33,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:23:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-02 21:23:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 21:23:33,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:33,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:33,794 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:33,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-12-02 21:23:33,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:33,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:33,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:33,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:33,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:23:33,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:23:33,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:23:33,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:23:33,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:23:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:23:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:23:33,827 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-12-02 21:23:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:33,861 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-02 21:23:33,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:23:33,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 21:23:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:33,863 INFO L225 Difference]: With dead ends: 27 [2018-12-02 21:23:33,863 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 21:23:33,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:23:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 21:23:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-02 21:23:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 21:23:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 21:23:33,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-12-02 21:23:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:33,870 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 21:23:33,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:23:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-02 21:23:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 21:23:33,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:33,871 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:33,871 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:33,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-12-02 21:23:33,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:33,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:33,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:23:33,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:33,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:33,919 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-02 21:23:33,920 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-12-02 21:23:33,941 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:23:33,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:23:34,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:23:34,110 INFO L272 AbstractInterpreter]: Visited 21 different actions 282 times. Never merged. Never widened. Performed 588 root evaluator evaluations with a maximum evaluation depth of 4. Performed 588 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 32 fixpoints after 3 different actions. Largest state had 5 variables. [2018-12-02 21:23:34,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:34,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:23:34,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:34,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:34,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:34,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:23:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:34,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:23:34,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:23:34,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:34,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-12-02 21:23:34,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:34,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:23:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:23:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:23:34,298 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-12-02 21:23:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:34,363 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-12-02 21:23:34,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:23:34,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-02 21:23:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:34,364 INFO L225 Difference]: With dead ends: 38 [2018-12-02 21:23:34,364 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 21:23:34,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:23:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 21:23:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 21:23:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 21:23:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 21:23:34,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-12-02 21:23:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:34,368 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 21:23:34,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:23:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-02 21:23:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 21:23:34,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:34,369 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:34,370 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:34,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:34,370 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-12-02 21:23:34,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:34,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 21:23:34,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:34,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:34,398 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-02 21:23:34,398 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-12-02 21:23:34,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:23:34,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:23:35,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:23:35,152 INFO L272 AbstractInterpreter]: Visited 22 different actions 4111 times. Merged at 10 different actions 1344 times. Never widened. Performed 10008 root evaluator evaluations with a maximum evaluation depth of 4. Performed 10008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 592 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-02 21:23:35,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:35,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:23:35,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:35,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:35,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:35,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:23:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:35,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 21:23:35,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:23:35,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:35,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-12-02 21:23:35,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:35,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:23:35,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:23:35,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:23:35,298 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-12-02 21:23:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:35,342 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-12-02 21:23:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:23:35,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-02 21:23:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:35,343 INFO L225 Difference]: With dead ends: 32 [2018-12-02 21:23:35,343 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 21:23:35,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:23:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 21:23:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 21:23:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 21:23:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-02 21:23:35,349 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-12-02 21:23:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:35,350 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-02 21:23:35,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:23:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-12-02 21:23:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:23:35,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:35,351 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:35,352 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:35,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:35,352 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-12-02 21:23:35,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:35,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:35,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:35,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:35,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 21:23:35,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:35,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:35,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:23:35,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:23:35,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:35,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:35,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:23:35,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:23:35,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 21:23:35,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:23:35,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 21:23:35,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 21:23:35,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:35,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-12-02 21:23:35,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:35,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:23:35,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:23:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:23:35,541 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 6 states. [2018-12-02 21:23:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:35,572 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-12-02 21:23:35,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:23:35,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-02 21:23:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:35,574 INFO L225 Difference]: With dead ends: 38 [2018-12-02 21:23:35,574 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 21:23:35,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:23:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 21:23:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-12-02 21:23:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 21:23:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-02 21:23:35,580 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 40 [2018-12-02 21:23:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:35,580 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-02 21:23:35,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:23:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-12-02 21:23:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 21:23:35,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:35,582 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:35,582 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:35,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2018-12-02 21:23:35,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:35,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:23:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:35,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 21:23:35,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:35,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:35,621 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:23:35,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:23:35,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:35,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:35,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:23:35,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:23:35,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:23:35,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:23:35,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 21:23:35,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 21:23:35,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:35,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 12 [2018-12-02 21:23:35,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:35,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:23:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:23:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:23:35,857 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 7 states. [2018-12-02 21:23:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:35,900 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-12-02 21:23:35,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:23:35,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-02 21:23:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:35,901 INFO L225 Difference]: With dead ends: 40 [2018-12-02 21:23:35,901 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 21:23:35,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:23:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 21:23:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-12-02 21:23:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 21:23:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-12-02 21:23:35,905 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 41 [2018-12-02 21:23:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:35,905 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-12-02 21:23:35,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:23:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-12-02 21:23:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 21:23:35,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:35,906 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:35,906 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:35,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1317930072, now seen corresponding path program 4 times [2018-12-02 21:23:35,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:35,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:23:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:35,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 95 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-02 21:23:36,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:36,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:36,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:23:36,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:23:36,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:36,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:36,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:36,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:23:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:36,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 27 proven. 154 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-12-02 21:23:36,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 27 proven. 169 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-12-02 21:23:36,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:36,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 20 [2018-12-02 21:23:36,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:36,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 21:23:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 21:23:36,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:23:36,410 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 14 states. [2018-12-02 21:23:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:36,625 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2018-12-02 21:23:36,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 21:23:36,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-12-02 21:23:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:36,626 INFO L225 Difference]: With dead ends: 79 [2018-12-02 21:23:36,626 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 21:23:36,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 21:23:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 21:23:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-12-02 21:23:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 21:23:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-12-02 21:23:36,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 93 [2018-12-02 21:23:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:36,632 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-12-02 21:23:36,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 21:23:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-12-02 21:23:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 21:23:36,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:36,634 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:36,634 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:36,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 5 times [2018-12-02 21:23:36,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:36,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:36,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-12-02 21:23:36,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:36,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:36,689 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:23:36,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:23:36,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:36,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:36,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:23:36,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:23:36,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 21:23:36,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:23:36,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-12-02 21:23:36,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-12-02 21:23:36,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:36,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 13 [2018-12-02 21:23:36,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:36,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:23:36,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:23:36,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:23:36,928 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 8 states. [2018-12-02 21:23:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:36,985 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-12-02 21:23:36,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:23:36,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-12-02 21:23:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:36,986 INFO L225 Difference]: With dead ends: 55 [2018-12-02 21:23:36,986 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 21:23:36,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 212 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:23:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 21:23:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-12-02 21:23:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 21:23:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-12-02 21:23:36,990 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 109 [2018-12-02 21:23:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:36,990 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-12-02 21:23:36,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:23:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-12-02 21:23:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-02 21:23:36,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:36,991 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:36,991 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:36,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1066463687, now seen corresponding path program 6 times [2018-12-02 21:23:36,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:36,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:36,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:23:36,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:36,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-12-02 21:23:37,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:37,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:37,050 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:23:37,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:23:37,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:37,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:37,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:23:37,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:23:37,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:23:37,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:23:37,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 343 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-12-02 21:23:37,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 365 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-02 21:23:37,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:37,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 18] total 23 [2018-12-02 21:23:37,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:37,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 21:23:37,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:23:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:23:37,733 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 15 states. [2018-12-02 21:23:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:37,967 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2018-12-02 21:23:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 21:23:37,968 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 136 [2018-12-02 21:23:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:37,968 INFO L225 Difference]: With dead ends: 111 [2018-12-02 21:23:37,969 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 21:23:37,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 246 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 21:23:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 21:23:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-12-02 21:23:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 21:23:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-12-02 21:23:37,974 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 136 [2018-12-02 21:23:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:37,974 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-12-02 21:23:37,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 21:23:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-12-02 21:23:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-02 21:23:37,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:37,975 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:37,975 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:37,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1120272490, now seen corresponding path program 7 times [2018-12-02 21:23:37,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:37,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:23:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:37,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 669 proven. 122 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-12-02 21:23:38,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:38,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:38,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:23:38,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:23:38,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:38,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:38,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:38,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:23:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:38,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-02 21:23:38,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 693 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2018-12-02 21:23:38,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:38,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 15] total 26 [2018-12-02 21:23:38,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:38,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 21:23:38,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 21:23:38,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:23:38,909 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 18 states. [2018-12-02 21:23:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:39,246 INFO L93 Difference]: Finished difference Result 144 states and 228 transitions. [2018-12-02 21:23:39,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 21:23:39,246 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 204 [2018-12-02 21:23:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:39,247 INFO L225 Difference]: With dead ends: 144 [2018-12-02 21:23:39,247 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 21:23:39,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 387 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=508, Invalid=1562, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 21:23:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 21:23:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-12-02 21:23:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 21:23:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2018-12-02 21:23:39,255 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 204 [2018-12-02 21:23:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:39,255 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2018-12-02 21:23:39,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 21:23:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2018-12-02 21:23:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-12-02 21:23:39,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:39,259 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:39,259 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:39,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1795105459, now seen corresponding path program 8 times [2018-12-02 21:23:39,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:39,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:39,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:23:39,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:39,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:23:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 238 proven. 1112 refuted. 0 times theorem prover too weak. 4689 trivial. 0 not checked. [2018-12-02 21:23:39,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:39,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:23:39,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:23:39,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:23:39,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:23:39,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:23:39,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:23:39,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:23:39,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-02 21:23:39,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:23:39,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:23:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1187 proven. 123 refuted. 0 times theorem prover too weak. 4729 trivial. 0 not checked. [2018-12-02 21:23:39,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:23:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1187 proven. 134 refuted. 0 times theorem prover too weak. 4718 trivial. 0 not checked. [2018-12-02 21:23:40,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:23:40,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 20 [2018-12-02 21:23:40,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:23:40,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 21:23:40,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:23:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:23:40,149 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 15 states. [2018-12-02 21:23:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:23:40,472 INFO L93 Difference]: Finished difference Result 182 states and 280 transitions. [2018-12-02 21:23:40,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 21:23:40,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 327 [2018-12-02 21:23:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:23:40,473 INFO L225 Difference]: With dead ends: 182 [2018-12-02 21:23:40,474 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 21:23:40,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 639 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 21:23:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 21:23:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-12-02 21:23:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 21:23:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2018-12-02 21:23:40,480 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 327 [2018-12-02 21:23:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:23:40,481 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2018-12-02 21:23:40,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 21:23:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2018-12-02 21:23:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-02 21:23:40,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:23:40,485 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:23:40,485 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:23:40,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:23:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2018-12-02 21:23:40,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:23:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:40,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:23:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:23:40,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:23:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:23:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:23:40,542 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 21:23:40,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:23:40 BoogieIcfgContainer [2018-12-02 21:23:40,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:23:40,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:23:40,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:23:40,580 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:23:40,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:23:33" (3/4) ... [2018-12-02 21:23:40,582 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 21:23:40,643 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_88deb2e0-7d01-49c1-9999-54566edd4aef/bin-2019/utaipan/witness.graphml [2018-12-02 21:23:40,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:23:40,644 INFO L168 Benchmark]: Toolchain (without parser) took 7415.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 949.7 MB in the beginning and 996.0 MB in the end (delta: -46.3 MB). Peak memory consumption was 229.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:40,644 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:23:40,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 121.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:40,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.24 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:23:40,645 INFO L168 Benchmark]: Boogie Preprocessor took 10.01 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:23:40,645 INFO L168 Benchmark]: RCFGBuilder took 154.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:40,645 INFO L168 Benchmark]: TraceAbstraction took 7051.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.0 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:40,645 INFO L168 Benchmark]: Witness Printer took 63.44 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 996.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:23:40,646 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 121.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.24 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.01 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 154.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7051.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.0 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. * Witness Printer took 63.44 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 996.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 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) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 7.0s OverallTime, 12 OverallIterations, 67 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 219 SDtfs, 438 SDslu, 839 SDs, 0 SdLazy, 1372 SolverSat, 469 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2184 GetRequests, 1902 SyntacticMatches, 64 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2496 NumberOfCodeBlocks, 2249 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 3007 ConstructedInterpolants, 0 QuantifiedInterpolants, 845802 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1695 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 26437/30915 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...