./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig1_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f7e1c1540b70904598fe5e82d3f5b8e6f2e3e9f6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:40:21,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:40:21,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:40:21,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:40:21,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:40:21,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:40:21,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:40:21,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:40:21,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:40:21,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:40:21,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:40:21,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:40:21,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:40:21,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:40:21,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:40:21,424 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:40:21,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:40:21,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:40:21,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:40:21,429 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:40:21,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:40:21,431 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:40:21,432 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:40:21,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:40:21,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:40:21,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:40:21,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:40:21,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:40:21,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:40:21,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:40:21,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:40:21,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:40:21,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:40:21,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:40:21,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:40:21,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:40:21,439 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 05:40:21,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:40:21,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:40:21,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:40:21,449 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:40:21,449 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:40:21,449 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:40:21,449 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 05:40:21,449 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:40:21,450 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 05:40:21,450 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 05:40:21,450 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:40:21,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:40:21,451 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:40:21,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:40:21,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:40:21,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:40:21,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:40:21,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:40:21,452 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 05:40:21,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:40:21,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:40:21,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:40:21,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:40:21,453 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:40:21,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:40:21,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:40:21,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:40:21,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:40:21,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:40:21,454 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 05:40:21,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:40:21,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:40:21,454 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 05:40:21,454 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_f78a3366-a2eb-47de-b928-0b8d6128214e/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7e1c1540b70904598fe5e82d3f5b8e6f2e3e9f6 [2018-11-10 05:40:21,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:40:21,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:40:21,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:40:21,486 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:40:21,486 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:40:21,487 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig1_true-termination_true-no-overflow.c [2018-11-10 05:40:21,523 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/data/962b9bfe9/29e4930552a149fcb5594127c947a711/FLAG5fb2eac2f [2018-11-10 05:40:21,912 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:40:21,912 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig1_true-termination_true-no-overflow.c [2018-11-10 05:40:21,917 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/data/962b9bfe9/29e4930552a149fcb5594127c947a711/FLAG5fb2eac2f [2018-11-10 05:40:21,925 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/data/962b9bfe9/29e4930552a149fcb5594127c947a711 [2018-11-10 05:40:21,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:40:21,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:40:21,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:40:21,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:40:21,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:40:21,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:40:21" (1/1) ... [2018-11-10 05:40:21,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12305cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:21, skipping insertion in model container [2018-11-10 05:40:21,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:40:21" (1/1) ... [2018-11-10 05:40:21,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:40:21,949 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:40:22,042 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:40:22,044 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:40:22,052 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:40:22,061 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:40:22,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22 WrapperNode [2018-11-10 05:40:22,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:40:22,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:40:22,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:40:22,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:40:22,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:40:22,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:40:22,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:40:22,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:40:22,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... [2018-11-10 05:40:22,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:40:22,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:40:22,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:40:22,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:40:22,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/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-10 05:40:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:40:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:40:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:40:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:40:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:40:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:40:22,270 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:40:22,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:40:22 BoogieIcfgContainer [2018-11-10 05:40:22,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:40:22,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:40:22,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:40:22,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:40:22,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:40:21" (1/3) ... [2018-11-10 05:40:22,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276e53e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:40:22, skipping insertion in model container [2018-11-10 05:40:22,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:22" (2/3) ... [2018-11-10 05:40:22,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276e53e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:40:22, skipping insertion in model container [2018-11-10 05:40:22,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:40:22" (3/3) ... [2018-11-10 05:40:22,277 INFO L112 eAbstractionObserver]: Analyzing ICFG PodelskiRybalchenko-LICS2004-Fig1_true-termination_true-no-overflow.c [2018-11-10 05:40:22,285 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:40:22,291 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-10 05:40:22,304 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-10 05:40:22,330 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:40:22,330 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:40:22,330 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:40:22,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:40:22,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:40:22,330 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:40:22,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:40:22,331 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:40:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-10 05:40:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 05:40:22,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:40:22,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:40:22,351 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:40:22,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:40:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1432253197, now seen corresponding path program 1 times [2018-11-10 05:40:22,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:40:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:40:22,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:40:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:40:22,450 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-10 05:40:22,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:40:22,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:40:22,452 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:40:22,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 05:40:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 05:40:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:40:22,468 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-10 05:40:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:40:22,483 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-10 05:40:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:40:22,484 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-10 05:40:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:40:22,492 INFO L225 Difference]: With dead ends: 39 [2018-11-10 05:40:22,492 INFO L226 Difference]: Without dead ends: 17 [2018-11-10 05:40:22,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:40:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-10 05:40:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 05:40:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 05:40:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 05:40:22,523 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2018-11-10 05:40:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:40:22,523 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 05:40:22,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 05:40:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-10 05:40:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 05:40:22,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:40:22,524 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:40:22,525 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:40:22,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:40:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1450187957, now seen corresponding path program 1 times [2018-11-10 05:40:22,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:40:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:40:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:40:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:40:22,565 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-10 05:40:22,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:40:22,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:40:22,565 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:40:22,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:40:22,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:40:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:40:22,567 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2018-11-10 05:40:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:40:22,594 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-10 05:40:22,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:40:22,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 05:40:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:40:22,595 INFO L225 Difference]: With dead ends: 19 [2018-11-10 05:40:22,595 INFO L226 Difference]: Without dead ends: 18 [2018-11-10 05:40:22,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:40:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-10 05:40:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-10 05:40:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 05:40:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-10 05:40:22,597 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2018-11-10 05:40:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:40:22,597 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 05:40:22,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:40:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-10 05:40:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 05:40:22,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:40:22,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:40:22,598 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:40:22,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:40:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1450187902, now seen corresponding path program 1 times [2018-11-10 05:40:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:40:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:40:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:40:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:40:22,616 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-10 05:40:22,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:40:22,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:40:22,616 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:40:22,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:40:22,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:40:22,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:40:22,617 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-10 05:40:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:40:22,642 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-10 05:40:22,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:40:22,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 05:40:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:40:22,644 INFO L225 Difference]: With dead ends: 26 [2018-11-10 05:40:22,644 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 05:40:22,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:40:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 05:40:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-11-10 05:40:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 05:40:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-10 05:40:22,647 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2018-11-10 05:40:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:40:22,648 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-10 05:40:22,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:40:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-10 05:40:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 05:40:22,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:40:22,648 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:40:22,649 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:40:22,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:40:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2006153642, now seen corresponding path program 1 times [2018-11-10 05:40:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:40:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:40:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,650 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:40:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:40:22,666 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-10 05:40:22,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:40:22,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:40:22,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:40:22,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:40:22,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:40:22,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:40:22,668 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-10 05:40:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:40:22,683 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-10 05:40:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:40:22,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 05:40:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:40:22,684 INFO L225 Difference]: With dead ends: 19 [2018-11-10 05:40:22,684 INFO L226 Difference]: Without dead ends: 18 [2018-11-10 05:40:22,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:40:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-10 05:40:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 05:40:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 05:40:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-10 05:40:22,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-10 05:40:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:40:22,687 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-10 05:40:22,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:40:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-10 05:40:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 05:40:22,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:40:22,687 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:40:22,687 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:40:22,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:40:22,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2006151944, now seen corresponding path program 1 times [2018-11-10 05:40:22,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:40:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:40:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,689 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:40:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:40:22,706 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-10 05:40:22,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:40:22,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:40:22,706 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:40:22,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:40:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:40:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:40:22,707 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2018-11-10 05:40:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:40:22,719 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-10 05:40:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:40:22,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 05:40:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:40:22,720 INFO L225 Difference]: With dead ends: 20 [2018-11-10 05:40:22,720 INFO L226 Difference]: Without dead ends: 19 [2018-11-10 05:40:22,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:40:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-10 05:40:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-10 05:40:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 05:40:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-10 05:40:22,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2018-11-10 05:40:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:40:22,722 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 05:40:22,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:40:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-10 05:40:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 05:40:22,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:40:22,723 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:40:22,723 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 05:40:22,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:40:22,723 INFO L82 PathProgramCache]: Analyzing trace with hash -802592006, now seen corresponding path program 1 times [2018-11-10 05:40:22,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:40:22,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:40:22,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:40:22,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:40:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:40:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:40:22,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:40:22,743 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:40:22,743 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-10 05:40:22,744 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [18], [24], [25], [26], [28], [41], [42], [43] [2018-11-10 05:40:22,772 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:40:22,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:40:22,892 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:40:22,893 INFO L272 AbstractInterpreter]: Visited 12 different actions 44 times. Merged at 4 different actions 26 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-10 05:40:22,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:40:22,906 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:40:22,946 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 05:40:22,947 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:40:22,988 INFO L415 sIntCurrentIteration]: We unified 13 AI predicates to 13 [2018-11-10 05:40:22,989 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:40:22,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:40:22,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2018-11-10 05:40:22,990 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:40:22,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:40:22,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:40:22,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:40:22,990 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2018-11-10 05:40:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:40:23,115 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-10 05:40:23,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:40:23,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 05:40:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:40:23,115 INFO L225 Difference]: With dead ends: 21 [2018-11-10 05:40:23,115 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 05:40:23,116 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:40:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 05:40:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 05:40:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 05:40:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:40:23,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-11-10 05:40:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:40:23,117 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:40:23,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:40:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:40:23,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 05:40:23,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 05:40:23,192 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 05:40:23,192 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:40:23,192 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:40:23,192 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:40:23,192 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:40:23,192 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:40:23,192 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 25) no Hoare annotation was computed. [2018-11-10 05:40:23,192 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 21) no Hoare annotation was computed. [2018-11-10 05:40:23,192 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 23) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L421 ceAbstractionStarter]: At program point L19-3(lines 19 21) the Hoare annotation is: (let ((.cse0 (* 2 main_~y~0))) (and (<= main_~y~0 (+ main_~x~0 2147483646)) (<= (* 2 main_~x~0) 2147483646) (<= .cse0 4294967294) (<= 2 .cse0) (<= 0 main_~x~0))) [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point L19-4(lines 19 21) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L421 ceAbstractionStarter]: At program point L17-3(lines 17 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~x~0))) (and (<= 0 (+ .cse0 4294967296)) (<= .cse0 4294967294))) [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point L17-4(lines 17 23) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 25) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 25) the Hoare annotation is: true [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 05:40:23,193 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 05:40:23,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:40:23 BoogieIcfgContainer [2018-11-10 05:40:23,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:40:23,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:40:23,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:40:23,201 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:40:23,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:40:22" (3/4) ... [2018-11-10 05:40:23,205 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 05:40:23,210 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 05:40:23,210 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 05:40:23,213 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 05:40:23,214 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 05:40:23,214 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 05:40:23,239 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f78a3366-a2eb-47de-b928-0b8d6128214e/bin-2019/utaipan/witness.graphml [2018-11-10 05:40:23,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:40:23,240 INFO L168 Benchmark]: Toolchain (without parser) took 1313.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 960.2 MB in the beginning and 1.0 GB in the end (delta: -70.2 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:40:23,241 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:40:23,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:40:23,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.30 ms. Allocated memory is still 1.0 GB. Free memory is still 949.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:40:23,242 INFO L168 Benchmark]: Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.0 GB. Free memory is still 949.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:40:23,242 INFO L168 Benchmark]: RCFGBuilder took 180.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.7 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:40:23,243 INFO L168 Benchmark]: TraceAbstraction took 929.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:40:23,243 INFO L168 Benchmark]: Witness Printer took 39.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:40:23,245 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.30 ms. Allocated memory is still 1.0 GB. Free memory is still 949.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.0 GB. Free memory is still 949.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 180.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.7 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 929.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. * Witness Printer took 39.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 <= 2 * x + 4294967296 && 2 * x <= 4294967294 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((y <= x + 2147483646 && 2 * x <= 2147483646) && 2 * y <= 4294967294) && 2 <= 2 * y) && 0 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 4 error locations. SAFE Result, 0.8s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82 SDtfs, 47 SDslu, 37 SDs, 0 SdLazy, 36 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9807692307692307 AbsIntWeakeningRatio, 0.23076923076923078 AbsIntAvgWeakeningVarsNumRemoved, 1.3846153846153846 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 10 NumberOfFragments, 41 HoareAnnotationTreeSize, 6 FomulaSimplifications, 91 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 1045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...