./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-5842f4b [2018-11-18 14:04:14,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:04:14,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:04:14,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:04:14,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:04:14,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:04:14,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:04:14,642 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:04:14,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:04:14,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:04:14,644 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:04:14,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:04:14,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:04:14,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:04:14,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:04:14,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:04:14,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:04:14,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:04:14,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:04:14,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:04:14,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:04:14,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:04:14,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:04:14,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:04:14,657 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:04:14,658 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:04:14,659 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:04:14,660 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:04:14,661 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:04:14,662 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:04:14,662 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:04:14,662 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:04:14,663 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:04:14,663 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:04:14,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:04:14,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:04:14,665 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:04:14,677 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:04:14,677 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:04:14,678 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:04:14,678 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:04:14,678 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:04:14,678 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:04:14,679 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:04:14,679 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:04:14,679 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:04:14,683 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:04:14,683 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:04:14,683 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:04:14,684 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:04:14,685 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:04:14,685 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:04:14,685 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:04:14,685 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:04:14,685 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:04:14,685 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:04:14,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:04:14,686 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:04:14,686 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:04:14,686 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:04:14,686 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:04:14,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:04:14,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:04:14,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:04:14,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:04:14,687 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:04:14,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:04:14,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:04:14,687 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:04:14,688 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:04:14,688 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:04:14,688 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:04:14,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:04:14,688 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:04:14,688 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_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:14,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:04:14,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:04:14,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:04:14,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:04:14,753 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:04:14,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-18 14:04:14,803 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/data/30d4ccef4/9e1598db929c404caef99a6c32f73f06/FLAG27532180a [2018-11-18 14:04:15,150 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:04:15,151 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-18 14:04:15,155 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/data/30d4ccef4/9e1598db929c404caef99a6c32f73f06/FLAG27532180a [2018-11-18 14:04:15,165 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/data/30d4ccef4/9e1598db929c404caef99a6c32f73f06 [2018-11-18 14:04:15,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:04:15,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:04:15,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:04:15,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:04:15,173 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:04:15,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7b9b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15, skipping insertion in model container [2018-11-18 14:04:15,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:04:15,201 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:04:15,382 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:04:15,384 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:04:15,396 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:04:15,406 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:04:15,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15 WrapperNode [2018-11-18 14:04:15,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:04:15,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:04:15,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:04:15,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:04:15,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:04:15,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:04:15,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:04:15,424 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:04:15,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... [2018-11-18 14:04:15,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:04:15,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:04:15,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:04:15,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:04:15,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-18 14:04:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-18 14:04:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:04:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:04:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:04:15,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:04:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:04:15,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:04:15,723 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:04:15,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:04:15 BoogieIcfgContainer [2018-11-18 14:04:15,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:04:15,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:04:15,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:04:15,728 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:04:15,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:04:15" (1/3) ... [2018-11-18 14:04:15,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584584f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:04:15, skipping insertion in model container [2018-11-18 14:04:15,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:04:15" (2/3) ... [2018-11-18 14:04:15,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584584f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:04:15, skipping insertion in model container [2018-11-18 14:04:15,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:04:15" (3/3) ... [2018-11-18 14:04:15,732 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-18 14:04:15,741 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:04:15,748 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:04:15,762 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:04:15,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:04:15,790 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:04:15,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:04:15,790 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:04:15,791 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:04:15,791 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:04:15,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:04:15,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:04:15,822 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 14:04:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 14:04:15,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:15,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:04:15,839 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:15,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-11-18 14:04:15,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:15,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:15,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:04:16,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:04:16,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:04:16,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:04:16,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:04:16,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:04:16,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:04:16,037 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-18 14:04:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:16,156 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-18 14:04:16,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:04:16,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 14:04:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:16,163 INFO L225 Difference]: With dead ends: 35 [2018-11-18 14:04:16,164 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 14:04:16,166 INFO L604 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-11-18 14:04:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 14:04:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 14:04:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 14:04:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-18 14:04:16,194 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-18 14:04:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:16,195 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 14:04:16,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:04:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-18 14:04:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 14:04:16,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:16,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:04:16,197 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:16,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-11-18 14:04:16,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:16,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:16,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:04:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:04:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:04:16,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:04:16,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:04:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:04:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:04:16,243 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-18 14:04:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:16,419 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-18 14:04:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:04:16,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 14:04:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:16,421 INFO L225 Difference]: With dead ends: 27 [2018-11-18 14:04:16,421 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 14:04:16,422 INFO L604 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-11-18 14:04:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 14:04:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-18 14:04:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 14:04:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-18 14:04:16,425 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-18 14:04:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:16,426 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-18 14:04:16,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:04:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-18 14:04:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 14:04:16,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:16,426 INFO L375 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-11-18 14:04:16,427 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:16,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-11-18 14:04:16,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:16,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:16,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:16,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:16,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:04:16,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:16,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:16,518 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-18 14:04:16,520 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-11-18 14:04:16,543 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:04:16,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:04:16,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:04:16,771 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-11-18 14:04:16,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:16,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:04:16,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:16,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:16,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:16,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:04:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:16,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:04:16,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 14:04:17,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:17,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-11-18 14:04:17,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:17,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:04:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:04:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:04:17,124 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-18 14:04:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:17,291 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-18 14:04:17,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:04:17,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-18 14:04:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:17,292 INFO L225 Difference]: With dead ends: 38 [2018-11-18 14:04:17,292 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 14:04:17,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-11-18 14:04:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 14:04:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 14:04:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 14:04:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-18 14:04:17,298 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-18 14:04:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:17,299 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-18 14:04:17,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:04:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-18 14:04:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 14:04:17,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:17,300 INFO L375 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-11-18 14:04:17,301 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:17,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-11-18 14:04:17,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:17,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:17,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:04:17,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:17,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:17,353 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-18 14:04:17,353 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-11-18 14:04:17,354 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:04:17,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:04:18,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:04:18,611 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-11-18 14:04:18,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:18,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:04:18,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:18,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:18,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:18,646 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:04:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:18,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:04:18,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 14:04:18,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:18,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-11-18 14:04:18,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:18,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:04:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:04:18,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:04:18,846 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-18 14:04:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:18,899 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-18 14:04:18,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:04:18,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-18 14:04:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:18,900 INFO L225 Difference]: With dead ends: 32 [2018-11-18 14:04:18,901 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 14:04:18,901 INFO L604 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-11-18 14:04:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 14:04:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 14:04:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 14:04:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 14:04:18,907 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-18 14:04:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:18,907 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 14:04:18,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:04:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-18 14:04:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 14:04:18,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:18,908 INFO L375 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-11-18 14:04:18,909 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:18,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-11-18 14:04:18,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:18,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:18,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 14:04:18,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:18,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:18,979 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:18,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:18,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:18,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:18,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:04:18,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:04:19,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 14:04:19,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:04:19,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 14:04:19,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 14:04:19,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:19,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-11-18 14:04:19,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:19,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:04:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:04:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:04:19,202 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 6 states. [2018-11-18 14:04:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:19,238 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-18 14:04:19,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:04:19,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-18 14:04:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:19,240 INFO L225 Difference]: With dead ends: 38 [2018-11-18 14:04:19,240 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 14:04:19,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:04:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 14:04:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-18 14:04:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 14:04:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 14:04:19,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 40 [2018-11-18 14:04:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:19,245 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 14:04:19,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:04:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-18 14:04:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 14:04:19,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:19,246 INFO L375 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-11-18 14:04:19,246 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:19,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2018-11-18 14:04:19,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:19,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:04:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:19,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 14:04:19,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:19,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:19,287 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:19,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:19,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:19,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:19,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:04:19,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 14:04:19,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:04:19,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:04:19,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 14:04:19,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:04:19,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:19,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 12 [2018-11-18 14:04:19,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:19,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 14:04:19,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:04:19,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:04:19,754 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 7 states. [2018-11-18 14:04:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:19,837 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-11-18 14:04:19,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:04:19,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-18 14:04:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:19,838 INFO L225 Difference]: With dead ends: 40 [2018-11-18 14:04:19,838 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 14:04:19,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:04:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 14:04:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-18 14:04:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 14:04:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-18 14:04:19,845 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 41 [2018-11-18 14:04:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:19,845 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-18 14:04:19,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 14:04:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-18 14:04:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 14:04:19,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:19,847 INFO L375 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-11-18 14:04:19,847 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:19,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1317930072, now seen corresponding path program 4 times [2018-11-18 14:04:19,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:19,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:19,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:04:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:19,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 95 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-18 14:04:19,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:19,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:19,984 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:19,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:19,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:19,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:19,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:19,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:04:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:20,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 27 proven. 154 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-18 14:04:20,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 27 proven. 169 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-18 14:04:20,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:20,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 20 [2018-11-18 14:04:20,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:20,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 14:04:20,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 14:04:20,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-18 14:04:20,790 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 14 states. [2018-11-18 14:04:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:21,189 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2018-11-18 14:04:21,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 14:04:21,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-11-18 14:04:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:21,191 INFO L225 Difference]: With dead ends: 79 [2018-11-18 14:04:21,191 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 14:04:21,192 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 14:04:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 14:04:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-18 14:04:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 14:04:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-11-18 14:04:21,197 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 93 [2018-11-18 14:04:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:21,197 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-11-18 14:04:21,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 14:04:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-11-18 14:04:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 14:04:21,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:21,199 INFO L375 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-11-18 14:04:21,199 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:21,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:21,200 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 5 times [2018-11-18 14:04:21,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:21,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:21,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-11-18 14:04:21,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:21,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:21,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:21,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:21,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:21,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:21,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:04:21,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:04:21,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 14:04:21,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:04:21,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-11-18 14:04:21,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-11-18 14:04:21,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:21,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 13 [2018-11-18 14:04:21,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:21,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:04:21,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:04:21,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:04:21,665 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 8 states. [2018-11-18 14:04:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:21,742 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-11-18 14:04:21,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:04:21,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-11-18 14:04:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:21,744 INFO L225 Difference]: With dead ends: 55 [2018-11-18 14:04:21,744 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 14:04:21,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 212 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:04:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 14:04:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-18 14:04:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 14:04:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-11-18 14:04:21,751 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 109 [2018-11-18 14:04:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:21,751 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-11-18 14:04:21,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:04:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-11-18 14:04:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 14:04:21,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:21,753 INFO L375 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-11-18 14:04:21,753 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:21,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:21,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1066463687, now seen corresponding path program 6 times [2018-11-18 14:04:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:21,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:04:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:21,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-11-18 14:04:21,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:21,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:21,934 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:21,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:21,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:21,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:21,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:04:21,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 14:04:21,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:04:21,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:04:21,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 343 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-11-18 14:04:22,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 365 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-11-18 14:04:22,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:22,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 18] total 23 [2018-11-18 14:04:22,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:22,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 14:04:22,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 14:04:22,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-11-18 14:04:22,672 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 15 states. [2018-11-18 14:04:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:22,912 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2018-11-18 14:04:22,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 14:04:22,912 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 136 [2018-11-18 14:04:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:22,913 INFO L225 Difference]: With dead ends: 111 [2018-11-18 14:04:22,913 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 14:04:22,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 246 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 14:04:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 14:04:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-11-18 14:04:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 14:04:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-11-18 14:04:22,922 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 136 [2018-11-18 14:04:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:22,922 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-11-18 14:04:22,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 14:04:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-11-18 14:04:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 14:04:22,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:22,925 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:04:22,925 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:22,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2018-11-18 14:04:22,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:22,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:22,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:04:22,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:22,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-11-18 14:04:23,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:23,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:23,029 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:23,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:23,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:23,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:23,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:23,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:04:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:23,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2018-11-18 14:04:23,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2018-11-18 14:04:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:23,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 15] total 18 [2018-11-18 14:04:23,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:23,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:04:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:04:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:04:23,959 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 10 states. [2018-11-18 14:04:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:24,032 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2018-11-18 14:04:24,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:04:24,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2018-11-18 14:04:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:24,034 INFO L225 Difference]: With dead ends: 71 [2018-11-18 14:04:24,034 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 14:04:24,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 337 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2018-11-18 14:04:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 14:04:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-18 14:04:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 14:04:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2018-11-18 14:04:24,041 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 177 [2018-11-18 14:04:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:24,043 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2018-11-18 14:04:24,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:04:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2018-11-18 14:04:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-18 14:04:24,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:24,048 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:04:24,048 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:24,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:24,048 INFO L82 PathProgramCache]: Analyzing trace with hash -231142517, now seen corresponding path program 8 times [2018-11-18 14:04:24,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:24,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:24,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:24,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:24,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 829 proven. 826 refuted. 0 times theorem prover too weak. 5465 trivial. 0 not checked. [2018-11-18 14:04:24,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:24,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:24,200 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:24,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:24,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:24,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/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-11-18 14:04:24,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:04:24,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:04:24,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-18 14:04:24,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:04:24,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1310 proven. 123 refuted. 0 times theorem prover too weak. 5687 trivial. 0 not checked. [2018-11-18 14:04:24,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1310 proven. 134 refuted. 0 times theorem prover too weak. 5676 trivial. 0 not checked. [2018-11-18 14:04:25,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:25,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13] total 22 [2018-11-18 14:04:25,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:25,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 14:04:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 14:04:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-11-18 14:04:25,035 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand 17 states. [2018-11-18 14:04:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:25,320 INFO L93 Difference]: Finished difference Result 141 states and 229 transitions. [2018-11-18 14:04:25,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 14:04:25,320 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 354 [2018-11-18 14:04:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:25,322 INFO L225 Difference]: With dead ends: 141 [2018-11-18 14:04:25,322 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 14:04:25,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 691 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 14:04:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 14:04:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-11-18 14:04:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 14:04:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2018-11-18 14:04:25,330 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 354 [2018-11-18 14:04:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:25,331 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2018-11-18 14:04:25,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 14:04:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2018-11-18 14:04:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-18 14:04:25,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:25,334 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:04:25,334 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:25,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 9 times [2018-11-18 14:04:25,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:25,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:25,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:04:25,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:25,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 702 proven. 270 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked. [2018-11-18 14:04:25,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:25,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:25,454 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:25,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:25,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:25,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:04:25,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:04:25,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 14:04:25,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:04:25,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:04:25,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2018-11-18 14:04:25,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-11-18 14:04:26,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:26,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 17] total 18 [2018-11-18 14:04:26,631 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:26,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:04:26,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:04:26,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:04:26,631 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand 11 states. [2018-11-18 14:04:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:26,726 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2018-11-18 14:04:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:04:26,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2018-11-18 14:04:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:26,728 INFO L225 Difference]: With dead ends: 83 [2018-11-18 14:04:26,728 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 14:04:26,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 553 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2018-11-18 14:04:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 14:04:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-18 14:04:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 14:04:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2018-11-18 14:04:26,737 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 286 [2018-11-18 14:04:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:26,737 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2018-11-18 14:04:26,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:04:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2018-11-18 14:04:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2018-11-18 14:04:26,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:26,744 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 85, 52, 52, 52, 52, 52, 52, 52, 33, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:04:26,744 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:26,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:26,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1996932458, now seen corresponding path program 10 times [2018-11-18 14:04:26,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:26,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:26,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:04:26,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:26,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30714 backedges. 1016 proven. 4306 refuted. 0 times theorem prover too weak. 25392 trivial. 0 not checked. [2018-11-18 14:04:27,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:27,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:27,116 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:27,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:27,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:27,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:04:27,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:27,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:04:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:27,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30714 backedges. 13460 proven. 813 refuted. 0 times theorem prover too weak. 16441 trivial. 0 not checked. [2018-11-18 14:04:27,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 30714 backedges. 970 proven. 4901 refuted. 0 times theorem prover too weak. 24843 trivial. 0 not checked. [2018-11-18 14:04:29,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:29,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 22] total 28 [2018-11-18 14:04:29,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:29,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:04:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:04:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2018-11-18 14:04:29,422 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand 18 states. [2018-11-18 14:04:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:29,711 INFO L93 Difference]: Finished difference Result 165 states and 271 transitions. [2018-11-18 14:04:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 14:04:29,712 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 722 [2018-11-18 14:04:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:29,713 INFO L225 Difference]: With dead ends: 165 [2018-11-18 14:04:29,713 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 14:04:29,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1484 GetRequests, 1418 SyntacticMatches, 20 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=594, Invalid=1662, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 14:04:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 14:04:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2018-11-18 14:04:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 14:04:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2018-11-18 14:04:29,721 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 722 [2018-11-18 14:04:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:29,722 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2018-11-18 14:04:29,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:04:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2018-11-18 14:04:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-11-18 14:04:29,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:29,725 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:04:29,725 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:29,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1942503438, now seen corresponding path program 11 times [2018-11-18 14:04:29,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:29,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:29,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:04:29,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:29,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:04:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1240 proven. 3038 refuted. 0 times theorem prover too weak. 12129 trivial. 0 not checked. [2018-11-18 14:04:29,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:29,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:04:29,985 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:04:29,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:04:29,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:04:29,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:04:29,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:04:29,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:04:30,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-11-18 14:04:30,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:04:30,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:04:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2607 proven. 977 refuted. 0 times theorem prover too weak. 12823 trivial. 0 not checked. [2018-11-18 14:04:30,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:04:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2611 proven. 1022 refuted. 0 times theorem prover too weak. 12774 trivial. 0 not checked. [2018-11-18 14:04:31,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:04:31,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 21] total 31 [2018-11-18 14:04:31,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:04:31,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 14:04:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 14:04:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2018-11-18 14:04:31,593 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand 22 states. [2018-11-18 14:04:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:04:32,153 INFO L93 Difference]: Finished difference Result 201 states and 367 transitions. [2018-11-18 14:04:32,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 14:04:32,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 531 [2018-11-18 14:04:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:04:32,156 INFO L225 Difference]: With dead ends: 201 [2018-11-18 14:04:32,156 INFO L226 Difference]: Without dead ends: 126 [2018-11-18 14:04:32,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1115 GetRequests, 1038 SyntacticMatches, 19 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=839, Invalid=2701, Unknown=0, NotChecked=0, Total=3540 [2018-11-18 14:04:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-18 14:04:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-11-18 14:04:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 14:04:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2018-11-18 14:04:32,169 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 531 [2018-11-18 14:04:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:04:32,171 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2018-11-18 14:04:32,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 14:04:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2018-11-18 14:04:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-18 14:04:32,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:04:32,174 INFO L375 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-11-18 14:04:32,174 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:04:32,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:04:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 12 times [2018-11-18 14:04:32,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:04:32,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:32,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:04:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:04:32,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:04:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:04:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:04:32,254 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 14:04:32,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:04:32 BoogieIcfgContainer [2018-11-18 14:04:32,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:04:32,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:04:32,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:04:32,303 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:04:32,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:04:15" (3/4) ... [2018-11-18 14:04:32,306 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 14:04:32,372 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_98c728ed-fea0-4575-ac3c-a61210a9b222/bin-2019/utaipan/witness.graphml [2018-11-18 14:04:32,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:04:32,373 INFO L168 Benchmark]: Toolchain (without parser) took 17205.09 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 716.7 MB). Free memory was 960.7 MB in the beginning and 1.1 GB in the end (delta: -106.3 MB). Peak memory consumption was 610.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:04:32,375 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:04:32,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.23 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:04:32,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.53 ms. Allocated memory is still 1.0 GB. Free memory is still 950.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:04:32,375 INFO L168 Benchmark]: Boogie Preprocessor took 12.30 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:04:32,375 INFO L168 Benchmark]: RCFGBuilder took 288.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:04:32,376 INFO L168 Benchmark]: TraceAbstraction took 16578.07 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 572.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 623.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:04:32,376 INFO L168 Benchmark]: Witness Printer took 69.11 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:04:32,377 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.42 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.23 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.53 ms. Allocated memory is still 1.0 GB. Free memory is still 950.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.30 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 288.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16578.07 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 572.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 623.1 MB. Max. memory is 11.5 GB. * Witness Printer took 69.11 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L27] 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, 16.5s OverallTime, 15 OverallIterations, 105 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 299 SDtfs, 629 SDslu, 1142 SDs, 0 SdLazy, 2095 SolverSat, 698 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5349 GetRequests, 4913 SyntacticMatches, 118 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2649 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 47 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 5574 NumberOfCodeBlocks, 5164 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 7615 ConstructedInterpolants, 0 QuantifiedInterpolants, 4311763 SizeOfPredicates, 83 NumberOfNonLiveVariables, 4762 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 165875/187464 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...