./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/Avery-FLOPS2006-Table1_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_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/Avery-FLOPS2006-Table1_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/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 222b9e0025989dbea1cdc61cba66ae29f96b0141 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:54:04,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:54:04,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:54:04,764 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:54:04,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:54:04,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:54:04,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:54:04,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:54:04,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:54:04,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:54:04,769 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:54:04,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:54:04,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:54:04,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:54:04,772 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:54:04,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:54:04,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:54:04,774 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:54:04,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:54:04,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:54:04,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:54:04,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:54:04,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:54:04,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:54:04,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:54:04,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:54:04,781 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:54:04,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:54:04,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:54:04,783 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:54:04,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:54:04,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:54:04,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:54:04,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:54:04,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:54:04,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:54:04,786 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 03:54:04,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:54:04,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:54:04,796 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:54:04,796 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:54:04,797 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:54:04,797 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:54:04,797 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 03:54:04,797 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:54:04,797 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 03:54:04,797 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 03:54:04,797 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:54:04,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:54:04,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:54:04,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:54:04,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:54:04,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:54:04,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:54:04,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:54:04,799 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 03:54:04,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:54:04,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:54:04,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:54:04,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:54:04,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:54:04,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:54:04,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:54:04,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:54:04,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:54:04,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:54:04,801 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 03:54:04,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:54:04,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:54:04,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 03:54:04,801 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_92228d0f-49ce-4d24-880a-5e2aaffe655b/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 -> 222b9e0025989dbea1cdc61cba66ae29f96b0141 [2018-11-10 03:54:04,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:54:04,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:54:04,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:54:04,836 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:54:04,836 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:54:04,836 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/Avery-FLOPS2006-Table1_true-termination_true-no-overflow.c [2018-11-10 03:54:04,874 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/data/0d2a9f3ff/ec7ac6b2c67c4bd598de6923688d4fdf/FLAGab7ecf4de [2018-11-10 03:54:05,199 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:54:05,200 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/sv-benchmarks/c/termination-crafted-lit/Avery-FLOPS2006-Table1_true-termination_true-no-overflow.c [2018-11-10 03:54:05,204 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/data/0d2a9f3ff/ec7ac6b2c67c4bd598de6923688d4fdf/FLAGab7ecf4de [2018-11-10 03:54:05,214 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/data/0d2a9f3ff/ec7ac6b2c67c4bd598de6923688d4fdf [2018-11-10 03:54:05,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:54:05,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:54:05,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:54:05,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:54:05,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:54:05,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372d3e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05, skipping insertion in model container [2018-11-10 03:54:05,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:54:05,243 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:54:05,356 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:54:05,358 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:54:05,369 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:54:05,378 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:54:05,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05 WrapperNode [2018-11-10 03:54:05,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:54:05,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:54:05,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:54:05,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:54:05,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:54:05,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:54:05,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:54:05,393 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:54:05,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... [2018-11-10 03:54:05,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:54:05,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:54:05,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:54:05,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:54:05,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/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 03:54:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:54:05,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:54:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:54:05,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:54:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:54:05,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:54:05,641 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:54:05,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:54:05 BoogieIcfgContainer [2018-11-10 03:54:05,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:54:05,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:54:05,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:54:05,645 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:54:05,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:54:05" (1/3) ... [2018-11-10 03:54:05,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d15798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:54:05, skipping insertion in model container [2018-11-10 03:54:05,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:54:05" (2/3) ... [2018-11-10 03:54:05,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d15798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:54:05, skipping insertion in model container [2018-11-10 03:54:05,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:54:05" (3/3) ... [2018-11-10 03:54:05,649 INFO L112 eAbstractionObserver]: Analyzing ICFG Avery-FLOPS2006-Table1_true-termination_true-no-overflow.c [2018-11-10 03:54:05,659 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:54:05,666 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 03:54:05,682 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 03:54:05,712 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:54:05,713 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:54:05,713 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:54:05,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:54:05,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:54:05,713 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:54:05,713 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:54:05,713 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:54:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-10 03:54:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 03:54:05,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:05,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:05,739 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:05,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:05,745 INFO L82 PathProgramCache]: Analyzing trace with hash -134565603, now seen corresponding path program 1 times [2018-11-10 03:54:05,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:05,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:05,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:05,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:05,797 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:05,887 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 03:54:05,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:05,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:54:05,890 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:05,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:54:05,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:54:05,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:54:05,904 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-10 03:54:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:05,981 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-10 03:54:05,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:54:05,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-10 03:54:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:05,989 INFO L225 Difference]: With dead ends: 67 [2018-11-10 03:54:05,989 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 03:54:05,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:54:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 03:54:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2018-11-10 03:54:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 03:54:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 03:54:06,016 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 9 [2018-11-10 03:54:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:06,017 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 03:54:06,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:54:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-10 03:54:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 03:54:06,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:06,017 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:06,018 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:06,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash 123433654, now seen corresponding path program 1 times [2018-11-10 03:54:06,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:06,045 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 03:54:06,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:06,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:54:06,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:06,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:54:06,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:54:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:54:06,047 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 3 states. [2018-11-10 03:54:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:06,073 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-10 03:54:06,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:54:06,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 03:54:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:06,074 INFO L225 Difference]: With dead ends: 25 [2018-11-10 03:54:06,074 INFO L226 Difference]: Without dead ends: 24 [2018-11-10 03:54:06,075 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 03:54:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-10 03:54:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-10 03:54:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 03:54:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-10 03:54:06,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 10 [2018-11-10 03:54:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:06,079 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-10 03:54:06,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:54:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-10 03:54:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 03:54:06,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:06,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:06,080 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:06,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash -468523969, now seen corresponding path program 1 times [2018-11-10 03:54:06,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:06,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:06,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,081 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:06,096 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 03:54:06,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:06,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:54:06,096 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:06,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:54:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:54:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:54:06,097 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-11-10 03:54:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:06,150 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-10 03:54:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:54:06,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 03:54:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:06,152 INFO L225 Difference]: With dead ends: 40 [2018-11-10 03:54:06,152 INFO L226 Difference]: Without dead ends: 38 [2018-11-10 03:54:06,152 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 03:54:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-10 03:54:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-10 03:54:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 03:54:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 03:54:06,157 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2018-11-10 03:54:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:06,157 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 03:54:06,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:54:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-10 03:54:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 03:54:06,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:06,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:06,158 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:06,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:06,159 INFO L82 PathProgramCache]: Analyzing trace with hash -468571507, now seen corresponding path program 1 times [2018-11-10 03:54:06,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:06,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:06,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:06,182 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 03:54:06,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:06,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:54:06,183 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:06,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:54:06,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:54:06,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:54:06,184 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 4 states. [2018-11-10 03:54:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:06,228 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-10 03:54:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:54:06,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-10 03:54:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:06,229 INFO L225 Difference]: With dead ends: 38 [2018-11-10 03:54:06,229 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 03:54:06,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:54:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 03:54:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 03:54:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 03:54:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-10 03:54:06,233 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 11 [2018-11-10 03:54:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:06,233 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-10 03:54:06,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:54:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-10 03:54:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 03:54:06,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:06,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:06,234 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:06,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1639341096, now seen corresponding path program 1 times [2018-11-10 03:54:06,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:06,255 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 03:54:06,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:06,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:54:06,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:06,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:54:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:54:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:54:06,256 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 3 states. [2018-11-10 03:54:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:06,272 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-10 03:54:06,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:54:06,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 03:54:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:06,273 INFO L225 Difference]: With dead ends: 38 [2018-11-10 03:54:06,273 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 03:54:06,274 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 03:54:06,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 03:54:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-10 03:54:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 03:54:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-10 03:54:06,280 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 12 [2018-11-10 03:54:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:06,281 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-10 03:54:06,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:54:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-10 03:54:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 03:54:06,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:06,281 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:06,282 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:06,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:06,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2144148843, now seen corresponding path program 1 times [2018-11-10 03:54:06,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:06,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,284 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:06,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:06,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:54:06,323 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-10 03:54:06,324 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [17], [19], [21], [22], [23], [25], [54], [55], [56] [2018-11-10 03:54:06,358 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:54:06,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:54:06,529 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:54:06,531 INFO L272 AbstractInterpreter]: Visited 13 different actions 62 times. Merged at 6 different actions 42 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 03:54:06,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:06,538 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:54:06,602 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 52.27% of their original sizes. [2018-11-10 03:54:06,603 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:54:06,671 INFO L415 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2018-11-10 03:54:06,671 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:54:06,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:54:06,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2018-11-10 03:54:06,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:06,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 03:54:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:54:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:54:06,672 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-10 03:54:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:06,934 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-10 03:54:06,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:54:06,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-10 03:54:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:06,935 INFO L225 Difference]: With dead ends: 36 [2018-11-10 03:54:06,935 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 03:54:06,935 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:54:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 03:54:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-10 03:54:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 03:54:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-10 03:54:06,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2018-11-10 03:54:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:06,943 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 03:54:06,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 03:54:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-10 03:54:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 03:54:06,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:06,944 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:06,945 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:06,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:06,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2144196381, now seen corresponding path program 1 times [2018-11-10 03:54:06,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:06,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:06,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:54:06,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:54:06,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:54:06,971 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:06,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:54:06,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:54:06,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:54:06,971 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2018-11-10 03:54:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:06,991 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-10 03:54:06,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:54:06,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-10 03:54:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:06,991 INFO L225 Difference]: With dead ends: 31 [2018-11-10 03:54:06,992 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 03:54:06,992 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 03:54:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 03:54:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 03:54:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 03:54:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-10 03:54:06,996 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2018-11-10 03:54:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:06,996 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-10 03:54:06,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:54:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-10 03:54:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 03:54:06,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:06,997 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:06,997 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:06,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1011582213, now seen corresponding path program 1 times [2018-11-10 03:54:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:06,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:54:07,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:07,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:54:07,024 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 03:54:07,024 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [15], [17], [19], [21], [23], [25], [31], [37], [39], [41], [42], [54], [55], [56] [2018-11-10 03:54:07,025 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:54:07,025 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:54:07,104 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:54:07,104 INFO L272 AbstractInterpreter]: Visited 18 different actions 97 times. Merged at 11 different actions 72 times. Widened at 2 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 03:54:07,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:07,120 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:54:07,148 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 32.69% of their original sizes. [2018-11-10 03:54:07,148 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:54:07,261 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-10 03:54:07,262 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:54:07,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:54:07,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [3] total 10 [2018-11-10 03:54:07,262 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:07,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:54:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:54:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:54:07,263 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-10 03:54:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:07,578 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-10 03:54:07,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:54:07,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-10 03:54:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:07,579 INFO L225 Difference]: With dead ends: 33 [2018-11-10 03:54:07,579 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 03:54:07,580 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:54:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 03:54:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 03:54:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 03:54:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-10 03:54:07,585 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 19 [2018-11-10 03:54:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:07,585 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 03:54:07,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:54:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-10 03:54:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 03:54:07,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:54:07,586 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:54:07,587 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 03:54:07,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1902804921, now seen corresponding path program 1 times [2018-11-10 03:54:07,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:54:07,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:07,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:54:07,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:54:07,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:54:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:54:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:54:07,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:54:07,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:54:07,621 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-10 03:54:07,621 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [15], [17], [19], [21], [23], [25], [31], [37], [38], [39], [41], [43], [45], [54], [55], [56] [2018-11-10 03:54:07,622 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:54:07,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:54:07,744 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:54:07,744 INFO L272 AbstractInterpreter]: Visited 20 different actions 213 times. Merged at 13 different actions 166 times. Widened at 3 different actions 20 times. Found 8 fixpoints after 3 different actions. Largest state had 6 variables. [2018-11-10 03:54:07,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:54:07,746 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:54:07,772 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 30.88% of their original sizes. [2018-11-10 03:54:07,772 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:54:07,886 INFO L415 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2018-11-10 03:54:07,887 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:54:07,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:54:07,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [3] total 12 [2018-11-10 03:54:07,887 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:54:07,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 03:54:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:54:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:54:07,889 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2018-11-10 03:54:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:54:08,248 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-10 03:54:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 03:54:08,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-10 03:54:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:54:08,248 INFO L225 Difference]: With dead ends: 32 [2018-11-10 03:54:08,249 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:54:08,249 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:54:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:54:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:54:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:54:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:54:08,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-10 03:54:08,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:54:08,250 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:54:08,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 03:54:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:54:08,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:54:08,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:54:08,469 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 30 [2018-11-10 03:54:08,470 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 03:54:08,470 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:54:08,470 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:54:08,470 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 03:54:08,471 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 28) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 31) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point L25-2(lines 20 29) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-10 03:54:08,471 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 24) no Hoare annotation was computed. [2018-11-10 03:54:08,472 INFO L421 ceAbstractionStarter]: At program point L21-3(lines 21 24) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0))) (or (let ((.cse0 (+ main_~y~0 main_~z~0))) (and (= main_~z~0 0) (<= 1 .cse0) (<= main_~i~0 main_~x~0) (<= 2 .cse1) (<= .cse0 2147483647) (<= (* 2 main_~x~0) 4294967294))) (let ((.cse2 (* 2 main_~y~0))) (and (<= .cse1 4294967292) (<= 0 .cse1) (<= .cse2 4294967294) (<= 2 .cse2) (<= 0 main_~z~0) (<= (+ main_~i~0 main_~z~0) 2147483647))))) [2018-11-10 03:54:08,472 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-10 03:54:08,472 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2018-11-10 03:54:08,472 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 31) no Hoare annotation was computed. [2018-11-10 03:54:08,472 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 03:54:08,472 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 03:54:08,472 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 31) the Hoare annotation is: true [2018-11-10 03:54:08,472 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-10 03:54:08,472 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-10 03:54:08,473 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 03:54:08,473 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 03:54:08,473 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 29) no Hoare annotation was computed. [2018-11-10 03:54:08,473 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 29) no Hoare annotation was computed. [2018-11-10 03:54:08,473 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2018-11-10 03:54:08,473 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-10 03:54:08,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:54:08 BoogieIcfgContainer [2018-11-10 03:54:08,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:54:08,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:54:08,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:54:08,482 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:54:08,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:54:05" (3/4) ... [2018-11-10 03:54:08,485 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:54:08,488 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:54:08,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:54:08,491 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 03:54:08,491 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 03:54:08,492 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 03:54:08,492 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 03:54:08,525 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_92228d0f-49ce-4d24-880a-5e2aaffe655b/bin-2019/utaipan/witness.graphml [2018-11-10 03:54:08,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:54:08,526 INFO L168 Benchmark]: Toolchain (without parser) took 3308.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 961.8 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:54:08,526 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:54:08,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.11 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:54:08,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.75 ms. Allocated memory is still 1.0 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:54:08,527 INFO L168 Benchmark]: Boogie Preprocessor took 19.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 945.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:54:08,528 INFO L168 Benchmark]: RCFGBuilder took 228.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:54:08,528 INFO L168 Benchmark]: TraceAbstraction took 2839.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.2 MB). Peak memory consumption was 62.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:54:08,528 INFO L168 Benchmark]: Witness Printer took 43.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:54:08,531 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 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.11 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 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 13.75 ms. Allocated memory is still 1.0 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 945.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2839.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.2 MB). Peak memory consumption was 62.3 MB. Max. memory is 11.5 GB. * Witness Printer took 43.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: 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 8 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((z == 0 && 1 <= y + z) && i <= x) && 2 <= 2 * i) && y + z <= 2147483647) && 2 * x <= 4294967294) || (((((2 * i <= 4294967292 && 0 <= 2 * i) && 2 * y <= 4294967294) && 2 <= 2 * y) && 0 <= z) && i + z <= 2147483647) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 8 error locations. SAFE Result, 2.7s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 125 SDslu, 213 SDs, 0 SdLazy, 260 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.21428571428571427 AbsIntAvgWeakeningVarsNumRemoved, 13.607142857142858 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 6 NumberOfFragments, 61 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 311 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 3632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...