./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6938b5c805400363799492c040263d9022406929 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:08:55,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:08:55,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:08:55,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:08:55,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:08:55,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:08:55,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:08:55,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:08:55,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:08:55,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:08:55,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:08:55,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:08:55,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:08:55,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:08:55,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:08:55,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:08:55,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:08:55,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:08:55,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:08:55,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:08:55,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:08:55,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:08:55,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:08:55,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:08:55,808 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:08:55,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:08:55,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:08:55,811 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:08:55,811 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:08:55,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:08:55,813 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:08:55,813 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:08:55,813 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:08:55,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:08:55,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:08:55,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:08:55,816 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-28 23:08:55,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:08:55,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:08:55,834 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:08:55,834 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:08:55,835 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:08:55,835 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:08:55,835 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:08:55,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:08:55,837 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:08:55,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:08:55,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:08:55,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:08:55,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:08:55,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:08:55,838 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:08:55,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:08:55,838 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:08:55,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:08:55,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:08:55,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:08:55,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:08:55,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:08:55,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:08:55,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:08:55,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:08:55,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:08:55,841 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:08:55,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:08:55,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:08:55,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 6938b5c805400363799492c040263d9022406929 [2018-11-28 23:08:55,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:08:55,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:08:55,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:08:55,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:08:55,921 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:08:55,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c [2018-11-28 23:08:55,990 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cf5d165/ecfe437c57f24c48adcfe0d67fb15fda/FLAGfe6473571 [2018-11-28 23:08:56,411 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:08:56,411 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c [2018-11-28 23:08:56,418 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cf5d165/ecfe437c57f24c48adcfe0d67fb15fda/FLAGfe6473571 [2018-11-28 23:08:56,796 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cf5d165/ecfe437c57f24c48adcfe0d67fb15fda [2018-11-28 23:08:56,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:08:56,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:08:56,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:08:56,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:08:56,806 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:08:56,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:08:56" (1/1) ... [2018-11-28 23:08:56,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67394605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:56, skipping insertion in model container [2018-11-28 23:08:56,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:08:56" (1/1) ... [2018-11-28 23:08:56,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:08:56,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:08:57,062 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:08:57,068 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:08:57,084 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:08:57,097 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:08:57,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57 WrapperNode [2018-11-28 23:08:57,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:08:57,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:08:57,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:08:57,099 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:08:57,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:08:57,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:08:57,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:08:57,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:08:57,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... [2018-11-28 23:08:57,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:08:57,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:08:57,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:08:57,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:08:57,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:08:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:08:57,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:08:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:08:57,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:08:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:08:57,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:08:57,514 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:08:57,514 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 23:08:57,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:08:57 BoogieIcfgContainer [2018-11-28 23:08:57,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:08:57,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:08:57,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:08:57,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:08:57,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:08:56" (1/3) ... [2018-11-28 23:08:57,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17760d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:08:57, skipping insertion in model container [2018-11-28 23:08:57,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:57" (2/3) ... [2018-11-28 23:08:57,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17760d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:08:57, skipping insertion in model container [2018-11-28 23:08:57,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:08:57" (3/3) ... [2018-11-28 23:08:57,528 INFO L112 eAbstractionObserver]: Analyzing ICFG genady_true-termination_true-no-overflow.c [2018-11-28 23:08:57,541 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:08:57,559 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-28 23:08:57,585 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-28 23:08:57,634 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:08:57,634 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:08:57,635 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:08:57,635 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:08:57,635 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:08:57,635 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:08:57,635 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:08:57,635 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:08:57,635 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:08:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-28 23:08:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-28 23:08:57,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:57,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:08:57,673 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:57,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:57,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1775992520, now seen corresponding path program 1 times [2018-11-28 23:08:57,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:57,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:57,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:57,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:57,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:57,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:57,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:08:57,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:08:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:08:57,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:57,901 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-11-28 23:08:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:58,002 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-28 23:08:58,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:08:58,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-11-28 23:08:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:58,013 INFO L225 Difference]: With dead ends: 28 [2018-11-28 23:08:58,014 INFO L226 Difference]: Without dead ends: 17 [2018-11-28 23:08:58,016 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-11-28 23:08:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-28 23:08:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 23:08:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:08:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-28 23:08:58,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 6 [2018-11-28 23:08:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:58,050 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-28 23:08:58,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:08:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-28 23:08:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 23:08:58,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:58,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:58,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:58,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash -778806686, now seen corresponding path program 1 times [2018-11-28 23:08:58,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:58,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:58,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:58,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:08:58,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:08:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:08:58,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:58,102 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2018-11-28 23:08:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:58,202 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-28 23:08:58,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:08:58,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 23:08:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:58,204 INFO L225 Difference]: With dead ends: 25 [2018-11-28 23:08:58,204 INFO L226 Difference]: Without dead ends: 24 [2018-11-28 23:08:58,205 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-11-28 23:08:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-28 23:08:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-11-28 23:08:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:08:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-28 23:08:58,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 7 [2018-11-28 23:08:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:58,212 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-28 23:08:58,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:08:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-28 23:08:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 23:08:58,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:58,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:58,214 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:58,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:58,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1108914236, now seen corresponding path program 1 times [2018-11-28 23:08:58,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:58,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:58,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:58,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:58,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:08:58,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:08:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:08:58,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:58,273 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 3 states. [2018-11-28 23:08:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:58,357 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-28 23:08:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:08:58,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 23:08:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:58,359 INFO L225 Difference]: With dead ends: 23 [2018-11-28 23:08:58,359 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 23:08:58,360 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-11-28 23:08:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 23:08:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 23:08:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:08:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-28 23:08:58,364 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 9 [2018-11-28 23:08:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:58,365 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-28 23:08:58,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:08:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-28 23:08:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:08:58,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:58,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:58,367 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:58,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash -16602897, now seen corresponding path program 1 times [2018-11-28 23:08:58,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:58,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:58,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:58,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:08:58,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:08:58,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:08:58,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:58,421 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-11-28 23:08:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:58,487 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-28 23:08:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:08:58,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 23:08:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:58,489 INFO L225 Difference]: With dead ends: 21 [2018-11-28 23:08:58,489 INFO L226 Difference]: Without dead ends: 20 [2018-11-28 23:08:58,490 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-11-28 23:08:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-28 23:08:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 23:08:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:08:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-28 23:08:58,495 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2018-11-28 23:08:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:58,496 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-28 23:08:58,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:08:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-28 23:08:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 23:08:58,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:58,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:58,498 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:58,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash -514689754, now seen corresponding path program 1 times [2018-11-28 23:08:58,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:58,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:58,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:58,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:08:58,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:08:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:08:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:58,547 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 3 states. [2018-11-28 23:08:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:58,663 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-28 23:08:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:08:58,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 23:08:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:58,665 INFO L225 Difference]: With dead ends: 20 [2018-11-28 23:08:58,665 INFO L226 Difference]: Without dead ends: 19 [2018-11-28 23:08:58,666 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-11-28 23:08:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-28 23:08:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 23:08:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:08:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-28 23:08:58,674 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 11 [2018-11-28 23:08:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:58,675 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-28 23:08:58,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:08:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-28 23:08:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:08:58,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:58,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:58,677 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:58,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1224486865, now seen corresponding path program 1 times [2018-11-28 23:08:58,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:58,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:58,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:58,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:58,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:08:58,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:08:58,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:08:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:58,742 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 3 states. [2018-11-28 23:08:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:58,773 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-28 23:08:58,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:08:58,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 23:08:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:58,775 INFO L225 Difference]: With dead ends: 23 [2018-11-28 23:08:58,775 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 23:08:58,775 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-11-28 23:08:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 23:08:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 23:08:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:08:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-28 23:08:58,780 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2018-11-28 23:08:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:58,780 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-28 23:08:58,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:08:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-28 23:08:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 23:08:58,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:58,783 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:58,783 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:58,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash -89160557, now seen corresponding path program 1 times [2018-11-28 23:08:58,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:58,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:58,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:08:58,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:08:58,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:58,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:08:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:59,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:08:59,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-28 23:08:59,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:08:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:08:59,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:08:59,366 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-11-28 23:08:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:59,753 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 23:08:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:08:59,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-11-28 23:08:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:59,757 INFO L225 Difference]: With dead ends: 29 [2018-11-28 23:08:59,757 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 23:08:59,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:08:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 23:08:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-11-28 23:08:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:08:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-28 23:08:59,769 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2018-11-28 23:08:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:59,769 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-28 23:08:59,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:08:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-28 23:08:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 23:08:59,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:59,770 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:59,773 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:59,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:59,773 INFO L82 PathProgramCache]: Analyzing trace with hash 216052149, now seen corresponding path program 1 times [2018-11-28 23:08:59,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:59,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:59,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:59,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:59,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:08:59,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:08:59,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:59,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:08:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:59,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:08:59,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-28 23:08:59,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:08:59,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:08:59,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:08:59,889 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 4 states. [2018-11-28 23:08:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:59,977 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-28 23:08:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:08:59,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-28 23:08:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:59,982 INFO L225 Difference]: With dead ends: 28 [2018-11-28 23:08:59,982 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 23:08:59,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:08:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 23:08:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 23:08:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:08:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-28 23:08:59,990 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 16 [2018-11-28 23:08:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:59,991 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-28 23:08:59,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:08:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-28 23:08:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 23:08:59,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:59,993 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:59,994 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:59,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:59,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1746355136, now seen corresponding path program 1 times [2018-11-28 23:08:59,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:59,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:59,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:59,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:00,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:00,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:09:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:00,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:00,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:00,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-28 23:09:00,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:09:00,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:09:00,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:09:00,228 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 4 states. [2018-11-28 23:09:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:00,384 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-28 23:09:00,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:09:00,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-28 23:09:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:00,386 INFO L225 Difference]: With dead ends: 30 [2018-11-28 23:09:00,386 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 23:09:00,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:09:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 23:09:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 23:09:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 23:09:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-28 23:09:00,391 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2018-11-28 23:09:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:00,392 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-28 23:09:00,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:09:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-28 23:09:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:09:00,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:00,393 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:00,395 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:00,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1084928322, now seen corresponding path program 2 times [2018-11-28 23:09:00,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:00,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:00,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:00,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:00,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:09:00,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:09:00,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:09:00,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:09:00,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:00,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:00,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-11-28 23:09:00,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:09:00,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:09:00,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:09:00,801 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 13 states. [2018-11-28 23:09:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:01,172 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-28 23:09:01,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:09:01,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-11-28 23:09:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:01,174 INFO L225 Difference]: With dead ends: 36 [2018-11-28 23:09:01,174 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 23:09:01,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:09:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 23:09:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-28 23:09:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 23:09:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-28 23:09:01,181 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 21 [2018-11-28 23:09:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:01,181 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-28 23:09:01,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:09:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-28 23:09:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 23:09:01,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:01,182 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:01,183 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:01,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:01,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1060933980, now seen corresponding path program 2 times [2018-11-28 23:09:01,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:01,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:01,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:01,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:09:01,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:01,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:01,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:09:01,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:09:01,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:09:01,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:09:01,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:01,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:01,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 23:09:01,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:09:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:09:01,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:01,315 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 5 states. [2018-11-28 23:09:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:01,392 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-28 23:09:01,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:09:01,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 23:09:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:01,394 INFO L225 Difference]: With dead ends: 35 [2018-11-28 23:09:01,394 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 23:09:01,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 23:09:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-28 23:09:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:09:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-28 23:09:01,400 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 23 [2018-11-28 23:09:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:01,400 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-28 23:09:01,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:09:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-28 23:09:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 23:09:01,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:01,401 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:01,402 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:01,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:01,402 INFO L82 PathProgramCache]: Analyzing trace with hash 380183793, now seen corresponding path program 2 times [2018-11-28 23:09:01,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:01,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:09:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:01,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:01,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:09:01,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:09:01,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:09:01,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:09:01,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-28 23:09:01,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:09:01,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:09:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:09:01,633 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 9 states. [2018-11-28 23:09:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:01,858 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-28 23:09:01,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:09:01,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-28 23:09:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:01,860 INFO L225 Difference]: With dead ends: 39 [2018-11-28 23:09:01,860 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 23:09:01,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:09:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 23:09:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-11-28 23:09:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:09:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-28 23:09:01,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-11-28 23:09:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:01,868 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-28 23:09:01,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:09:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-28 23:09:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 23:09:01,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:01,869 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:01,870 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:01,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 284406195, now seen corresponding path program 3 times [2018-11-28 23:09:01,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:01,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:01,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:01,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:09:01,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 23:09:02,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:09:02,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:09:02,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:09:02,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:09:02,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:02,079 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 5 states. [2018-11-28 23:09:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:02,139 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-28 23:09:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:09:02,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-28 23:09:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:02,142 INFO L225 Difference]: With dead ends: 32 [2018-11-28 23:09:02,142 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 23:09:02,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 23:09:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-28 23:09:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 23:09:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-28 23:09:02,149 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-11-28 23:09:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:02,150 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-28 23:09:02,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:09:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-28 23:09:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:09:02,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:02,152 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:02,152 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:02,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1563552043, now seen corresponding path program 3 times [2018-11-28 23:09:02,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:02,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:02,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:09:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 23:09:02,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:09:02,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:09:02,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:09:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:09:02,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:02,197 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 5 states. [2018-11-28 23:09:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:02,236 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-28 23:09:02,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:09:02,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-28 23:09:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:02,238 INFO L225 Difference]: With dead ends: 31 [2018-11-28 23:09:02,238 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:09:02,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:09:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:09:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:09:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:09:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:09:02,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-28 23:09:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:02,240 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:09:02,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:09:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:09:02,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:09:02,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:09:02,393 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:09:02,393 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:09:02,393 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:09:02,393 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:09:02,393 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:09:02,394 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:09:02,394 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-11-28 23:09:02,394 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 20) no Hoare annotation was computed. [2018-11-28 23:09:02,394 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-28 23:09:02,394 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-28 23:09:02,394 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-28 23:09:02,394 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2018-11-28 23:09:02,394 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 18) no Hoare annotation was computed. [2018-11-28 23:09:02,395 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 20) no Hoare annotation was computed. [2018-11-28 23:09:02,395 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 18) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 10000))) (or (and .cse0 (<= (+ main_~j~0 1) main_~i~0) (<= main_~i~0 (+ main_~j~0 9999)) (<= 10000 main_~i~0)) (and (<= 2 main_~j~0) .cse0 (<= (+ main_~j~0 9997) main_~i~0)) (and (<= main_~j~0 (+ main_~i~0 1)) .cse0 (<= 3 main_~j~0)))) [2018-11-28 23:09:02,395 INFO L448 ceAbstractionStarter]: For program point L15-5(lines 15 18) no Hoare annotation was computed. [2018-11-28 23:09:02,395 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2018-11-28 23:09:02,395 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-11-28 23:09:02,395 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 20) the Hoare annotation is: true [2018-11-28 23:09:02,395 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-28 23:09:02,396 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-28 23:09:02,396 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-28 23:09:02,396 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2018-11-28 23:09:02,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:09:02 BoogieIcfgContainer [2018-11-28 23:09:02,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:09:02,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:09:02,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:09:02,412 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:09:02,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:08:57" (3/4) ... [2018-11-28 23:09:02,417 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:09:02,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:09:02,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:09:02,431 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 23:09:02,431 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 23:09:02,431 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:09:02,478 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:09:02,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:09:02,479 INFO L168 Benchmark]: Toolchain (without parser) took 5678.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.7 MB in the beginning and 871.8 MB in the end (delta: 76.9 MB). Peak memory consumption was 223.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:09:02,481 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:09:02,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.54 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:09:02,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.15 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:09:02,482 INFO L168 Benchmark]: Boogie Preprocessor took 19.98 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:09:02,483 INFO L168 Benchmark]: RCFGBuilder took 376.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:09:02,483 INFO L168 Benchmark]: TraceAbstraction took 4894.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.8 MB in the end (delta: 253.0 MB). Peak memory consumption was 253.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:09:02,484 INFO L168 Benchmark]: Witness Printer took 65.88 ms. Allocated memory is still 1.2 GB. Free memory is still 871.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:09:02,488 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.54 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.15 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.98 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 376.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4894.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.8 MB in the end (delta: 253.0 MB). Peak memory consumption was 253.0 MB. Max. memory is 11.5 GB. * Witness Printer took 65.88 ms. Allocated memory is still 1.2 GB. Free memory is still 871.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((i <= 10000 && j + 1 <= i) && i <= j + 9999) && 10000 <= i) || ((2 <= j && i <= 10000) && j + 9997 <= i)) || ((j <= i + 1 && i <= 10000) && 3 <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 6 error locations. SAFE Result, 4.7s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 135 SDslu, 180 SDs, 0 SdLazy, 396 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 46 HoareAnnotationTreeSize, 5 FomulaSimplifications, 58 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 53 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 17221 SizeOfPredicates, 1 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 71/180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...