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_compound_oct_cong.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 17:54:52,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:54:52,107 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:54:52,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:54:52,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:54:52,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:54:52,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:54:52,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:54:52,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:54:52,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:54:52,135 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:54:52,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:54:52,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:54:52,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:54:52,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:54:52,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:54:52,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:54:52,142 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:54:52,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:54:52,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:54:52,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:54:52,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:54:52,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:54:52,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:54:52,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:54:52,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:54:52,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:54:52,156 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:54:52,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:54:52,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:54:52,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:54:52,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:54:52,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:54:52,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:54:52,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:54:52,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:54:52,162 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:54:52,175 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:54:52,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:54:52,176 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:54:52,176 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:54:52,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:54:52,176 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:54:52,176 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:54:52,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:54:52,177 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:54:52,177 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:54:52,177 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:54:52,177 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:54:52,178 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:54:52,178 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:54:52,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:54:52,179 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:54:52,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:54:52,179 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:54:52,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:54:52,179 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:54:52,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:54:52,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:54:52,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:54:52,180 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:54:52,180 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:54:52,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:54:52,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:54:52,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:54:52,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:54:52,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:54:52,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:54:52,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:54:52,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:54:52,182 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:54:52,182 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:54:52,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:54:52,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:54:52,183 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:54:52,183 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:54:52,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:54:52,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:54:52,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:54:52,253 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:54:52,254 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:54:52,255 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 17:54:52,255 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 17:54:52,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:54:52,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:54:52,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:54:52,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:54:52,344 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:54:52,362 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,377 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:54:52,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:54:52,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:54:52,388 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:54:52,400 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,400 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,404 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,404 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,415 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,418 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,422 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 05:54:52" (1/1) ... [2018-12-03 17:54:52,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:54:52,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:54:52,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:54:52,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:54:52,428 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 05:54:52" (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 17:54:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:54:52,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:54:53,234 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:54:53,234 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:54:53,235 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 05:54:53 BoogieIcfgContainer [2018-12-03 17:54:53,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:54:53,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:54:53,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:54:53,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:54:53,241 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 05:54:52" (1/2) ... [2018-12-03 17:54:53,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c7b38f 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 05:54:53, skipping insertion in model container [2018-12-03 17:54:53,242 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 05:54:53" (2/2) ... [2018-12-03 17:54:53,246 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 17:54:53,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:54:53,266 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:54:53,282 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:54:53,314 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:54:53,314 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:54:53,314 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:54:53,314 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:54:53,314 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:54:53,315 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:54:53,315 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:54:53,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:54:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 17:54:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:53,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:53,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:53,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:53,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:53,349 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-12-03 17:54:53,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:53,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:53,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:53,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:53,592 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 17:54:53,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:53,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:53,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:53,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:53,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:53,616 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 17:54:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:53,674 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 17:54:53,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:53,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:54:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:53,688 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:54:53,688 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:54:53,693 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 17:54:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:54:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 17:54:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:54:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 17:54:53,750 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 17:54:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:53,750 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 17:54:53,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 17:54:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:53,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:53,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:53,752 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:53,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-12-03 17:54:53,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:53,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:53,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:53,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:53,953 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 17:54:53,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:53,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:53,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:53,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:53,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:53,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:53,962 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 17:54:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:54,038 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 17:54:54,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:54,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:54:54,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:54,045 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:54:54,045 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:54:54,046 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 17:54:54,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:54:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 17:54:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:54:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 17:54:54,080 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 17:54:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:54,081 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 17:54:54,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 17:54:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:54,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:54,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:54,083 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:54,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-12-03 17:54:54,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:54,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:54,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:54,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:54,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:54,240 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 17:54:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:54,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:54,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:54,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:54,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:54,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:54,242 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 17:54:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:54,332 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 17:54:54,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:54,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:54:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:54,340 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:54:54,340 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 17:54:54,341 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 17:54:54,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 17:54:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 17:54:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:54:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 17:54:54,388 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 17:54:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:54,389 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 17:54:54,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 17:54:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:54,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:54,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:54,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:54,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1764504621, now seen corresponding path program 1 times [2018-12-03 17:54:54,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:54,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:54,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:54,506 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 17:54:54,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:54,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:54,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:54,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:54,510 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-12-03 17:54:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:54,616 INFO L93 Difference]: Finished difference Result 289 states and 398 transitions. [2018-12-03 17:54:54,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:54,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:54:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:54,619 INFO L225 Difference]: With dead ends: 289 [2018-12-03 17:54:54,619 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 17:54:54,621 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 17:54:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 17:54:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-12-03 17:54:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 17:54:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions. [2018-12-03 17:54:54,651 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 16 [2018-12-03 17:54:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:54,651 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 236 transitions. [2018-12-03 17:54:54,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2018-12-03 17:54:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:54,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:54,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:54,653 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:54,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:54,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1764564203, now seen corresponding path program 1 times [2018-12-03 17:54:54,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:54,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:54,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:54,777 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 17:54:54,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:54,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:54:54,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:54,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:54:54,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:54:54,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:54:54,780 INFO L87 Difference]: Start difference. First operand 173 states and 236 transitions. Second operand 4 states. [2018-12-03 17:54:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:55,076 INFO L93 Difference]: Finished difference Result 314 states and 422 transitions. [2018-12-03 17:54:55,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:54:55,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 17:54:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:55,079 INFO L225 Difference]: With dead ends: 314 [2018-12-03 17:54:55,080 INFO L226 Difference]: Without dead ends: 312 [2018-12-03 17:54:55,081 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 17:54:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-03 17:54:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 189. [2018-12-03 17:54:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 17:54:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-12-03 17:54:55,154 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 16 [2018-12-03 17:54:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:55,154 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-12-03 17:54:55,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:54:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-12-03 17:54:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:54:55,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:55,157 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 17:54:55,157 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:55,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash 728287857, now seen corresponding path program 1 times [2018-12-03 17:54:55,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:55,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:55,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:55,428 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:54:55,431 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 17:54:55,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:55,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:55,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:55,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:55,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:55,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:55,434 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-12-03 17:54:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:55,560 INFO L93 Difference]: Finished difference Result 561 states and 738 transitions. [2018-12-03 17:54:55,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:55,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 17:54:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:55,564 INFO L225 Difference]: With dead ends: 561 [2018-12-03 17:54:55,564 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 17:54:55,566 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 17:54:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 17:54:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-12-03 17:54:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 17:54:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 17:54:55,646 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 30 [2018-12-03 17:54:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:55,647 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 17:54:55,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 17:54:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:54:55,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:55,650 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 17:54:55,650 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:55,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:55,650 INFO L82 PathProgramCache]: Analyzing trace with hash 470122419, now seen corresponding path program 1 times [2018-12-03 17:54:55,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:55,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:55,961 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:54:55,965 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 17:54:55,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:55,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:55,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:55,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:55,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:55,967 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 17:54:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:56,151 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 17:54:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:56,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 17:54:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:56,156 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 17:54:56,156 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 17:54:56,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 17:54:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 17:54:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 17:54:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 17:54:56,279 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 17:54:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:56,280 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 17:54:56,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 17:54:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:54:56,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:56,284 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 17:54:56,284 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:56,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1279469045, now seen corresponding path program 1 times [2018-12-03 17:54:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:56,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:56,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:56,529 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 17:54:56,607 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 17:54:56,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:54:56,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:54:56,609 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 17:54:56,612 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 17:54:56,695 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:54:56,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:54:58,223 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:56:27,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:56:27,322 INFO L272 AbstractInterpreter]: Visited 23 different actions 508 times. Merged at 22 different actions 359 times. Widened at 20 different actions 217 times. Found 102 fixpoints after 16 different actions. Largest state had 0 variables. [2018-12-03 17:56:27,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:27,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:56:27,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:56:27,336 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 17:56:27,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:27,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:56:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:27,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:56:27,556 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 17:56:27,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:56:27,724 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 17:56:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:56:27,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 17:56:27,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:56:27,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:56:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:56:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:56:27,769 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 8 states. [2018-12-03 17:56:28,515 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 17:56:28,732 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:56:29,465 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:56:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:30,710 INFO L93 Difference]: Finished difference Result 1735 states and 2175 transitions. [2018-12-03 17:56:30,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:56:30,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 17:56:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:30,716 INFO L225 Difference]: With dead ends: 1735 [2018-12-03 17:56:30,716 INFO L226 Difference]: Without dead ends: 679 [2018-12-03 17:56:30,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:56:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-12-03 17:56:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 609. [2018-12-03 17:56:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-12-03 17:56:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 713 transitions. [2018-12-03 17:56:30,801 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 713 transitions. Word has length 30 [2018-12-03 17:56:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:30,801 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 713 transitions. [2018-12-03 17:56:30,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:56:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 713 transitions. [2018-12-03 17:56:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:56:30,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:30,809 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 17:56:30,809 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:30,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1017459345, now seen corresponding path program 2 times [2018-12-03 17:56:30,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:30,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:30,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:30,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:30,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:30,913 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 17:56:30,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:30,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:30,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:30,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:30,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:30,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:30,915 INFO L87 Difference]: Start difference. First operand 609 states and 713 transitions. Second operand 3 states. [2018-12-03 17:56:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:30,934 INFO L93 Difference]: Finished difference Result 619 states and 724 transitions. [2018-12-03 17:56:30,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:30,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 17:56:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:30,935 INFO L225 Difference]: With dead ends: 619 [2018-12-03 17:56:30,935 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:56:30,937 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 17:56:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:56:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:56:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:56:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:56:30,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 17:56:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:30,938 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:56:30,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:56:30,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:56:30,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:56:31,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:31,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:31,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:31,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:31,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:31,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:31,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:31,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:32,369 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-12-03 17:56:32,608 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-03 17:56:32,831 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-12-03 17:56:33,048 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 17:56:33,261 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-12-03 17:56:33,513 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-12-03 17:56:33,736 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 17:56:33,736 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 17:56:33,737 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 17:56:33,737 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 17:56:33,737 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 17:56:33,737 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 17:56:33,738 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 17:56:33,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 468) no Hoare annotation was computed. [2018-12-03 17:56:33,738 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 17:56:33,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 468) no Hoare annotation was computed. [2018-12-03 17:56:33,739 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 17:56:33,739 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 17:56:33,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 468) no Hoare annotation was computed. [2018-12-03 17:56:33,739 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 17:56:33,739 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 17:56:33,740 INFO L444 ceAbstractionStarter]: At program point L459(lines 459 466) the Hoare annotation is: false [2018-12-03 17:56:33,740 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 17:56:33,740 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 17:56:33,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 467) no Hoare annotation was computed. [2018-12-03 17:56:33,760 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 05:56:33 BoogieIcfgContainer [2018-12-03 17:56:33,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:56:33,762 INFO L168 Benchmark]: Toolchain (without parser) took 101419.82 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -984.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-12-03 17:56:33,763 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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 17:56:33,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.98 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 17:56:33,764 INFO L168 Benchmark]: Boogie Preprocessor took 39.20 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 17:56:33,765 INFO L168 Benchmark]: RCFGBuilder took 808.48 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 17:56:33,765 INFO L168 Benchmark]: TraceAbstraction took 100523.91 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-12-03 17:56:33,770 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.19 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 42.98 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 39.20 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 808.48 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 100523.91 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 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, 100.4s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 265 SDtfs, 237 SDslu, 221 SDs, 0 SdLazy, 176 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.7s 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, 90.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s 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.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s 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...