./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.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_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/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 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:18:25,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:18:25,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:18:25,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:18:25,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:18:25,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:18:25,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:18:25,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:18:25,904 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:18:25,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:18:25,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:18:25,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:18:25,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:18:25,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:18:25,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:18:25,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:18:25,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:18:25,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:18:25,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:18:25,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:18:25,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:18:25,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:18:25,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:18:25,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:18:25,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:18:25,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:18:25,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:18:25,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:18:25,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:18:25,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:18:25,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:18:25,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:18:25,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:18:25,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:18:25,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:18:25,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:18:25,916 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-02 04:18:25,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:18:25,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:18:25,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:18:25,923 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:18:25,923 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:18:25,924 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:18:25,924 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:18:25,924 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:18:25,924 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:18:25,924 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:18:25,924 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:18:25,924 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:18:25,924 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:18:25,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:18:25,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:18:25,925 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:18:25,926 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:18:25,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:18:25,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:18:25,926 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:18:25,926 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:18:25,926 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:18:25,926 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:18:25,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:18:25,926 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 04:18:25,926 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_091ae023-0ead-4924-921e-ba4db968748e/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 -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2018-12-02 04:18:25,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:18:25,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:18:25,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:18:25,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:18:25,956 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:18:25,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 04:18:25,993 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/data/55d801c2c/7c01a265d8274422a578ef2b01a378d9/FLAGdde3ad80e [2018-12-02 04:18:26,429 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:18:26,429 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 04:18:26,433 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/data/55d801c2c/7c01a265d8274422a578ef2b01a378d9/FLAGdde3ad80e [2018-12-02 04:18:26,440 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/data/55d801c2c/7c01a265d8274422a578ef2b01a378d9 [2018-12-02 04:18:26,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:18:26,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:18:26,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:18:26,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:18:26,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:18:26,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abc4b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26, skipping insertion in model container [2018-12-02 04:18:26,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:18:26,460 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:18:26,545 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:18:26,548 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:18:26,558 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:18:26,567 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:18:26,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26 WrapperNode [2018-12-02 04:18:26,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:18:26,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:18:26,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:18:26,568 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:18:26,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:18:26,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:18:26,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:18:26,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:18:26,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... [2018-12-02 04:18:26,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:18:26,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:18:26,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:18:26,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:18:26,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/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 04:18:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:18:26,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:18:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-12-02 04:18:26,660 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-12-02 04:18:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-12-02 04:18:26,660 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-12-02 04:18:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:18:26,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:18:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:18:26,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:18:26,779 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:18:26,779 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 04:18:26,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:18:26 BoogieIcfgContainer [2018-12-02 04:18:26,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:18:26,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:18:26,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:18:26,782 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:18:26,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:18:26" (1/3) ... [2018-12-02 04:18:26,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ceca61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:18:26, skipping insertion in model container [2018-12-02 04:18:26,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:18:26" (2/3) ... [2018-12-02 04:18:26,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ceca61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:18:26, skipping insertion in model container [2018-12-02 04:18:26,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:18:26" (3/3) ... [2018-12-02 04:18:26,785 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 04:18:26,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:18:26,795 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-02 04:18:26,807 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-02 04:18:26,831 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:18:26,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:18:26,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:18:26,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:18:26,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:18:26,831 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:18:26,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:18:26,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:18:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-02 04:18:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 04:18:26,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:26,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:26,848 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:26,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-12-02 04:18:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:26,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:26,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:26,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:26,947 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 04:18:26,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:26,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:18:26,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:26,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:18:26,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:18:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:18:26,960 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-12-02 04:18:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,007 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-02 04:18:27,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:18:27,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 04:18:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,013 INFO L225 Difference]: With dead ends: 49 [2018-12-02 04:18:27,013 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 04:18:27,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:18:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 04:18:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 04:18:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 04:18:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 04:18:27,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2018-12-02 04:18:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,040 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 04:18:27,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:18:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 04:18:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:18:27,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,041 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-12-02 04:18:27,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,061 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 04:18:27,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:18:27,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:18:27,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:18:27,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:18:27,063 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-12-02 04:18:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,072 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-02 04:18:27,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:18:27,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 04:18:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,073 INFO L225 Difference]: With dead ends: 45 [2018-12-02 04:18:27,073 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 04:18:27,074 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 04:18:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 04:18:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-02 04:18:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 04:18:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-02 04:18:27,079 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-12-02 04:18:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,079 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-02 04:18:27,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:18:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-02 04:18:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 04:18:27,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,080 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,080 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1097781535, now seen corresponding path program 1 times [2018-12-02 04:18:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 04:18:27,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:18:27,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:18:27,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:18:27,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:18:27,111 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-02 04:18:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,165 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-12-02 04:18:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:18:27,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 04:18:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,167 INFO L225 Difference]: With dead ends: 66 [2018-12-02 04:18:27,167 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 04:18:27,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:18:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 04:18:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-12-02 04:18:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 04:18:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-12-02 04:18:27,178 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 20 [2018-12-02 04:18:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,178 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-12-02 04:18:27,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:18:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-12-02 04:18:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 04:18:27,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,179 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,180 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash -328510744, now seen corresponding path program 1 times [2018-12-02 04:18:27,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 04:18:27,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:18:27,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:18:27,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:18:27,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:18:27,198 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 3 states. [2018-12-02 04:18:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,206 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-12-02 04:18:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:18:27,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 04:18:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,207 INFO L225 Difference]: With dead ends: 62 [2018-12-02 04:18:27,207 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 04:18:27,207 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 04:18:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 04:18:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-12-02 04:18:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 04:18:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-12-02 04:18:27,212 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 21 [2018-12-02 04:18:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,212 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-12-02 04:18:27,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:18:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-12-02 04:18:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 04:18:27,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,213 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,213 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash -271335032, now seen corresponding path program 1 times [2018-12-02 04:18:27,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:18:27,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:18:27,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:18:27,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:18:27,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:18:27,235 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2018-12-02 04:18:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,241 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-12-02 04:18:27,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:18:27,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 04:18:27,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,242 INFO L225 Difference]: With dead ends: 57 [2018-12-02 04:18:27,242 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 04:18:27,242 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 04:18:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 04:18:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-02 04:18:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 04:18:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-12-02 04:18:27,246 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 28 [2018-12-02 04:18:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,246 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-12-02 04:18:27,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:18:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-12-02 04:18:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:18:27,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,247 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,247 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,247 INFO L82 PathProgramCache]: Analyzing trace with hash 178548671, now seen corresponding path program 1 times [2018-12-02 04:18:27,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:18:27,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:18:27,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:18:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:18:27,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:18:27,271 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-12-02 04:18:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,283 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-12-02 04:18:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:18:27,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-12-02 04:18:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,284 INFO L225 Difference]: With dead ends: 64 [2018-12-02 04:18:27,284 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 04:18:27,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:18:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 04:18:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-12-02 04:18:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 04:18:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2018-12-02 04:18:27,289 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 29 [2018-12-02 04:18:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,289 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-12-02 04:18:27,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:18:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2018-12-02 04:18:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 04:18:27,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,290 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,290 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1484175368, now seen corresponding path program 1 times [2018-12-02 04:18:27,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:18:27,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:18:27,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:18:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:18:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:18:27,302 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 3 states. [2018-12-02 04:18:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,312 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-12-02 04:18:27,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:18:27,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 04:18:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,313 INFO L225 Difference]: With dead ends: 61 [2018-12-02 04:18:27,313 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 04:18:27,313 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 04:18:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 04:18:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-02 04:18:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 04:18:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-12-02 04:18:27,316 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 28 [2018-12-02 04:18:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,317 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-12-02 04:18:27,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:18:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-12-02 04:18:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:18:27,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,317 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,318 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1235203803, now seen corresponding path program 1 times [2018-12-02 04:18:27,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:18:27,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:18:27,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:18:27,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:18:27,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:18:27,337 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 4 states. [2018-12-02 04:18:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,350 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-12-02 04:18:27,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:18:27,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-12-02 04:18:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,352 INFO L225 Difference]: With dead ends: 83 [2018-12-02 04:18:27,352 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 04:18:27,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:18:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 04:18:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-12-02 04:18:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 04:18:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-12-02 04:18:27,358 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 29 [2018-12-02 04:18:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,358 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-12-02 04:18:27,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:18:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-12-02 04:18:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 04:18:27,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,358 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,359 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1924993580, now seen corresponding path program 1 times [2018-12-02 04:18:27,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:18:27,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:18:27,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:18:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:18:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:18:27,384 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 5 states. [2018-12-02 04:18:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,437 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-12-02 04:18:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:18:27,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-02 04:18:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,438 INFO L225 Difference]: With dead ends: 93 [2018-12-02 04:18:27,438 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 04:18:27,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:18:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 04:18:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-12-02 04:18:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 04:18:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-12-02 04:18:27,447 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 33 [2018-12-02 04:18:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,448 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-12-02 04:18:27,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:18:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-12-02 04:18:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 04:18:27,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,449 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,449 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1290914449, now seen corresponding path program 1 times [2018-12-02 04:18:27,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 04:18:27,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:18:27,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:18:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:18:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:18:27,472 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 5 states. [2018-12-02 04:18:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,515 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2018-12-02 04:18:27,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:18:27,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-02 04:18:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,516 INFO L225 Difference]: With dead ends: 92 [2018-12-02 04:18:27,517 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 04:18:27,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:18:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 04:18:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-12-02 04:18:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 04:18:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-12-02 04:18:27,522 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 39 [2018-12-02 04:18:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,523 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-12-02 04:18:27,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:18:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-12-02 04:18:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 04:18:27,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,523 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,524 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash -495515594, now seen corresponding path program 1 times [2018-12-02 04:18:27,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 04:18:27,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:18:27,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:18:27,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:18:27,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:18:27,541 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-12-02 04:18:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,557 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2018-12-02 04:18:27,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:18:27,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-02 04:18:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,559 INFO L225 Difference]: With dead ends: 98 [2018-12-02 04:18:27,559 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 04:18:27,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:18:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 04:18:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-12-02 04:18:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 04:18:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2018-12-02 04:18:27,565 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 42 [2018-12-02 04:18:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,565 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2018-12-02 04:18:27,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:18:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-12-02 04:18:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 04:18:27,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,566 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,566 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash 465451333, now seen corresponding path program 1 times [2018-12-02 04:18:27,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 04:18:27,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:18:27,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:18:27,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:18:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:18:27,583 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand 3 states. [2018-12-02 04:18:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,590 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-12-02 04:18:27,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:18:27,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 04:18:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,591 INFO L225 Difference]: With dead ends: 94 [2018-12-02 04:18:27,591 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 04:18:27,592 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 04:18:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 04:18:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-02 04:18:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 04:18:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2018-12-02 04:18:27,597 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 48 [2018-12-02 04:18:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,597 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-12-02 04:18:27,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:18:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2018-12-02 04:18:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 04:18:27,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,598 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,598 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1523265789, now seen corresponding path program 1 times [2018-12-02 04:18:27,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 04:18:27,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:18:27,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:18:27,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:18:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:18:27,628 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 5 states. [2018-12-02 04:18:27,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,648 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-12-02 04:18:27,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:18:27,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 04:18:27,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,649 INFO L225 Difference]: With dead ends: 93 [2018-12-02 04:18:27,649 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 04:18:27,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:18:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 04:18:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-12-02 04:18:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 04:18:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-12-02 04:18:27,653 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 48 [2018-12-02 04:18:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,654 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-12-02 04:18:27,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:18:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-12-02 04:18:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 04:18:27,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,655 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,655 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1209675883, now seen corresponding path program 1 times [2018-12-02 04:18:27,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 04:18:27,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:18:27,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:18:27,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:18:27,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:18:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:18:27,683 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 5 states. [2018-12-02 04:18:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:27,705 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-12-02 04:18:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:18:27,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 04:18:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:27,706 INFO L225 Difference]: With dead ends: 89 [2018-12-02 04:18:27,706 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 04:18:27,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:18:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 04:18:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2018-12-02 04:18:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 04:18:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-12-02 04:18:27,710 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 53 [2018-12-02 04:18:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:27,710 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-12-02 04:18:27,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:18:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-12-02 04:18:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 04:18:27,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:27,711 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:27,711 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:27,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,712 INFO L82 PathProgramCache]: Analyzing trace with hash 375918826, now seen corresponding path program 1 times [2018-12-02 04:18:27,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:27,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-02 04:18:27,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:18:27,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:18:27,750 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-12-02 04:18:27,751 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [28], [29], [31], [33], [35], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60], [61], [62], [64] [2018-12-02 04:18:27,773 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:18:27,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:18:27,857 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 04:18:27,858 INFO L272 AbstractInterpreter]: Visited 20 different actions 55 times. Never merged. Never widened. Performed 103 root evaluator evaluations with a maximum evaluation depth of 3. Performed 103 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-02 04:18:27,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:27,863 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 04:18:27,897 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 50% of their original sizes. [2018-12-02 04:18:27,897 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 04:18:27,919 INFO L418 sIntCurrentIteration]: We unified 70 AI predicates to 70 [2018-12-02 04:18:27,920 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 04:18:27,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 04:18:27,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-02 04:18:27,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:27,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:18:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:18:27,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:18:27,921 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 7 states. [2018-12-02 04:18:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:28,013 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2018-12-02 04:18:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:18:28,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-02 04:18:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:28,014 INFO L225 Difference]: With dead ends: 150 [2018-12-02 04:18:28,014 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 04:18:28,015 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:18:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 04:18:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-12-02 04:18:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 04:18:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-12-02 04:18:28,022 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 71 [2018-12-02 04:18:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:28,022 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-12-02 04:18:28,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:18:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-12-02 04:18:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 04:18:28,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:18:28,024 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:18:28,024 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 04:18:28,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1826095791, now seen corresponding path program 1 times [2018-12-02 04:18:28,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:18:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:28,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:18:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:18:28,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:18:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:18:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-02 04:18:28,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:18:28,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:18:28,070 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-12-02 04:18:28,070 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [28], [29], [31], [33], [35], [37], [39], [41], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [64] [2018-12-02 04:18:28,072 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:18:28,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:18:28,136 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 04:18:28,136 INFO L272 AbstractInterpreter]: Visited 24 different actions 92 times. Merged at 7 different actions 16 times. Never widened. Performed 243 root evaluator evaluations with a maximum evaluation depth of 3. Performed 243 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 04:18:28,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:18:28,145 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 04:18:28,176 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 56.41% of their original sizes. [2018-12-02 04:18:28,176 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 04:18:28,236 INFO L418 sIntCurrentIteration]: We unified 86 AI predicates to 86 [2018-12-02 04:18:28,236 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 04:18:28,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 04:18:28,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-12-02 04:18:28,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:18:28,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 04:18:28,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 04:18:28,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 04:18:28,238 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 13 states. [2018-12-02 04:18:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:18:28,411 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-12-02 04:18:28,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 04:18:28,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2018-12-02 04:18:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:18:28,412 INFO L225 Difference]: With dead ends: 97 [2018-12-02 04:18:28,412 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 04:18:28,412 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-12-02 04:18:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 04:18:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 04:18:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 04:18:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 04:18:28,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-12-02 04:18:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:18:28,413 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:18:28,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 04:18:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:18:28,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 04:18:28,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 04:18:28,507 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 04:18:28,507 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 04:18:28,507 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-12-02 04:18:28,507 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-12-02 04:18:28,507 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,507 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,507 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-12-02 04:18:28,507 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,508 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-12-02 04:18:28,508 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-12-02 04:18:28,508 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,508 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,508 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,508 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,508 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,508 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-12-02 04:18:28,508 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,508 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-12-02 04:18:28,508 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-12-02 04:18:28,509 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-12-02 04:18:28,510 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,510 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j) (or (= |rec2_#t~ret3| 0) (= (+ |rec2_#t~ret3| 1) 0))) (< 2147483647 |rec2_#in~j|)) [2018-12-02 04:18:28,510 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,510 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,510 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,510 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,510 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 04:18:28,510 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-12-02 04:18:28,510 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 04:18:28,510 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 04:18:28,510 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 04:18:28,510 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 04:18:28,510 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-12-02 04:18:28,511 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-12-02 04:18:28,511 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-12-02 04:18:28,511 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-12-02 04:18:28,511 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-02 04:18:28,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:18:28 BoogieIcfgContainer [2018-12-02 04:18:28,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:18:28,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:18:28,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:18:28,513 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:18:28,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:18:26" (3/4) ... [2018-12-02 04:18:28,516 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 04:18:28,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 04:18:28,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-12-02 04:18:28,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-12-02 04:18:28,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 04:18:28,524 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 04:18:28,524 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 04:18:28,524 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 04:18:28,550 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_091ae023-0ead-4924-921e-ba4db968748e/bin-2019/utaipan/witness.graphml [2018-12-02 04:18:28,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:18:28,551 INFO L168 Benchmark]: Toolchain (without parser) took 2108.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 957.1 MB in the beginning and 1.0 GB in the end (delta: -61.5 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:18:28,551 INFO L168 Benchmark]: CDTParser took 0.15 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 04:18:28,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 124.17 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 04:18:28,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.94 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 04:18:28,552 INFO L168 Benchmark]: Boogie Preprocessor took 11.94 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 04:18:28,552 INFO L168 Benchmark]: RCFGBuilder took 187.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:18:28,553 INFO L168 Benchmark]: TraceAbstraction took 1733.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. [2018-12-02 04:18:28,553 INFO L168 Benchmark]: Witness Printer took 36.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:18:28,554 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.15 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 124.17 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.94 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.94 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 187.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1733.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. * Witness Printer took 36.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: 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: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 1.6s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 657 SDtfs, 218 SDslu, 1346 SDs, 0 SdLazy, 229 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 220 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9198717948717948 AbsIntWeakeningRatio, 0.532051282051282 AbsIntAvgWeakeningVarsNumRemoved, 0.10256410256410256 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 57 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 99 PreInvPairs, 103 NumberOfFragments, 75 HoareAnnotationTreeSize, 99 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 62 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 36771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 363/412 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...