./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/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 e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:30:45,638 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:30:45,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:30:45,645 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:30:45,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:30:45,646 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:30:45,646 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:30:45,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:30:45,648 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:30:45,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:30:45,649 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:30:45,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:30:45,649 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:30:45,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:30:45,650 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:30:45,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:30:45,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:30:45,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:30:45,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:30:45,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:30:45,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:30:45,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:30:45,656 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:30:45,656 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:30:45,656 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:30:45,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:30:45,657 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:30:45,657 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:30:45,658 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:30:45,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:30:45,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:30:45,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:30:45,659 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:30:45,659 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:30:45,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:30:45,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:30:45,660 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:30:45,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:30:45,667 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:30:45,668 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:30:45,668 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:30:45,668 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:30:45,668 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:30:45,668 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:30:45,668 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:30:45,668 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:30:45,668 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:30:45,668 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:30:45,668 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:30:45,669 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:30:45,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:30:45,669 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:30:45,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:30:45,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:30:45,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:30:45,669 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:30:45,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:30:45,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:30:45,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:30:45,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:30:45,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:30:45,671 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:30:45,671 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:30:45,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:30:45,671 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:30:45,671 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_d602bda8-de34-4583-8619-580b5dead2aa/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 -> e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 [2018-12-09 09:30:45,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:30:45,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:30:45,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:30:45,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:30:45,702 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:30:45,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c [2018-12-09 09:30:45,744 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/data/bdc68bb07/63d56b8725e84212a913b6a1b5702b41/FLAG8666cd0c1 [2018-12-09 09:30:46,069 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:30:46,069 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/sv-benchmarks/c/recursive-simple/fibo_2calls_5_true-unreach-call_true-termination.c [2018-12-09 09:30:46,072 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/data/bdc68bb07/63d56b8725e84212a913b6a1b5702b41/FLAG8666cd0c1 [2018-12-09 09:30:46,490 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/data/bdc68bb07/63d56b8725e84212a913b6a1b5702b41 [2018-12-09 09:30:46,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:30:46,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:30:46,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:30:46,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:30:46,496 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:30:46,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71739fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46, skipping insertion in model container [2018-12-09 09:30:46,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:30:46,512 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:30:46,611 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:30:46,613 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:30:46,624 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:30:46,632 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:30:46,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46 WrapperNode [2018-12-09 09:30:46,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:30:46,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:30:46,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:30:46,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:30:46,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:30:46,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:30:46,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:30:46,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:30:46,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... [2018-12-09 09:30:46,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:30:46,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:30:46,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:30:46,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:30:46,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:30:46,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:30:46,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:30:46,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:30:46,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:30:46,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:30:46,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:30:46,728 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-09 09:30:46,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-09 09:30:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-09 09:30:46,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-09 09:30:46,823 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:30:46,824 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 09:30:46,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:30:46 BoogieIcfgContainer [2018-12-09 09:30:46,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:30:46,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:30:46,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:30:46,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:30:46,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:30:46" (1/3) ... [2018-12-09 09:30:46,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bac680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:30:46, skipping insertion in model container [2018-12-09 09:30:46,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:30:46" (2/3) ... [2018-12-09 09:30:46,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bac680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:30:46, skipping insertion in model container [2018-12-09 09:30:46,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:30:46" (3/3) ... [2018-12-09 09:30:46,830 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5_true-unreach-call_true-termination.c [2018-12-09 09:30:46,838 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:30:46,843 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:30:46,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:30:46,875 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:30:46,875 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:30:46,875 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:30:46,875 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:30:46,875 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:30:46,875 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:30:46,875 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:30:46,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:30:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-09 09:30:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 09:30:46,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:46,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:46,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:46,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-09 09:30:46,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:46,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:46,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:46,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:30:46,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:30:46,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:30:46,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:30:46,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:30:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:30:46,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:30:46,999 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-09 09:30:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:47,057 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-09 09:30:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:30:47,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 09:30:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:47,063 INFO L225 Difference]: With dead ends: 44 [2018-12-09 09:30:47,064 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 09:30:47,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:30:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 09:30:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 09:30:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 09:30:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 09:30:47,090 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-09 09:30:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:47,091 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 09:30:47,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:30:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 09:30:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 09:30:47,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:47,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:47,092 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:47,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-09 09:30:47,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:47,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:47,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:30:47,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:30:47,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:30:47,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:30:47,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:30:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:30:47,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:30:47,121 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-09 09:30:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:47,159 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 09:30:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:30:47,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 09:30:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:47,160 INFO L225 Difference]: With dead ends: 36 [2018-12-09 09:30:47,160 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 09:30:47,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:30:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 09:30:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-09 09:30:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 09:30:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 09:30:47,165 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-09 09:30:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:47,165 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 09:30:47,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:30:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 09:30:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:30:47,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:47,166 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:47,166 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:47,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:47,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-09 09:30:47,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:47,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:47,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:30:47,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:47,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:30:47,202 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 09:30:47,203 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-12-09 09:30:47,223 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:30:47,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:30:47,283 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:30:47,284 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 09:30:47,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:47,288 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:30:47,315 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 09:30:47,315 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:30:47,326 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-09 09:30:47,326 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:30:47,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:30:47,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-09 09:30:47,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:30:47,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:30:47,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:30:47,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:30:47,328 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-12-09 09:30:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:47,435 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-12-09 09:30:47,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:30:47,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 09:30:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:47,436 INFO L225 Difference]: With dead ends: 72 [2018-12-09 09:30:47,436 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 09:30:47,437 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:30:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 09:30:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-09 09:30:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 09:30:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 09:30:47,442 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-12-09 09:30:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:47,442 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 09:30:47,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:30:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 09:30:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 09:30:47,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:47,444 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:47,444 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:47,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-09 09:30:47,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:47,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:47,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:47,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:47,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 09:30:47,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:47,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:30:47,488 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-09 09:30:47,488 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 09:30:47,490 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:30:47,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:30:47,499 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:30:47,499 INFO L272 AbstractInterpreter]: Visited 16 different actions 30 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 09:30:47,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:47,501 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:30:47,512 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 09:30:47,512 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:30:47,529 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-09 09:30:47,529 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:30:47,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:30:47,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-09 09:30:47,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:30:47,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:30:47,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:30:47,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:30:47,530 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-12-09 09:30:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:47,690 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-09 09:30:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:30:47,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-12-09 09:30:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:47,691 INFO L225 Difference]: With dead ends: 87 [2018-12-09 09:30:47,691 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 09:30:47,692 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:30:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 09:30:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-09 09:30:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 09:30:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-09 09:30:47,697 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-12-09 09:30:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:47,697 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-09 09:30:47,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:30:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-09 09:30:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 09:30:47,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:47,698 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:47,699 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:47,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:47,699 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-12-09 09:30:47,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:47,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:47,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:47,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:47,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 09:30:47,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:47,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:30:47,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:30:47,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:30:47,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:47,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:30:47,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:30:47,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:30:47,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:30:47,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:30:47,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 09:30:47,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:30:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 09:30:48,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:30:48,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-12-09 09:30:48,045 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:30:48,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:30:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:30:48,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:30:48,046 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-12-09 09:30:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:48,197 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-09 09:30:48,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:30:48,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-12-09 09:30:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:48,200 INFO L225 Difference]: With dead ends: 121 [2018-12-09 09:30:48,200 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 09:30:48,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-12-09 09:30:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 09:30:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-09 09:30:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 09:30:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-09 09:30:48,210 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-12-09 09:30:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:48,210 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-09 09:30:48,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:30:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-09 09:30:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 09:30:48,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:48,212 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:48,212 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:48,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:48,212 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-12-09 09:30:48,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:48,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:48,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:30:48,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:48,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 09:30:48,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:48,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:30:48,278 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-09 09:30:48,279 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 09:30:48,279 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:30:48,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:30:48,289 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:30:48,289 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 09:30:48,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:48,291 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:30:48,307 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 09:30:48,307 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:30:48,338 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-09 09:30:48,339 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:30:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:30:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-12-09 09:30:48,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:30:48,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:30:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:30:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:30:48,340 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-12-09 09:30:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:48,547 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-12-09 09:30:48,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:30:48,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-12-09 09:30:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:48,548 INFO L225 Difference]: With dead ends: 109 [2018-12-09 09:30:48,548 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 09:30:48,548 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:30:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 09:30:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 09:30:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 09:30:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-09 09:30:48,556 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-12-09 09:30:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:48,556 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-09 09:30:48,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:30:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-12-09 09:30:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 09:30:48,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:48,558 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:48,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:48,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-12-09 09:30:48,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:48,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:48,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:48,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 09:30:48,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:48,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:30:48,600 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-12-09 09:30:48,601 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 09:30:48,602 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:30:48,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:30:48,629 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:30:48,629 INFO L272 AbstractInterpreter]: Visited 33 different actions 135 times. Never merged. Never widened. Performed 278 root evaluator evaluations with a maximum evaluation depth of 4. Performed 278 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-12-09 09:30:48,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:48,634 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:30:48,657 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 49.35% of their original sizes. [2018-12-09 09:30:48,657 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:30:49,044 INFO L418 sIntCurrentIteration]: We unified 66 AI predicates to 66 [2018-12-09 09:30:49,044 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:30:49,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:30:49,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [6] total 44 [2018-12-09 09:30:49,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:30:49,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-09 09:30:49,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-09 09:30:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1474, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 09:30:49,046 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 40 states. [2018-12-09 09:30:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:50,700 INFO L93 Difference]: Finished difference Result 150 states and 197 transitions. [2018-12-09 09:30:50,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 09:30:50,700 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 67 [2018-12-09 09:30:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:50,701 INFO L225 Difference]: With dead ends: 150 [2018-12-09 09:30:50,702 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 09:30:50,703 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=3348, Unknown=0, NotChecked=0, Total=3540 [2018-12-09 09:30:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 09:30:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-12-09 09:30:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 09:30:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-12-09 09:30:50,713 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 67 [2018-12-09 09:30:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:50,713 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-12-09 09:30:50,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-09 09:30:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-12-09 09:30:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 09:30:50,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:50,715 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:50,715 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:50,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 2 times [2018-12-09 09:30:50,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:50,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:30:50,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:50,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-12-09 09:30:50,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:50,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:30:50,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:30:50,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:30:50,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:50,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:30:51,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:30:51,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:30:51,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 09:30:51,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:30:51,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-12-09 09:30:51,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:30:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-12-09 09:30:51,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:30:51,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2018-12-09 09:30:51,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:30:51,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 09:30:51,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 09:30:51,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2018-12-09 09:30:51,605 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 28 states. [2018-12-09 09:30:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:51,794 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2018-12-09 09:30:51,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 09:30:51,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2018-12-09 09:30:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:51,795 INFO L225 Difference]: With dead ends: 161 [2018-12-09 09:30:51,795 INFO L226 Difference]: Without dead ends: 154 [2018-12-09 09:30:51,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 206 SyntacticMatches, 18 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2018-12-09 09:30:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-09 09:30:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 111. [2018-12-09 09:30:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 09:30:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-12-09 09:30:51,807 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 109 [2018-12-09 09:30:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:51,807 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-12-09 09:30:51,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 09:30:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-12-09 09:30:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 09:30:51,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:30:51,808 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:30:51,808 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:30:51,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:30:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash 265701462, now seen corresponding path program 3 times [2018-12-09 09:30:51,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:30:51,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:51,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:30:51,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:30:51,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:30:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:30:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-12-09 09:30:51,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:51,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:30:51,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:30:51,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:30:51,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:30:51,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:30:51,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:30:51,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:30:51,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:30:51,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:30:51,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:30:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-09 09:30:51,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:30:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 57 proven. 63 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-12-09 09:30:52,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:30:52,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 16 [2018-12-09 09:30:52,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:30:52,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:30:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:30:52,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:30:52,210 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 12 states. [2018-12-09 09:30:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:30:52,308 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2018-12-09 09:30:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:30:52,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2018-12-09 09:30:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:30:52,309 INFO L225 Difference]: With dead ends: 146 [2018-12-09 09:30:52,309 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:30:52,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-12-09 09:30:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:30:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:30:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:30:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:30:52,311 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-12-09 09:30:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:30:52,311 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:30:52,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:30:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:30:52,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:30:52,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 09:30:52,535 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 09:30:52,536 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= 5 main_~x~0) (<= main_~x~0 5)) [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L448 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2018-12-09 09:30:52,536 INFO L451 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2018-12-09 09:30:52,537 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (or (not (= |fibo2_#in~n| 4)) (= fibo2_~n 4)) (< 1 |fibo2_#in~n|) (or (not (= |fibo2_#in~n| 3)) (= fibo2_~n 3)) (<= |fibo2_#in~n| fibo2_~n) (or (not (= |fibo2_#in~n| 2)) (= fibo2_~n 2))) [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L444 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (and (or (and (= fibo2_~n 2) (= |fibo2_#t~ret2| 1)) (not (= |fibo2_#in~n| 2))) (< 1 |fibo2_#in~n|) (<= |fibo2_#in~n| fibo2_~n) (or (not (= |fibo2_#in~n| 4)) (and (= fibo2_~n 4) (<= |fibo2_#t~ret2| 2) (<= 2 |fibo2_#t~ret2|))) (or (not (= |fibo2_#in~n| 3)) (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1) (= fibo2_~n 3)))) [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L451 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2018-12-09 09:30:52,537 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (not (= |fibo1_#in~n| 1)) (or (not (= |fibo1_#in~n| 2)) (= fibo1_~n 2)) (not (= |fibo1_#in~n| 0)) (or (= fibo1_~n 3) (not (= |fibo1_#in~n| 3))) (or (not (= |fibo1_#in~n| 5)) (= fibo1_~n 5))) [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L444 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (<= 1 |fibo1_#t~ret0|)) (.cse1 (<= |fibo1_#t~ret0| 1))) (and (or (not (= |fibo1_#in~n| 2)) (and .cse0 (= fibo1_~n 2) .cse1)) (or (not (= |fibo1_#in~n| 5)) (and (= fibo1_~n 5) (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3))) (not (= |fibo1_#in~n| 1)) (not (= |fibo1_#in~n| 0)) (or (not (= |fibo1_#in~n| 3)) (and (= fibo1_~n 3) .cse0 .cse1)))) [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2018-12-09 09:30:52,537 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2018-12-09 09:30:52,538 INFO L448 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2018-12-09 09:30:52,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:30:52 BoogieIcfgContainer [2018-12-09 09:30:52,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:30:52,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:30:52,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:30:52,540 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:30:52,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:30:46" (3/4) ... [2018-12-09 09:30:52,543 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:30:52,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:30:52,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:30:52,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2018-12-09 09:30:52,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2018-12-09 09:30:52,550 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 09:30:52,550 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 09:30:52,550 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 09:30:52,581 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d602bda8-de34-4583-8619-580b5dead2aa/bin-2019/utaipan/witness.graphml [2018-12-09 09:30:52,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:30:52,581 INFO L168 Benchmark]: Toolchain (without parser) took 6089.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:30:52,582 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:30:52,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.92 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:30:52,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:30:52,583 INFO L168 Benchmark]: Boogie Preprocessor took 11.53 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:30:52,583 INFO L168 Benchmark]: RCFGBuilder took 165.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:30:52,583 INFO L168 Benchmark]: TraceAbstraction took 5714.61 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.9 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:30:52,584 INFO L168 Benchmark]: Witness Printer took 41.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:30:52,585 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.92 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.53 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 165.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5714.61 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.9 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * Witness Printer took 41.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 5.6s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 340 SDtfs, 253 SDslu, 3686 SDs, 0 SdLazy, 1330 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 827 GetRequests, 629 SyntacticMatches, 34 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.7987249544626595 AbsIntWeakeningRatio, 0.5683060109289617 AbsIntAvgWeakeningVarsNumRemoved, 0.48633879781420764 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 173 PreInvPairs, 184 NumberOfFragments, 182 HoareAnnotationTreeSize, 173 FomulaSimplifications, 106 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 186 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 756 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1012 ConstructedInterpolants, 0 QuantifiedInterpolants, 231982 SizeOfPredicates, 10 NumberOfNonLiveVariables, 559 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 1362/1857 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...