./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_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/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_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/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-10-27 05:46:07,778 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:46:07,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:46:07,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:46:07,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:46:07,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:46:07,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:46:07,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:46:07,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:46:07,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:46:07,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:46:07,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:46:07,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:46:07,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:46:07,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:46:07,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:46:07,814 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:46:07,815 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:46:07,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:46:07,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:46:07,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:46:07,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:46:07,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:46:07,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:46:07,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:46:07,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:46:07,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:46:07,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:46:07,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:46:07,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:46:07,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:46:07,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:46:07,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:46:07,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:46:07,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:46:07,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:46:07,831 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-10-27 05:46:07,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:46:07,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:46:07,845 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:46:07,845 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 05:46:07,845 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 05:46:07,845 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 05:46:07,845 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 05:46:07,846 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 05:46:07,846 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 05:46:07,846 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 05:46:07,846 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 05:46:07,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:46:07,847 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:46:07,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:46:07,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:46:07,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:46:07,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:46:07,849 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:46:07,849 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:46:07,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:46:07,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:46:07,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:46:07,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:46:07,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:46:07,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:46:07,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:46:07,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:46:07,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:46:07,851 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:46:07,851 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 05:46:07,851 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:46:07,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:46:07,852 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 05:46:07,852 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_7956155c-31a6-46ab-b1f7-f092273b84da/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-10-27 05:46:07,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:46:07,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:46:07,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:46:07,901 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:46:07,902 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:46:07,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/Avery-FLOPS2006-Table1_true-termination_true-no-overflow.c [2018-10-27 05:46:07,955 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/data/369091562/2950a6a5fa684d4c8de7d99b29e59d76/FLAG9f6f3ac2d [2018-10-27 05:46:08,324 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:46:08,325 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/sv-benchmarks/c/termination-crafted-lit/Avery-FLOPS2006-Table1_true-termination_true-no-overflow.c [2018-10-27 05:46:08,332 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/data/369091562/2950a6a5fa684d4c8de7d99b29e59d76/FLAG9f6f3ac2d [2018-10-27 05:46:08,345 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/data/369091562/2950a6a5fa684d4c8de7d99b29e59d76 [2018-10-27 05:46:08,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:46:08,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 05:46:08,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:46:08,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:46:08,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:46:08,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140b7b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08, skipping insertion in model container [2018-10-27 05:46:08,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:46:08,387 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:46:08,528 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:46:08,531 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:46:08,544 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:46:08,556 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:46:08,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08 WrapperNode [2018-10-27 05:46:08,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:46:08,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 05:46:08,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 05:46:08,558 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 05:46:08,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 05:46:08,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:46:08,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:46:08,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:46:08,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... [2018-10-27 05:46:08,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:46:08,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:46:08,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:46:08,599 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:46:08,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/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-10-27 05:46:08,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:46:08,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:46:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:46:08,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:46:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:46:08,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:46:09,250 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:46:09,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:46:09 BoogieIcfgContainer [2018-10-27 05:46:09,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:46:09,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:46:09,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:46:09,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:46:09,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:46:08" (1/3) ... [2018-10-27 05:46:09,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4638c7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:46:09, skipping insertion in model container [2018-10-27 05:46:09,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:46:08" (2/3) ... [2018-10-27 05:46:09,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4638c7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:46:09, skipping insertion in model container [2018-10-27 05:46:09,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:46:09" (3/3) ... [2018-10-27 05:46:09,262 INFO L112 eAbstractionObserver]: Analyzing ICFG Avery-FLOPS2006-Table1_true-termination_true-no-overflow.c [2018-10-27 05:46:09,271 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:46:09,279 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-27 05:46:09,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-27 05:46:09,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:46:09,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:46:09,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:46:09,327 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:46:09,327 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:46:09,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:46:09,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:46:09,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:46:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-27 05:46:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 05:46:09,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:09,367 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:09,369 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:09,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -134565603, now seen corresponding path program 1 times [2018-10-27 05:46:09,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:09,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:09,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:09,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:09,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:46:09,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:46:09,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:46:09,700 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:09,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:46:09,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:46:09,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:46:09,717 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-10-27 05:46:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:09,905 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-10-27 05:46:09,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:46:09,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-10-27 05:46:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:09,916 INFO L225 Difference]: With dead ends: 67 [2018-10-27 05:46:09,916 INFO L226 Difference]: Without dead ends: 40 [2018-10-27 05:46:09,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:46:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-27 05:46:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2018-10-27 05:46:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 05:46:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-10-27 05:46:09,953 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 9 [2018-10-27 05:46:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:09,954 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-10-27 05:46:09,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:46:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-10-27 05:46:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-27 05:46:09,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:09,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:09,955 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:09,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash 123433654, now seen corresponding path program 1 times [2018-10-27 05:46:09,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:09,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:09,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:46:10,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:46:10,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:46:10,005 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:10,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:46:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:46:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:46:10,007 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 3 states. [2018-10-27 05:46:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:10,059 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-10-27 05:46:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:46:10,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-27 05:46:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:10,061 INFO L225 Difference]: With dead ends: 25 [2018-10-27 05:46:10,061 INFO L226 Difference]: Without dead ends: 24 [2018-10-27 05:46:10,062 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-10-27 05:46:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-27 05:46:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-27 05:46:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 05:46:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-10-27 05:46:10,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 10 [2018-10-27 05:46:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:10,066 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-10-27 05:46:10,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:46:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-10-27 05:46:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 05:46:10,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:10,067 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:10,068 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:10,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash -468523969, now seen corresponding path program 1 times [2018-10-27 05:46:10,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:10,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:10,070 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:46:10,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:46:10,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:46:10,113 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:10,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:46:10,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:46:10,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:46:10,114 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-10-27 05:46:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:10,201 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-10-27 05:46:10,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:46:10,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-27 05:46:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:10,203 INFO L225 Difference]: With dead ends: 40 [2018-10-27 05:46:10,203 INFO L226 Difference]: Without dead ends: 38 [2018-10-27 05:46:10,203 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-10-27 05:46:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-27 05:46:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-10-27 05:46:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 05:46:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 05:46:10,211 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2018-10-27 05:46:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:10,212 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 05:46:10,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:46:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-10-27 05:46:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 05:46:10,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:10,213 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:10,213 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:10,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash -468571507, now seen corresponding path program 1 times [2018-10-27 05:46:10,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:10,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:10,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:46:10,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:46:10,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:46:10,356 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:10,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:46:10,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:46:10,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:46:10,357 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 4 states. [2018-10-27 05:46:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:10,445 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-10-27 05:46:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:46:10,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-10-27 05:46:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:10,447 INFO L225 Difference]: With dead ends: 38 [2018-10-27 05:46:10,447 INFO L226 Difference]: Without dead ends: 29 [2018-10-27 05:46:10,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:46:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-27 05:46:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-27 05:46:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 05:46:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-10-27 05:46:10,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 11 [2018-10-27 05:46:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:10,452 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-10-27 05:46:10,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:46:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-10-27 05:46:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 05:46:10,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:10,453 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:10,454 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:10,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:10,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1639341096, now seen corresponding path program 1 times [2018-10-27 05:46:10,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:10,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:10,456 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:46:10,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:46:10,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:46:10,488 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:10,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:46:10,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:46:10,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:46:10,489 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 3 states. [2018-10-27 05:46:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:10,583 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-10-27 05:46:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:46:10,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-27 05:46:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:10,584 INFO L225 Difference]: With dead ends: 38 [2018-10-27 05:46:10,584 INFO L226 Difference]: Without dead ends: 36 [2018-10-27 05:46:10,585 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-10-27 05:46:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-27 05:46:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-27 05:46:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-27 05:46:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-10-27 05:46:10,591 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 12 [2018-10-27 05:46:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:10,591 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-10-27 05:46:10,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:46:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-10-27 05:46:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 05:46:10,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:10,592 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:10,593 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:10,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2144148843, now seen corresponding path program 1 times [2018-10-27 05:46:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:10,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:10,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:10,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:46:10,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:10,677 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:10,678 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-10-27 05:46:10,679 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [17], [19], [21], [22], [23], [25], [54], [55], [56] [2018-10-27 05:46:10,724 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:46:10,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:46:10,946 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:46:10,947 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-10-27 05:46:10,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:10,955 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:46:11,029 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 52.27% of their original sizes. [2018-10-27 05:46:11,029 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:46:11,230 INFO L415 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2018-10-27 05:46:11,230 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:46:11,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:46:11,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2018-10-27 05:46:11,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:11,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:46:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:46:11,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:46:11,232 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-10-27 05:46:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:11,739 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-10-27 05:46:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:46:11,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-10-27 05:46:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:11,740 INFO L225 Difference]: With dead ends: 36 [2018-10-27 05:46:11,740 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 05:46:11,740 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:46:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 05:46:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-10-27 05:46:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 05:46:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-10-27 05:46:11,748 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2018-10-27 05:46:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:11,748 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-10-27 05:46:11,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:46:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-10-27 05:46:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 05:46:11,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:11,749 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:11,749 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:11,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2144196381, now seen corresponding path program 1 times [2018-10-27 05:46:11,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:11,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:11,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:11,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:11,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:46:11,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:46:11,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:46:11,797 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:11,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:46:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:46:11,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:46:11,798 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2018-10-27 05:46:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:11,832 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-10-27 05:46:11,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:46:11,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-27 05:46:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:11,833 INFO L225 Difference]: With dead ends: 31 [2018-10-27 05:46:11,834 INFO L226 Difference]: Without dead ends: 30 [2018-10-27 05:46:11,834 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-10-27 05:46:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-27 05:46:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-27 05:46:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 05:46:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-10-27 05:46:11,840 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2018-10-27 05:46:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:11,841 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-27 05:46:11,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:46:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-10-27 05:46:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 05:46:11,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:11,842 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:46:11,842 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:11,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:11,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1011582213, now seen corresponding path program 1 times [2018-10-27 05:46:11,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:11,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:11,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:11,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:11,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:46:11,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:11,952 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:11,953 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-10-27 05:46:11,953 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [15], [17], [19], [21], [23], [25], [31], [37], [39], [41], [42], [54], [55], [56] [2018-10-27 05:46:11,954 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:46:11,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:46:12,051 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:46:12,051 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-10-27 05:46:12,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:12,075 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:46:12,117 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 32.69% of their original sizes. [2018-10-27 05:46:12,117 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:46:12,368 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-10-27 05:46:12,368 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:46:12,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:46:12,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [3] total 10 [2018-10-27 05:46:12,369 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:12,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:46:12,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:46:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:46:12,370 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-10-27 05:46:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:13,234 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-10-27 05:46:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:46:13,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-27 05:46:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:13,235 INFO L225 Difference]: With dead ends: 33 [2018-10-27 05:46:13,235 INFO L226 Difference]: Without dead ends: 32 [2018-10-27 05:46:13,236 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:46:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-27 05:46:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-27 05:46:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 05:46:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-27 05:46:13,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 19 [2018-10-27 05:46:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:13,244 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-27 05:46:13,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:46:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-27 05:46:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 05:46:13,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:46:13,245 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-10-27 05:46:13,245 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:46:13,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1902804921, now seen corresponding path program 1 times [2018-10-27 05:46:13,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:46:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:13,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:46:13,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:46:13,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:46:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:46:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:46:13,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:46:13,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:46:13,309 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-27 05:46:13,309 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [11], [15], [17], [19], [21], [23], [25], [31], [37], [38], [39], [41], [43], [45], [54], [55], [56] [2018-10-27 05:46:13,311 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:46:13,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:46:13,508 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:46:13,508 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-10-27 05:46:13,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:46:13,515 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:46:13,547 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 30.88% of their original sizes. [2018-10-27 05:46:13,547 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:46:13,913 INFO L415 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2018-10-27 05:46:13,913 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:46:13,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:46:13,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [3] total 12 [2018-10-27 05:46:13,913 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:46:13,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 05:46:13,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 05:46:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:46:13,914 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2018-10-27 05:46:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:46:14,558 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-10-27 05:46:14,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 05:46:14,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-10-27 05:46:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:46:14,558 INFO L225 Difference]: With dead ends: 32 [2018-10-27 05:46:14,559 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 05:46:14,559 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:46:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 05:46:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 05:46:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 05:46:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 05:46:14,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-10-27 05:46:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:46:14,560 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 05:46:14,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 05:46:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 05:46:14,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 05:46:14,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 05:46:15,202 WARN L179 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 30 [2018-10-27 05:46:15,203 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 05:46:15,203 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:46:15,204 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:46:15,204 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 05:46:15,204 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 05:46:15,204 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 05:46:15,204 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-10-27 05:46:15,204 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-27 05:46:15,204 INFO L425 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-10-27 05:46:15,204 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 28) no Hoare annotation was computed. [2018-10-27 05:46:15,204 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 31) no Hoare annotation was computed. [2018-10-27 05:46:15,204 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-10-27 05:46:15,205 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-10-27 05:46:15,205 INFO L425 ceAbstractionStarter]: For program point L25-2(lines 20 29) no Hoare annotation was computed. [2018-10-27 05:46:15,205 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-10-27 05:46:15,205 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 24) no Hoare annotation was computed. [2018-10-27 05:46:15,205 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2018-10-27 05:46:15,205 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-10-27 05:46:15,205 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-10-27 05:46:15,205 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 31) no Hoare annotation was computed. [2018-10-27 05:46:15,205 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 31) the Hoare annotation is: true [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 29) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 29) no Hoare annotation was computed. [2018-10-27 05:46:15,206 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-10-27 05:46:15,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:46:15 BoogieIcfgContainer [2018-10-27 05:46:15,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:46:15,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:46:15,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:46:15,218 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:46:15,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:46:09" (3/4) ... [2018-10-27 05:46:15,224 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 05:46:15,230 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 05:46:15,230 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 05:46:15,235 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-27 05:46:15,236 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-27 05:46:15,236 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:46:15,236 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:46:15,278 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7956155c-31a6-46ab-b1f7-f092273b84da/bin-2019/utaipan/witness.graphml [2018-10-27 05:46:15,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:46:15,279 INFO L168 Benchmark]: Toolchain (without parser) took 6930.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 963.4 MB in the beginning and 1.0 GB in the end (delta: -39.5 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:15,280 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:46:15,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.78 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:15,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.95 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:46:15,281 INFO L168 Benchmark]: Boogie Preprocessor took 18.92 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 947.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:15,282 INFO L168 Benchmark]: RCFGBuilder took 653.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:15,282 INFO L168 Benchmark]: TraceAbstraction took 5962.89 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: 133.7 MB). Peak memory consumption was 133.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:15,282 INFO L168 Benchmark]: Witness Printer took 60.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-10-27 05:46:15,288 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 206.78 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 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 20.95 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.92 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 947.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 653.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5962.89 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: 133.7 MB). Peak memory consumption was 133.7 MB. Max. memory is 11.5 GB. * Witness Printer took 60.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 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 - 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 - 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, 5.8s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 125 SDslu, 213 SDs, 0 SdLazy, 260 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s 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.6s 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.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s 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...