java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/veris.c_NetBSD-libc__loop.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:52:55,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:52:55,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:52:55,830 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:52:55,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:52:55,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:52:55,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:52:55,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:52:55,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:52:55,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:52:55,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:52:55,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:52:55,846 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:52:55,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:52:55,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:52:55,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:52:55,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:52:55,862 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:52:55,866 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:52:55,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:52:55,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:52:55,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:52:55,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:52:55,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:52:55,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:52:55,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:52:55,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:52:55,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:52:55,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:52:55,880 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:52:55,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:52:55,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:52:55,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:52:55,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:52:55,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:52:55,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:52:55,883 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-03-04 16:52:55,907 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:52:55,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:52:55,909 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:52:55,909 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:52:55,909 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:52:55,909 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:52:55,909 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:52:55,910 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:52:55,910 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:52:55,910 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:52:55,910 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:52:55,910 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:52:55,911 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:52:55,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:52:55,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:52:55,912 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:52:55,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:52:55,913 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:52:55,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:52:55,913 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:52:55,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:52:55,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:52:55,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:52:55,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:52:55,914 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:52:55,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:52:55,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:52:55,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:52:55,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:52:55,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:52:55,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:52:55,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:52:55,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:52:55,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:52:55,918 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:52:55,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:52:55,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:52:55,919 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:52:55,919 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:52:55,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:52:55,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:52:55,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:52:55,985 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:52:55,985 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:52:55,986 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/veris.c_NetBSD-libc__loop.i_2.bpl [2019-03-04 16:52:55,986 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/veris.c_NetBSD-libc__loop.i_2.bpl' [2019-03-04 16:52:56,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:52:56,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:52:56,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:52:56,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:52:56,034 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:52:56,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:52:56,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:52:56,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:52:56,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:52:56,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:52:56,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:52:56,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:52:56,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:52:56,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (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 [2019-03-04 16:52:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:52:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:52:56,441 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:52:56,442 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-03-04 16:52:56,443 INFO L202 PluginConnector]: Adding new model veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:52:56 BoogieIcfgContainer [2019-03-04 16:52:56,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:52:56,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:52:56,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:52:56,448 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:52:56,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/2) ... [2019-03-04 16:52:56,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19491d78 and model type veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:52:56, skipping insertion in model container [2019-03-04 16:52:56,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:52:56" (2/2) ... [2019-03-04 16:52:56,451 INFO L112 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc__loop.i_2.bpl [2019-03-04 16:52:56,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:52:56,468 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:52:56,481 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:52:56,510 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:52:56,510 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:52:56,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:52:56,511 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:52:56,511 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:52:56,511 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:52:56,511 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:52:56,511 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:52:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:52:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:52:56,532 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:56,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:52:56,535 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-03-04 16:52:56,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:56,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:56,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:56,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:56,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:52:56,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:52:56,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:52:56,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:52:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:52:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:52:56,880 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-03-04 16:52:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:52:56,980 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-03-04 16:52:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:52:56,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:52:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:52:56,994 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:52:56,994 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:52:56,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:52:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:52:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-03-04 16:52:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:52:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:52:57,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-03-04 16:52:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:52:57,038 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:52:57,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:52:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:52:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:52:57,039 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:57,040 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:52:57,040 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-03-04 16:52:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:57,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:52:57,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:52:57,271 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:52:57,274 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-03-04 16:52:57,343 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:52:57,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:27,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:27,333 INFO L272 AbstractInterpreter]: Visited 5 different actions 10 times. Merged at 4 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:53:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:27,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:27,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:27,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2019-03-04 16:53:27,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:27,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:27,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:53:27,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:27,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:27,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:27,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-03-04 16:53:27,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:27,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:27,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:27,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:53:27,788 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2019-03-04 16:53:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:27,871 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-03-04 16:53:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:53:27,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:53:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:27,873 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:53:27,873 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:53:27,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:53:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-03-04 16:53:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:53:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-03-04 16:53:27,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-03-04 16:53:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:27,878 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-03-04 16:53:27,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-03-04 16:53:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:53:27,879 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:27,879 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-03-04 16:53:27,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-03-04 16:53:27,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:27,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:27,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:27,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:27,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:28,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:28,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-03-04 16:53:28,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:28,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:53:28,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:53:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:53:28,031 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-03-04 16:53:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:28,114 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-03-04 16:53:28,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:28,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-03-04 16:53:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:28,116 INFO L225 Difference]: With dead ends: 10 [2019-03-04 16:53:28,116 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:53:28,118 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 [2019-03-04 16:53:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:53:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:53:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:53:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:53:28,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-03-04 16:53:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:28,119 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:53:28,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:53:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:53:28,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:53:28,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:53:28,366 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-03-04 16:53:28,368 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 12 83) no Hoare annotation was computed. [2019-03-04 16:53:28,369 INFO L444 ceAbstractionStarter]: At program point L64(lines 64 77) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_glob2_~p~4.base ~tmp.base)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (or (and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) .cse0 (<= ULTIMATE.start_glob2_~pathlim.offset ULTIMATE.start_glob2_~p~4.offset) .cse1) (let ((.cse2 (+ ULTIMATE.start_glob2_~p~4.offset 4))) (and .cse0 (<= .cse2 ~tmp.offset) .cse1 (<= ULTIMATE.start_glob2_~pathlim.offset .cse2))))) [2019-03-04 16:53:28,369 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 12 83) no Hoare annotation was computed. [2019-03-04 16:53:28,369 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 12 83) no Hoare annotation was computed. [2019-03-04 16:53:28,369 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2019-03-04 16:53:28,369 INFO L444 ceAbstractionStarter]: At program point L80(lines 80 81) the Hoare annotation is: false [2019-03-04 16:53:28,370 INFO L444 ceAbstractionStarter]: At program point L76(lines 57 76) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_glob2_~p~4.base ~tmp.base))) (or (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_glob2_~pathlim.offset 4) ULTIMATE.start_glob2_~p~4.offset)) (let ((.cse1 (+ ULTIMATE.start_glob2_~p~4.offset 4))) (and .cse0 (<= .cse1 ~tmp.offset) (<= ULTIMATE.start_glob2_~pathlim.offset .cse1))) (and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) .cse0 (<= ULTIMATE.start_glob2_~pathlim.offset ULTIMATE.start_glob2_~p~4.offset) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)))) [2019-03-04 16:53:28,379 INFO L202 PluginConnector]: Adding new model veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:53:28 BoogieIcfgContainer [2019-03-04 16:53:28,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:53:28,380 INFO L168 Benchmark]: Toolchain (without parser) took 32347.74 ms. Allocated memory was 140.0 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 105.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 219.6 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:28,381 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory is still 106.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:53:28,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.86 ms. Allocated memory is still 140.0 MB. Free memory was 105.0 MB in the beginning and 103.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:28,383 INFO L168 Benchmark]: Boogie Preprocessor took 23.32 ms. Allocated memory is still 140.0 MB. Free memory was 103.3 MB in the beginning and 102.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:28,384 INFO L168 Benchmark]: RCFGBuilder took 347.52 ms. Allocated memory is still 140.0 MB. Free memory was 101.9 MB in the beginning and 90.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:28,385 INFO L168 Benchmark]: TraceAbstraction took 31935.29 ms. Allocated memory was 140.0 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 90.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 205.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:28,390 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory is still 106.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.86 ms. Allocated memory is still 140.0 MB. Free memory was 105.0 MB in the beginning and 103.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.32 ms. Allocated memory is still 140.0 MB. Free memory was 103.3 MB in the beginning and 102.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.52 ms. Allocated memory is still 140.0 MB. Free memory was 101.9 MB in the beginning and 90.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31935.29 ms. Allocated memory was 140.0 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 90.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 205.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 82]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((glob2_~p~4.offset <= ~tmp.offset && glob2_~p~4.base == ~tmp.base) && glob2_~pathlim.offset <= glob2_~p~4.offset) && 1 == __VERIFIER_assert_~cond) || (((glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset + 4 <= ~tmp.offset) && 1 == __VERIFIER_assert_~cond) && glob2_~pathlim.offset <= glob2_~p~4.offset + 4) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert_~cond) && glob2_~pathlim.offset + 4 <= glob2_~p~4.offset) || ((glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset + 4 <= ~tmp.offset) && glob2_~pathlim.offset <= glob2_~p~4.offset + 4)) || (((glob2_~p~4.offset <= ~tmp.offset && glob2_~p~4.base == ~tmp.base) && glob2_~pathlim.offset <= glob2_~p~4.offset) && 1 == __VERIFIER_assert_~cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 31.8s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 2 SDslu, 12 SDs, 0 SdLazy, 28 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 30.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8 NumberOfFragments, 70 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 735 SizeOfPredicates, 14 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...