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/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:14:18,915 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:14:18,917 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:14:18,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:14:18,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:14:18,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:14:18,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:14:18,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:14:18,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:14:18,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:14:18,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:14:18,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:14:18,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:14:18,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:14:18,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:14:18,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:14:18,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:14:18,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:14:18,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:14:18,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:14:18,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:14:18,976 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:14:18,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:14:18,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:14:18,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:14:18,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:14:18,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:14:18,983 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:14:18,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:14:18,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:14:18,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:14:18,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:14:18,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:14:18,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:14:18,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:14:18,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:14:18,992 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 [2018-12-03 19:14:19,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:14:19,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:14:19,015 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:14:19,015 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:14:19,015 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:14:19,016 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:14:19,016 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:14:19,016 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:14:19,016 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:14:19,016 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:14:19,017 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:14:19,017 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:14:19,017 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:14:19,018 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:14:19,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:14:19,019 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:14:19,019 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:14:19,019 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:14:19,019 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:14:19,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:14:19,020 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:14:19,021 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:14:19,021 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:14:19,021 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:14:19,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:14:19,022 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:14:19,022 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:14:19,022 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:14:19,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:14:19,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:14:19,023 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:14:19,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:14:19,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:14:19,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:14:19,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:14:19,024 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:14:19,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:14:19,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:14:19,025 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:14:19,025 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:14:19,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:14:19,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:14:19,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:14:19,084 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:14:19,085 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:14:19,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 19:14:19,086 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl' [2018-12-03 19:14:19,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:14:19,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:14:19,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:14:19,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:14:19,154 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:14:19,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:14:19,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:14:19,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:14:19,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:14:19,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/1) ... [2018-12-03 19:14:19,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:14:19,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:14:19,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:14:19,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:14:19,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (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-12-03 19:14:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:14:19,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:14:19,949 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:14:19,949 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:14:19,950 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:14:19 BoogieIcfgContainer [2018-12-03 19:14:19,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:14:19,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:14:19,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:14:19,954 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:14:19,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:14:19" (1/2) ... [2018-12-03 19:14:19,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b5606f and model type pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:14:19, skipping insertion in model container [2018-12-03 19:14:19,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:14:19" (2/2) ... [2018-12-03 19:14:19,958 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 19:14:19,968 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:14:19,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:14:19,995 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:14:20,031 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:14:20,031 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:14:20,031 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:14:20,031 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:14:20,031 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:14:20,032 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:14:20,032 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:14:20,032 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:14:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 19:14:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:20,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:20,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:20,059 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:20,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-12-03 19:14:20,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:20,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:20,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:20,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:20,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:20,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:20,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:20,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:20,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:20,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:20,373 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 19:14:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:20,435 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 19:14:20,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:20,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:20,449 INFO L225 Difference]: With dead ends: 51 [2018-12-03 19:14:20,449 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 19:14:20,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 19:14:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 19:14:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 19:14:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 19:14:20,511 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 19:14:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:20,511 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 19:14:20,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 19:14:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:20,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:20,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:20,513 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:20,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:20,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-12-03 19:14:20,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:20,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:20,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:20,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:20,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:20,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:20,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:20,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:20,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:20,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:20,678 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 19:14:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:20,722 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 19:14:20,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:20,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:20,725 INFO L225 Difference]: With dead ends: 91 [2018-12-03 19:14:20,725 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 19:14:20,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 19:14:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 19:14:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 19:14:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 19:14:20,746 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 19:14:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:20,746 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 19:14:20,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 19:14:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:20,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:20,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:20,748 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:20,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-12-03 19:14:20,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:20,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:20,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:20,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:20,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:20,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:20,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:20,876 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 19:14:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:20,934 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 19:14:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:20,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:20,945 INFO L225 Difference]: With dead ends: 175 [2018-12-03 19:14:20,945 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 19:14:20,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 19:14:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 19:14:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 19:14:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 19:14:21,004 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 19:14:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:21,004 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 19:14:21,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 19:14:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:21,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:21,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:21,008 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:21,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1764504621, now seen corresponding path program 1 times [2018-12-03 19:14:21,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:21,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:21,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:21,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:21,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:21,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:21,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:14:21,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:21,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:21,134 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-12-03 19:14:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:21,233 INFO L93 Difference]: Finished difference Result 289 states and 398 transitions. [2018-12-03 19:14:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:21,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:14:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:21,236 INFO L225 Difference]: With dead ends: 289 [2018-12-03 19:14:21,236 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 19:14:21,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 19:14:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-12-03 19:14:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 19:14:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions. [2018-12-03 19:14:21,279 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 16 [2018-12-03 19:14:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:21,279 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 236 transitions. [2018-12-03 19:14:21,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2018-12-03 19:14:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:14:21,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:21,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:21,281 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:21,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1764564203, now seen corresponding path program 1 times [2018-12-03 19:14:21,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:21,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:21,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:21,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 19:14:21,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:21,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:14:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:14:21,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:14:21,420 INFO L87 Difference]: Start difference. First operand 173 states and 236 transitions. Second operand 4 states. [2018-12-03 19:14:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:21,635 INFO L93 Difference]: Finished difference Result 314 states and 422 transitions. [2018-12-03 19:14:21,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:14:21,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 19:14:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:21,638 INFO L225 Difference]: With dead ends: 314 [2018-12-03 19:14:21,639 INFO L226 Difference]: Without dead ends: 312 [2018-12-03 19:14:21,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 19:14:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-03 19:14:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 189. [2018-12-03 19:14:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 19:14:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-12-03 19:14:21,707 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 16 [2018-12-03 19:14:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:21,707 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-12-03 19:14:21,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:14:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-12-03 19:14:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:14:21,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:21,711 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:21,711 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:21,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:21,711 INFO L82 PathProgramCache]: Analyzing trace with hash 728287857, now seen corresponding path program 1 times [2018-12-03 19:14:21,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:21,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:21,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:21,977 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:14:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:21,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:21,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:14:21,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:21,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:21,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:21,983 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-12-03 19:14:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:22,101 INFO L93 Difference]: Finished difference Result 561 states and 738 transitions. [2018-12-03 19:14:22,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:22,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 19:14:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:22,105 INFO L225 Difference]: With dead ends: 561 [2018-12-03 19:14:22,105 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 19:14:22,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 19:14:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-12-03 19:14:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 19:14:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 19:14:22,174 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 30 [2018-12-03 19:14:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:22,174 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 19:14:22,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 19:14:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:14:22,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:22,180 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:22,180 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:22,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:22,181 INFO L82 PathProgramCache]: Analyzing trace with hash 470122419, now seen corresponding path program 1 times [2018-12-03 19:14:22,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:22,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:22,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:22,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:22,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:22,382 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:14:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:22,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:14:22,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:14:22,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:14:22,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:14:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:14:22,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:22,389 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 19:14:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:14:22,572 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 19:14:22,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:14:22,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 19:14:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:14:22,582 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 19:14:22,583 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 19:14:22,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:14:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 19:14:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 19:14:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 19:14:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 19:14:22,701 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 19:14:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:14:22,702 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 19:14:22,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:14:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 19:14:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:14:22,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:14:22,708 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:14:22,713 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:14:22,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:14:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1279469045, now seen corresponding path program 1 times [2018-12-03 19:14:22,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:14:22,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:22,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:14:22,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:14:22,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:14:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:14:23,084 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 19:14:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:14:23,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:14:23,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:14:23,180 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 19:14:23,182 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58] [2018-12-03 19:14:23,244 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:14:23,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:14:24,625 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:15:28,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:15:28,621 INFO L272 AbstractInterpreter]: Visited 23 different actions 519 times. Merged at 22 different actions 360 times. Widened at 18 different actions 209 times. Found 111 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 19:15:28,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:28,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:15:28,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:15:28,673 INFO L192 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 [2018-12-03 19:15:28,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:28,690 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:15:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:28,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:15:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:15:29,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:15:29,605 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 19:15:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:15:29,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:15:29,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 19:15:29,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:15:29,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 19:15:29,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 19:15:29,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:15:29,647 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 8 states. [2018-12-03 19:15:30,228 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 19:15:31,200 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 19:15:31,443 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 19:15:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:32,175 INFO L93 Difference]: Finished difference Result 1735 states and 2175 transitions. [2018-12-03 19:15:32,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 19:15:32,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 19:15:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:32,180 INFO L225 Difference]: With dead ends: 1735 [2018-12-03 19:15:32,180 INFO L226 Difference]: Without dead ends: 679 [2018-12-03 19:15:32,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 19:15:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-12-03 19:15:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 609. [2018-12-03 19:15:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-12-03 19:15:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 713 transitions. [2018-12-03 19:15:32,274 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 713 transitions. Word has length 30 [2018-12-03 19:15:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:32,275 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 713 transitions. [2018-12-03 19:15:32,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 19:15:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 713 transitions. [2018-12-03 19:15:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 19:15:32,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:32,280 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 19:15:32,284 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:32,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1017459345, now seen corresponding path program 2 times [2018-12-03 19:15:32,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:32,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:32,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-03 19:15:32,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:32,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:15:32,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:32,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:32,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:32,387 INFO L87 Difference]: Start difference. First operand 609 states and 713 transitions. Second operand 3 states. [2018-12-03 19:15:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:32,406 INFO L93 Difference]: Finished difference Result 619 states and 724 transitions. [2018-12-03 19:15:32,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:32,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 19:15:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:32,407 INFO L225 Difference]: With dead ends: 619 [2018-12-03 19:15:32,407 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:15:32,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:15:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:15:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:15:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:15:32,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 19:15:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:32,410 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:15:32,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:15:32,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:15:32,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:15:32,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:32,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:32,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:32,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:32,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:32,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:32,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:32,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:15:34,255 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-12-03 19:15:34,360 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-03 19:15:34,593 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-12-03 19:15:34,787 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 19:15:35,035 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-12-03 19:15:35,312 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-12-03 19:15:35,564 INFO L444 ceAbstractionStarter]: At program point L353(lines 347 354) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode4 256)) (.cse3 (<= 0 ~send3))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (not (= ~p3_old ~nomsg))) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode4 (* 256 .cse0)) .cse3))) [2018-12-03 19:15:35,564 INFO L444 ceAbstractionStarter]: At program point L465(lines 310 465) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:15:35,565 INFO L444 ceAbstractionStarter]: At program point L432(lines 432 439) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= ~r1 1) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 19:15:35,565 INFO L444 ceAbstractionStarter]: At program point L333(lines 327 334) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode4 256)) (.cse3 (<= 0 ~send3))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (not (= ~p3_old ~nomsg))) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode4 (* 256 .cse0)) .cse3))) [2018-12-03 19:15:35,565 INFO L444 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode4 256)) (.cse3 (<= 0 ~send3))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (not (= ~p3_old ~nomsg))) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode4 (* 256 .cse0)) .cse3))) [2018-12-03 19:15:35,566 INFO L444 ceAbstractionStarter]: At program point L453(lines 453 460) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (<= 1 ULTIMATE.start_check_~tmp~129) (not (= ~p3_old ~nomsg))) [2018-12-03 19:15:35,566 INFO L444 ceAbstractionStarter]: At program point L416(lines 410 417) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and .cse0 (= ~r1 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~r1 1) .cse3 .cse4 .cse5 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:15:35,566 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 467) no Hoare annotation was computed. [2018-12-03 19:15:35,566 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 468) no Hoare annotation was computed. [2018-12-03 19:15:35,566 INFO L444 ceAbstractionStarter]: At program point L317(lines 317 328) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:15:35,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 468) no Hoare annotation was computed. [2018-12-03 19:15:35,567 INFO L444 ceAbstractionStarter]: At program point L338(lines 338 348) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode4 256)) (.cse3 (<= 0 ~send3))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (not (= ~p3_old ~nomsg))) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode4 (* 256 .cse0)) .cse3))) [2018-12-03 19:15:35,567 INFO L444 ceAbstractionStarter]: At program point L396(lines 390 397) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~r1 1) .cse3 .cse4 .cse5 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:15:35,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 468) no Hoare annotation was computed. [2018-12-03 19:15:35,567 INFO L444 ceAbstractionStarter]: At program point L376(lines 367 377) the Hoare annotation is: (let ((.cse5 (div ~mode4 256))) (let ((.cse6 (<= .cse5 0)) (.cse0 (<= ~send3 127)) (.cse7 (<= 1 ~mode4)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3) (= ~mode4 (* 256 .cse5))) (and .cse6 .cse0 .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4)))) [2018-12-03 19:15:35,568 INFO L444 ceAbstractionStarter]: At program point L401(lines 401 411) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~r1 1) .cse3 .cse4 .cse5 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:15:35,568 INFO L444 ceAbstractionStarter]: At program point L459(lines 459 466) the Hoare annotation is: false [2018-12-03 19:15:35,568 INFO L444 ceAbstractionStarter]: At program point L381(lines 381 391) the Hoare annotation is: (let ((.cse5 (div ~mode4 256))) (let ((.cse6 (<= .cse5 0)) (.cse0 (<= ~send3 127)) (.cse7 (<= 1 ~mode4)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3) (= ~mode4 (* 256 .cse5))) (and .cse6 .cse0 .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4)))) [2018-12-03 19:15:35,568 INFO L444 ceAbstractionStarter]: At program point L443(lines 438 444) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~129) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 19:15:35,590 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:15:35 BoogieIcfgContainer [2018-12-03 19:15:35,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:15:35,591 INFO L168 Benchmark]: Toolchain (without parser) took 76439.09 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -875.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-12-03 19:15:35,593 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:15:35,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:15:35,594 INFO L168 Benchmark]: Boogie Preprocessor took 35.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:15:35,594 INFO L168 Benchmark]: RCFGBuilder took 716.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 19:15:35,595 INFO L168 Benchmark]: TraceAbstraction took 75639.21 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -907.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-12-03 19:15:35,599 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 716.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75639.21 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -907.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 467]: 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: 367]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~129) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && 1 <= check_~tmp~129) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 75.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 265 SDtfs, 237 SDslu, 221 SDs, 0 SdLazy, 176 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 65.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 205 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 345 NumberOfFragments, 890 HoareAnnotationTreeSize, 15 FomulaSimplifications, 16087 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 896 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 31857 SizeOfPredicates, 8 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 126/154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...