./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/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 4c761fb15c9d367876fc9f1553874e9680fa1668 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:29:39,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:29:39,197 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:29:39,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:29:39,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:29:39,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:29:39,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:29:39,207 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:29:39,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:29:39,209 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:29:39,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:29:39,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:29:39,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:29:39,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:29:39,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:29:39,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:29:39,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:29:39,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:29:39,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:29:39,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:29:39,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:29:39,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:29:39,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:29:39,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:29:39,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:29:39,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:29:39,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:29:39,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:29:39,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:29:39,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:29:39,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:29:39,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:29:39,221 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:29:39,221 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:29:39,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:29:39,222 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:29:39,222 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-02 14:29:39,231 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:29:39,231 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:29:39,231 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:29:39,232 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:29:39,232 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:29:39,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:29:39,233 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:29:39,233 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:29:39,233 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:29:39,233 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:29:39,233 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:29:39,233 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:29:39,233 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-02 14:29:39,234 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:29:39,234 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:29:39,234 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:29:39,234 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:29:39,234 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:29:39,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:29:39,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:29:39,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:29:39,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:29:39,235 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:29:39,235 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:29:39,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:29:39,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:29:39,235 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:29:39,235 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_db9a0105-eb56-48d3-b6de-81371b4a0ba5/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 -> 4c761fb15c9d367876fc9f1553874e9680fa1668 [2018-12-02 14:29:39,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:29:39,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:29:39,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:29:39,268 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:29:39,269 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:29:39,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-12-02 14:29:39,310 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/data/0c28e31bd/a9765de0ae1a4cdeb7c40b3a1c84f46a/FLAG77ba1aa75 [2018-12-02 14:29:39,727 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:29:39,728 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-12-02 14:29:39,731 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/data/0c28e31bd/a9765de0ae1a4cdeb7c40b3a1c84f46a/FLAG77ba1aa75 [2018-12-02 14:29:39,739 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/data/0c28e31bd/a9765de0ae1a4cdeb7c40b3a1c84f46a [2018-12-02 14:29:39,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:29:39,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:29:39,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:29:39,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:29:39,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:29:39,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432dabb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39, skipping insertion in model container [2018-12-02 14:29:39,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:29:39,758 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:29:39,845 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:29:39,847 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:29:39,856 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:29:39,863 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:29:39,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39 WrapperNode [2018-12-02 14:29:39,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:29:39,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:29:39,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:29:39,864 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:29:39,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:29:39,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:29:39,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:29:39,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:29:39,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... [2018-12-02 14:29:39,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:29:39,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:29:39,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:29:39,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:29:39,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:29:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:29:39,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:29:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:29:39,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:29:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:29:39,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:29:40,040 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:29:40,041 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:29:40,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:29:40 BoogieIcfgContainer [2018-12-02 14:29:40,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:29:40,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:29:40,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:29:40,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:29:40,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:29:39" (1/3) ... [2018-12-02 14:29:40,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5f6584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:29:40, skipping insertion in model container [2018-12-02 14:29:40,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:29:39" (2/3) ... [2018-12-02 14:29:40,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5f6584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:29:40, skipping insertion in model container [2018-12-02 14:29:40,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:29:40" (3/3) ... [2018-12-02 14:29:40,045 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-12-02 14:29:40,052 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:29:40,056 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-12-02 14:29:40,066 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-12-02 14:29:40,085 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:29:40,086 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:29:40,086 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:29:40,086 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:29:40,086 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:29:40,086 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:29:40,086 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:29:40,086 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:29:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-12-02 14:29:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 14:29:40,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1587377884, now seen corresponding path program 1 times [2018-12-02 14:29:40,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:29:40,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:29:40,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:29:40,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:29:40,215 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-12-02 14:29:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,281 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-12-02 14:29:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:29:40,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-02 14:29:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,287 INFO L225 Difference]: With dead ends: 57 [2018-12-02 14:29:40,288 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 14:29:40,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-02 14:29:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 14:29:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2018-12-02 14:29:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 14:29:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-02 14:29:40,311 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 7 [2018-12-02 14:29:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,311 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-02 14:29:40,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:29:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-02 14:29:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 14:29:40,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,312 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1964074193, now seen corresponding path program 1 times [2018-12-02 14:29:40,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:29:40,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:29:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:29:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:29:40,337 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2018-12-02 14:29:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,403 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-12-02 14:29:40,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:29:40,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-02 14:29:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,404 INFO L225 Difference]: With dead ends: 51 [2018-12-02 14:29:40,404 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 14:29:40,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-02 14:29:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 14:29:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-12-02 14:29:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 14:29:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-12-02 14:29:40,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 8 [2018-12-02 14:29:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,409 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-02 14:29:40,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:29:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-12-02 14:29:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 14:29:40,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,410 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,410 INFO L82 PathProgramCache]: Analyzing trace with hash 290934591, now seen corresponding path program 1 times [2018-12-02 14:29:40,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:29:40,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:29:40,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:29:40,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:29:40,430 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-12-02 14:29:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,463 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-12-02 14:29:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:29:40,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-02 14:29:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,464 INFO L225 Difference]: With dead ends: 64 [2018-12-02 14:29:40,464 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 14:29:40,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 14:29:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 14:29:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-12-02 14:29:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 14:29:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-02 14:29:40,469 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2018-12-02 14:29:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,469 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-02 14:29:40,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:29:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-02 14:29:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 14:29:40,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,470 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,470 INFO L82 PathProgramCache]: Analyzing trace with hash 290934783, now seen corresponding path program 1 times [2018-12-02 14:29:40,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:29:40,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:29:40,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:29:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:29:40,503 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-12-02 14:29:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,542 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-12-02 14:29:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:29:40,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-02 14:29:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,543 INFO L225 Difference]: With dead ends: 54 [2018-12-02 14:29:40,543 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 14:29:40,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:29:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 14:29:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2018-12-02 14:29:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 14:29:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-12-02 14:29:40,547 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 12 [2018-12-02 14:29:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,547 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-12-02 14:29:40,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:29:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-12-02 14:29:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 14:29:40,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,548 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,548 INFO L82 PathProgramCache]: Analyzing trace with hash 429043754, now seen corresponding path program 1 times [2018-12-02 14:29:40,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:29:40,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:29:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:29:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:29:40,560 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 3 states. [2018-12-02 14:29:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,573 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-12-02 14:29:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:29:40,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 14:29:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,574 INFO L225 Difference]: With dead ends: 46 [2018-12-02 14:29:40,574 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 14:29:40,574 INFO L631 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-12-02 14:29:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 14:29:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 14:29:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 14:29:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-02 14:29:40,578 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 13 [2018-12-02 14:29:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,578 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-02 14:29:40,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:29:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-12-02 14:29:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:29:40,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,579 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash 464866939, now seen corresponding path program 1 times [2018-12-02 14:29:40,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:29:40,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:29:40,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:29:40,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:29:40,611 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 5 states. [2018-12-02 14:29:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,666 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2018-12-02 14:29:40,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:29:40,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 14:29:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,667 INFO L225 Difference]: With dead ends: 95 [2018-12-02 14:29:40,667 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 14:29:40,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:29:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 14:29:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2018-12-02 14:29:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 14:29:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2018-12-02 14:29:40,675 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 14 [2018-12-02 14:29:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,675 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2018-12-02 14:29:40,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:29:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2018-12-02 14:29:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:29:40,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,676 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,676 INFO L82 PathProgramCache]: Analyzing trace with hash 464867131, now seen corresponding path program 1 times [2018-12-02 14:29:40,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:29:40,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:29:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:29:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:29:40,696 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand 4 states. [2018-12-02 14:29:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,713 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2018-12-02 14:29:40,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:29:40,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-02 14:29:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,714 INFO L225 Difference]: With dead ends: 115 [2018-12-02 14:29:40,714 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 14:29:40,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 14:29:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 14:29:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-12-02 14:29:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 14:29:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-12-02 14:29:40,719 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 14 [2018-12-02 14:29:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,719 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-12-02 14:29:40,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:29:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-12-02 14:29:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 14:29:40,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,720 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,720 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash -5811444, now seen corresponding path program 1 times [2018-12-02 14:29:40,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:29:40,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:29:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:29:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:29:40,746 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 5 states. [2018-12-02 14:29:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,788 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-02 14:29:40,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:29:40,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-02 14:29:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,789 INFO L225 Difference]: With dead ends: 62 [2018-12-02 14:29:40,789 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 14:29:40,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:29:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 14:29:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 14:29:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 14:29:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-02 14:29:40,791 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2018-12-02 14:29:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,791 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-02 14:29:40,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:29:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-02 14:29:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 14:29:40,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,792 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1525973288, now seen corresponding path program 1 times [2018-12-02 14:29:40,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:29:40,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:29:40,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:29:40,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:29:40,807 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2018-12-02 14:29:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,818 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-02 14:29:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:29:40,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-02 14:29:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,819 INFO L225 Difference]: With dead ends: 28 [2018-12-02 14:29:40,820 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 14:29:40,820 INFO L631 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-12-02 14:29:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 14:29:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 14:29:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 14:29:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-02 14:29:40,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 15 [2018-12-02 14:29:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,822 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-02 14:29:40,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:29:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-02 14:29:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 14:29:40,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:29:40,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:29:40,823 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:29:40,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:29:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash 60531715, now seen corresponding path program 1 times [2018-12-02 14:29:40,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:29:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:29:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:29:40,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:29:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:29:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:29:40,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:29:40,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:29:40,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:29:40,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:29:40,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:29:40,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:29:40,847 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-12-02 14:29:40,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:29:40,882 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-12-02 14:29:40,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:29:40,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 14:29:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:29:40,883 INFO L225 Difference]: With dead ends: 32 [2018-12-02 14:29:40,883 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 14:29:40,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:29:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 14:29:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 14:29:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 14:29:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 14:29:40,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-12-02 14:29:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:29:40,885 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:29:40,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:29:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:29:40,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 14:29:40,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 14:29:40,919 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 14:29:40,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:29:40,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 14:29:40,920 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 13 27) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 25) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (<= main_~x~0 2147483647) (<= main_~y~0 2147483647) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 25) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 13 27) no Hoare annotation was computed. [2018-12-02 14:29:40,920 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 13 27) the Hoare annotation is: true [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L18-4(line 18) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L18-5(line 18) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point L18-6(lines 18 24) no Hoare annotation was computed. [2018-12-02 14:29:40,921 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-12-02 14:29:40,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:29:40 BoogieIcfgContainer [2018-12-02 14:29:40,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:29:40,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:29:40,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:29:40,929 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:29:40,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:29:40" (3/4) ... [2018-12-02 14:29:40,932 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 14:29:40,936 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 14:29:40,936 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 14:29:40,938 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 14:29:40,938 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 14:29:40,938 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 14:29:40,963 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_db9a0105-eb56-48d3-b6de-81371b4a0ba5/bin-2019/utaipan/witness.graphml [2018-12-02 14:29:40,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:29:40,964 INFO L168 Benchmark]: Toolchain (without parser) took 1222.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 957.1 MB in the beginning and 927.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 132.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:29:40,964 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:29:40,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 122.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:29:40,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.56 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:29:40,965 INFO L168 Benchmark]: Boogie Preprocessor took 11.64 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:29:40,965 INFO L168 Benchmark]: RCFGBuilder took 153.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 14:29:40,966 INFO L168 Benchmark]: TraceAbstraction took 887.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 927.6 MB in the end (delta: 162.1 MB). Peak memory consumption was 162.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:29:40,966 INFO L168 Benchmark]: Witness Printer took 34.13 ms. Allocated memory is still 1.1 GB. Free memory is still 927.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:29:40,967 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 122.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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 11.56 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.64 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 153.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 887.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 927.6 MB in the end (delta: 162.1 MB). Peak memory consumption was 162.1 MB. Max. memory is 11.5 GB. * Witness Printer took 34.13 ms. Allocated memory is still 1.1 GB. Free memory is still 927.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: 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: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: 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: 18]: Loop Invariant Derived loop invariant: ((x <= 2147483647 && y <= 2147483647) && 0 <= y) && 0 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 8 error locations. SAFE Result, 0.8s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 243 SDslu, 114 SDs, 0 SdLazy, 351 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 63 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 17 HoareAnnotationTreeSize, 5 FomulaSimplifications, 30 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 3499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...