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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:15,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:15,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:15,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:15,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:15,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:15,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:15,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:15,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:15,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:15,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:15,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:15,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:15,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:15,453 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:15,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:15,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:15,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:15,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:15,461 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:15,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:15,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:15,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:15,467 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:15,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:15,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:15,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:15,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:15,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:15,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:15,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:15,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:15,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:15,475 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:15,476 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:15,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:15,477 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:41:15,498 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:15,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:15,500 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:15,501 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:15,501 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:15,501 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:15,501 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:15,501 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:15,502 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:15,502 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:15,503 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:15,503 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:15,503 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:15,503 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:15,503 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:15,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:15,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:15,504 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:15,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:15,506 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:15,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:15,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:15,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:15,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:15,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:15,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:15,508 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:15,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:15,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:15,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:15,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:15,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:15,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:15,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:15,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:15,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:15,511 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:15,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:15,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:15,511 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:15,511 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:15,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:15,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:15,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:15,574 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:15,575 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:15,575 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-12-03 15:41:15,576 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-12-03 15:41:15,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:15,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:15,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:15,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:15,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:15,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:15,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:15,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:15,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:15,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/1) ... [2018-12-03 15:41:15,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:15,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:15,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:15,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:15,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (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 15:41:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:16,582 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:16,583 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:16,583 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:16 BoogieIcfgContainer [2018-12-03 15:41:16,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:16,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:16,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:16,588 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:16,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:15" (1/2) ... [2018-12-03 15:41:16,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fcbdb2 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:16, skipping insertion in model container [2018-12-03 15:41:16,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:16" (2/2) ... [2018-12-03 15:41:16,591 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-12-03 15:41:16,602 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:16,611 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:16,630 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:16,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:16,667 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:16,667 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:16,667 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:16,667 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:16,667 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:16,668 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:16,668 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-03 15:41:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:41:16,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:16,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:16,697 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:16,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-12-03 15:41:16,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:16,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:16,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:16,959 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 15:41:16,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:16,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:16,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:16,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:16,987 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-12-03 15:41:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:17,304 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-12-03 15:41:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:17,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:41:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:17,320 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:41:17,320 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:41:17,324 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 15:41:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:41:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:41:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:41:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-12-03 15:41:17,373 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-12-03 15:41:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:17,373 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-12-03 15:41:17,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-12-03 15:41:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:41:17,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:17,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:17,377 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:17,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-12-03 15:41:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:17,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:17,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:17,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:17,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:17,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:17,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:17,534 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-12-03 15:41:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:17,888 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-12-03 15:41:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:17,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 15:41:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:17,891 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:41:17,891 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:41:17,892 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 15:41:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:41:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:41:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:41:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-12-03 15:41:17,906 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-12-03 15:41:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:17,907 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-12-03 15:41:17,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-12-03 15:41:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:41:17,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:17,909 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:17,909 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:17,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-12-03 15:41:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:17,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:41:17,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:17,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:17,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:17,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:17,998 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-12-03 15:41:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:18,177 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-12-03 15:41:18,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:18,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 15:41:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:18,181 INFO L225 Difference]: With dead ends: 110 [2018-12-03 15:41:18,181 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:41:18,182 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 15:41:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:41:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:41:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:41:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-12-03 15:41:18,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-12-03 15:41:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:18,205 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-12-03 15:41:18,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-12-03 15:41:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:41:18,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:18,207 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:18,207 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:18,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-12-03 15:41:18,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:18,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:18,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:18,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:18,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:18,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:18,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:18,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:18,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:18,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:18,349 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-12-03 15:41:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:18,857 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-12-03 15:41:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:18,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 15:41:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:18,859 INFO L225 Difference]: With dead ends: 135 [2018-12-03 15:41:18,859 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:41:18,860 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 15:41:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:41:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:41:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:41:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-12-03 15:41:18,884 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-12-03 15:41:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:18,886 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-12-03 15:41:18,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-12-03 15:41:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:41:18,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:18,888 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:18,888 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:18,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:18,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-12-03 15:41:18,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:18,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:18,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:18,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:18,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:41:18,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:18,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:18,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:18,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:18,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:18,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:18,984 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-12-03 15:41:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:19,302 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-12-03 15:41:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:19,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 15:41:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:19,304 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:41:19,304 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:41:19,306 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 15:41:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:41:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:41:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:41:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-12-03 15:41:19,336 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-12-03 15:41:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:19,337 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-12-03 15:41:19,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-12-03 15:41:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:41:19,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:19,342 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:19,342 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:19,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:19,343 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-12-03 15:41:19,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:19,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:19,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:19,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:19,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 15:41:19,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:19,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:19,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:19,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:19,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:19,459 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-12-03 15:41:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:19,680 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-12-03 15:41:19,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:19,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 15:41:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:19,684 INFO L225 Difference]: With dead ends: 168 [2018-12-03 15:41:19,685 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:41:19,686 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 15:41:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:41:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 15:41:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:41:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-12-03 15:41:19,710 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-12-03 15:41:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:19,713 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-12-03 15:41:19,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-12-03 15:41:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:41:19,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:19,715 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:19,716 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:19,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-12-03 15:41:19,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:19,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:19,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:19,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:19,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 15:41:19,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:19,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:19,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:19,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:19,811 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-12-03 15:41:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:20,071 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-12-03 15:41:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:20,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-03 15:41:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:20,073 INFO L225 Difference]: With dead ends: 185 [2018-12-03 15:41:20,073 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:41:20,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:41:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 15:41:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:41:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-12-03 15:41:20,111 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-12-03 15:41:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:20,111 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-12-03 15:41:20,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-12-03 15:41:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:41:20,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:20,118 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:20,119 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:20,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:20,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-12-03 15:41:20,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:20,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:20,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:20,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-03 15:41:20,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:20,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:20,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:20,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:20,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:20,221 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-12-03 15:41:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:20,427 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-12-03 15:41:20,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:20,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-03 15:41:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:20,431 INFO L225 Difference]: With dead ends: 285 [2018-12-03 15:41:20,431 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 15:41:20,431 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 15:41:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 15:41:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 15:41:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 15:41:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-12-03 15:41:20,460 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-12-03 15:41:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:20,460 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-12-03 15:41:20,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-12-03 15:41:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:41:20,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:20,463 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:20,463 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:20,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-12-03 15:41:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:20,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:20,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:20,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:20,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:20,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:20,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:20,661 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-03 15:41:20,663 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [52], [58], [64], [76], [90], [98], [102] [2018-12-03 15:41:20,733 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:20,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:21,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:21,513 INFO L272 AbstractInterpreter]: Visited 23 different actions 60 times. Merged at 20 different actions 29 times. Never widened. Found 12 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 15:41:21,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:21,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:21,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:21,558 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 15:41:21,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:21,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:21,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 15:41:21,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 15:41:21,778 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:41:21,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 15:41:21,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:21,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:21,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:21,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:21,780 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 3 states. [2018-12-03 15:41:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:22,107 INFO L93 Difference]: Finished difference Result 375 states and 539 transitions. [2018-12-03 15:41:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:22,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-03 15:41:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:22,113 INFO L225 Difference]: With dead ends: 375 [2018-12-03 15:41:22,113 INFO L226 Difference]: Without dead ends: 278 [2018-12-03 15:41:22,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-03 15:41:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-03 15:41:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-03 15:41:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 394 transitions. [2018-12-03 15:41:22,165 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 394 transitions. Word has length 49 [2018-12-03 15:41:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:22,166 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 394 transitions. [2018-12-03 15:41:22,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 394 transitions. [2018-12-03 15:41:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:41:22,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:22,168 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:22,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:22,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash -257050491, now seen corresponding path program 1 times [2018-12-03 15:41:22,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:22,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:22,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 15:41:22,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:22,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:22,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:22,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:22,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:22,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:22,256 INFO L87 Difference]: Start difference. First operand 278 states and 394 transitions. Second operand 3 states. [2018-12-03 15:41:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:22,659 INFO L93 Difference]: Finished difference Result 469 states and 672 transitions. [2018-12-03 15:41:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:22,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 15:41:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:22,662 INFO L225 Difference]: With dead ends: 469 [2018-12-03 15:41:22,664 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 15:41:22,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:41:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 15:41:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-12-03 15:41:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-03 15:41:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 398 transitions. [2018-12-03 15:41:22,698 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 398 transitions. Word has length 59 [2018-12-03 15:41:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:22,698 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 398 transitions. [2018-12-03 15:41:22,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 398 transitions. [2018-12-03 15:41:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:41:22,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:22,701 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:22,701 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:22,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash -938872509, now seen corresponding path program 1 times [2018-12-03 15:41:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:22,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:22,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-03 15:41:22,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:22,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:22,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:22,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:22,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:22,792 INFO L87 Difference]: Start difference. First operand 282 states and 398 transitions. Second operand 3 states. [2018-12-03 15:41:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:23,246 INFO L93 Difference]: Finished difference Result 473 states and 674 transitions. [2018-12-03 15:41:23,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:23,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-03 15:41:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:23,249 INFO L225 Difference]: With dead ends: 473 [2018-12-03 15:41:23,249 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 15:41:23,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:41:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 15:41:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-12-03 15:41:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-03 15:41:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 395 transitions. [2018-12-03 15:41:23,284 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 395 transitions. Word has length 63 [2018-12-03 15:41:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:23,284 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 395 transitions. [2018-12-03 15:41:23,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 395 transitions. [2018-12-03 15:41:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:41:23,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:23,287 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:23,287 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:23,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:23,287 INFO L82 PathProgramCache]: Analyzing trace with hash 132728537, now seen corresponding path program 1 times [2018-12-03 15:41:23,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:23,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:23,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:23,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:23,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 93 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:23,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:23,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:23,472 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-12-03 15:41:23,472 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [52], [58], [64], [74], [76], [82], [90], [92], [98], [102] [2018-12-03 15:41:23,478 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:23,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:23,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:23,970 INFO L272 AbstractInterpreter]: Visited 26 different actions 67 times. Merged at 23 different actions 32 times. Never widened. Found 14 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 15:41:24,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:24,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:24,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:24,009 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:24,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:24,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:24,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 15:41:24,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 15:41:24,283 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:41:24,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 15:41:24,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:24,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:24,285 INFO L87 Difference]: Start difference. First operand 282 states and 395 transitions. Second operand 3 states. [2018-12-03 15:41:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:24,518 INFO L93 Difference]: Finished difference Result 563 states and 801 transitions. [2018-12-03 15:41:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:24,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-03 15:41:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:24,523 INFO L225 Difference]: With dead ends: 563 [2018-12-03 15:41:24,523 INFO L226 Difference]: Without dead ends: 372 [2018-12-03 15:41:24,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-03 15:41:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-12-03 15:41:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-03 15:41:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 526 transitions. [2018-12-03 15:41:24,565 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 526 transitions. Word has length 64 [2018-12-03 15:41:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:24,566 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 526 transitions. [2018-12-03 15:41:24,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 526 transitions. [2018-12-03 15:41:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:41:24,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:24,568 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:24,568 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:24,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 164672333, now seen corresponding path program 1 times [2018-12-03 15:41:24,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:24,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:24,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:24,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:24,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 225 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-12-03 15:41:24,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:24,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:24,735 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2018-12-03 15:41:24,735 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [52], [56], [58], [62], [64], [68], [74], [76], [78], [82], [84], [90], [92], [98], [102] [2018-12-03 15:41:24,739 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:24,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:25,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:25,250 INFO L272 AbstractInterpreter]: Visited 31 different actions 104 times. Merged at 25 different actions 51 times. Widened at 2 different actions 2 times. Found 28 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 15:41:25,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:25,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:25,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:25,294 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:25,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:25,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:25,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-03 15:41:25,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-03 15:41:25,682 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:41:25,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 15:41:25,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:25,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:25,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:25,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:25,684 INFO L87 Difference]: Start difference. First operand 372 states and 526 transitions. Second operand 3 states. [2018-12-03 15:41:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:26,238 INFO L93 Difference]: Finished difference Result 743 states and 1051 transitions. [2018-12-03 15:41:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:26,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-03 15:41:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:26,242 INFO L225 Difference]: With dead ends: 743 [2018-12-03 15:41:26,242 INFO L226 Difference]: Without dead ends: 372 [2018-12-03 15:41:26,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-03 15:41:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-12-03 15:41:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-03 15:41:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 507 transitions. [2018-12-03 15:41:26,279 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 507 transitions. Word has length 104 [2018-12-03 15:41:26,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:26,279 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 507 transitions. [2018-12-03 15:41:26,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 507 transitions. [2018-12-03 15:41:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 15:41:26,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:26,281 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:26,281 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:26,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1902745589, now seen corresponding path program 1 times [2018-12-03 15:41:26,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:26,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:26,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 267 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-03 15:41:26,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:26,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:26,464 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-12-03 15:41:26,464 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [52], [58], [62], [64], [68], [74], [76], [78], [82], [84], [90], [92], [94], [98], [100], [102] [2018-12-03 15:41:26,474 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:26,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:26,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:26,780 INFO L272 AbstractInterpreter]: Visited 32 different actions 81 times. Merged at 27 different actions 37 times. Never widened. Found 20 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 15:41:26,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:26,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:26,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:26,817 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:26,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:26,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:26,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-12-03 15:41:27,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-12-03 15:41:27,103 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:41:27,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-03 15:41:27,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:27,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:27,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:27,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:41:27,104 INFO L87 Difference]: Start difference. First operand 372 states and 507 transitions. Second operand 3 states. [2018-12-03 15:41:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:27,394 INFO L93 Difference]: Finished difference Result 707 states and 967 transitions. [2018-12-03 15:41:27,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:27,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-03 15:41:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:27,398 INFO L225 Difference]: With dead ends: 707 [2018-12-03 15:41:27,398 INFO L226 Difference]: Without dead ends: 426 [2018-12-03 15:41:27,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:41:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-12-03 15:41:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-12-03 15:41:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-12-03 15:41:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 569 transitions. [2018-12-03 15:41:27,434 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 569 transitions. Word has length 117 [2018-12-03 15:41:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:27,434 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 569 transitions. [2018-12-03 15:41:27,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 569 transitions. [2018-12-03 15:41:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 15:41:27,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:27,437 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:27,438 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:27,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:27,438 INFO L82 PathProgramCache]: Analyzing trace with hash 539250669, now seen corresponding path program 1 times [2018-12-03 15:41:27,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:27,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:27,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:27,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 352 proven. 8 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-12-03 15:41:27,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:27,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:27,596 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-12-03 15:41:27,596 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [52], [58], [62], [64], [68], [74], [76], [78], [82], [84], [88], [90], [92], [94], [98], [100], [102] [2018-12-03 15:41:27,598 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:27,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:27,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:27,954 INFO L272 AbstractInterpreter]: Visited 33 different actions 118 times. Merged at 26 different actions 62 times. Widened at 1 different actions 1 times. Found 32 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 15:41:27,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:27,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:27,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:27,993 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:28,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:28,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:28,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 352 proven. 8 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-12-03 15:41:28,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 352 proven. 8 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-12-03 15:41:28,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:28,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:28,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:28,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:28,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:28,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:28,358 INFO L87 Difference]: Start difference. First operand 426 states and 569 transitions. Second operand 4 states. [2018-12-03 15:41:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:29,123 INFO L93 Difference]: Finished difference Result 1037 states and 1368 transitions. [2018-12-03 15:41:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:29,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-03 15:41:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:29,129 INFO L225 Difference]: With dead ends: 1037 [2018-12-03 15:41:29,129 INFO L226 Difference]: Without dead ends: 584 [2018-12-03 15:41:29,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-12-03 15:41:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 419. [2018-12-03 15:41:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 15:41:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 539 transitions. [2018-12-03 15:41:29,184 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 539 transitions. Word has length 140 [2018-12-03 15:41:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:29,185 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 539 transitions. [2018-12-03 15:41:29,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 539 transitions. [2018-12-03 15:41:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 15:41:29,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:29,190 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 15, 15, 15, 15, 12, 12, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:29,190 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:29,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash 766689269, now seen corresponding path program 1 times [2018-12-03 15:41:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:29,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2018-12-03 15:41:29,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:29,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:29,347 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:29,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:29,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:29,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:29,348 INFO L87 Difference]: Start difference. First operand 419 states and 539 transitions. Second operand 3 states. [2018-12-03 15:41:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:29,837 INFO L93 Difference]: Finished difference Result 829 states and 1068 transitions. [2018-12-03 15:41:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:29,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-12-03 15:41:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:29,840 INFO L225 Difference]: With dead ends: 829 [2018-12-03 15:41:29,840 INFO L226 Difference]: Without dead ends: 416 [2018-12-03 15:41:29,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:41:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-12-03 15:41:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2018-12-03 15:41:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-03 15:41:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 525 transitions. [2018-12-03 15:41:29,902 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 525 transitions. Word has length 206 [2018-12-03 15:41:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:29,903 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 525 transitions. [2018-12-03 15:41:29,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 525 transitions. [2018-12-03 15:41:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 15:41:29,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:29,907 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 15, 15, 12, 12, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:29,908 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:29,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:29,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1039035321, now seen corresponding path program 1 times [2018-12-03 15:41:29,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:29,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:29,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:29,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:29,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2018-12-03 15:41:30,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:30,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:30,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:30,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:30,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:30,078 INFO L87 Difference]: Start difference. First operand 416 states and 525 transitions. Second operand 3 states. [2018-12-03 15:41:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:30,562 INFO L93 Difference]: Finished difference Result 822 states and 1039 transitions. [2018-12-03 15:41:30,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:30,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-12-03 15:41:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:30,566 INFO L225 Difference]: With dead ends: 822 [2018-12-03 15:41:30,566 INFO L226 Difference]: Without dead ends: 413 [2018-12-03 15:41:30,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:41:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-12-03 15:41:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-12-03 15:41:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-03 15:41:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 511 transitions. [2018-12-03 15:41:30,616 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 511 transitions. Word has length 212 [2018-12-03 15:41:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:30,616 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 511 transitions. [2018-12-03 15:41:30,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 511 transitions. [2018-12-03 15:41:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 15:41:30,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:30,619 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 17, 16, 15, 15, 12, 12, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:30,620 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:30,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 87762693, now seen corresponding path program 1 times [2018-12-03 15:41:30,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:30,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:30,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2018-12-03 15:41:30,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:30,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:30,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:30,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:30,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:30,724 INFO L87 Difference]: Start difference. First operand 413 states and 511 transitions. Second operand 3 states. [2018-12-03 15:41:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:31,092 INFO L93 Difference]: Finished difference Result 822 states and 1021 transitions. [2018-12-03 15:41:31,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:31,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-12-03 15:41:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:31,095 INFO L225 Difference]: With dead ends: 822 [2018-12-03 15:41:31,095 INFO L226 Difference]: Without dead ends: 417 [2018-12-03 15:41:31,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:41:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-03 15:41:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-03 15:41:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-03 15:41:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 508 transitions. [2018-12-03 15:41:31,141 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 508 transitions. Word has length 219 [2018-12-03 15:41:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:31,142 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 508 transitions. [2018-12-03 15:41:31,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 508 transitions. [2018-12-03 15:41:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-03 15:41:31,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:31,145 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 20, 19, 18, 15, 12, 12, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:31,145 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:31,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:31,146 INFO L82 PathProgramCache]: Analyzing trace with hash -18857925, now seen corresponding path program 1 times [2018-12-03 15:41:31,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:31,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:31,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:31,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:31,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1997 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-12-03 15:41:31,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:31,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:31,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:31,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:31,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:31,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:31,257 INFO L87 Difference]: Start difference. First operand 417 states and 508 transitions. Second operand 3 states. [2018-12-03 15:41:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:31,399 INFO L93 Difference]: Finished difference Result 876 states and 1074 transitions. [2018-12-03 15:41:31,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:31,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2018-12-03 15:41:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:31,402 INFO L225 Difference]: With dead ends: 876 [2018-12-03 15:41:31,403 INFO L226 Difference]: Without dead ends: 467 [2018-12-03 15:41:31,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:41:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-12-03 15:41:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2018-12-03 15:41:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-12-03 15:41:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 558 transitions. [2018-12-03 15:41:31,452 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 558 transitions. Word has length 243 [2018-12-03 15:41:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:31,452 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 558 transitions. [2018-12-03 15:41:31,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 558 transitions. [2018-12-03 15:41:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-03 15:41:31,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:31,456 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 23, 22, 21, 18, 15, 12, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:31,456 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:31,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:31,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2062399733, now seen corresponding path program 1 times [2018-12-03 15:41:31,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:31,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:31,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:31,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:31,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1515 proven. 8 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-03 15:41:31,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:31,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:31,682 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 274 with the following transitions: [2018-12-03 15:41:31,682 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [44], [46], [50], [52], [56], [58], [62], [64], [68], [70], [74], [76], [78], [82], [84], [88], [90], [92], [94], [98], [100], [102] [2018-12-03 15:41:31,684 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:31,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:32,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:32,035 INFO L272 AbstractInterpreter]: Visited 37 different actions 94 times. Merged at 28 different actions 40 times. Never widened. Found 30 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 15:41:32,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:32,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:32,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:32,067 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:32,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:32,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:32,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1515 proven. 8 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-03 15:41:32,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1515 proven. 8 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-03 15:41:32,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:32,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:32,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:32,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:32,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:32,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:32,580 INFO L87 Difference]: Start difference. First operand 467 states and 558 transitions. Second operand 4 states. [2018-12-03 15:41:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:32,820 INFO L93 Difference]: Finished difference Result 707 states and 847 transitions. [2018-12-03 15:41:32,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:41:32,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2018-12-03 15:41:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:32,821 INFO L225 Difference]: With dead ends: 707 [2018-12-03 15:41:32,821 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:41:32,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:41:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:41:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:41:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:41:32,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2018-12-03 15:41:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:32,824 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:41:32,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:41:32,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:41:32,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:41:32,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:32,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:32,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:32,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:33,996 WARN L180 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-12-03 15:41:34,251 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-12-03 15:41:34,448 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-12-03 15:41:34,591 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2018-12-03 15:41:34,777 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-12-03 15:41:35,264 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-12-03 15:41:35,467 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-12-03 15:41:35,778 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-12-03 15:41:35,893 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-12-03 15:41:35,921 INFO L444 ceAbstractionStarter]: At program point L444(lines 441 466) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-12-03 15:41:35,922 INFO L444 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3) (and .cse4 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse4 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3))) [2018-12-03 15:41:35,922 INFO L444 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-12-03 15:41:35,922 INFO L444 ceAbstractionStarter]: At program point L457(lines 457 478) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-12-03 15:41:35,923 INFO L444 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-12-03 15:41:35,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-12-03 15:41:35,923 INFO L444 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2))) [2018-12-03 15:41:35,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-12-03 15:41:35,924 INFO L444 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-12-03 15:41:35,924 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-12-03 15:41:35,924 INFO L444 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2))) [2018-12-03 15:41:35,924 INFO L444 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2))) [2018-12-03 15:41:35,924 INFO L444 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-12-03 15:41:35,924 INFO L444 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse5 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2 .cse3 .cse4 .cse5) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2 .cse3 .cse4 .cse5))) [2018-12-03 15:41:35,925 INFO L444 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2))) [2018-12-03 15:41:35,925 INFO L444 ceAbstractionStarter]: At program point L480(lines 477 490) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-12-03 15:41:35,925 INFO L444 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2))) [2018-12-03 15:41:35,925 INFO L444 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))))) [2018-12-03 15:41:35,925 INFO L444 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (and .cse0 .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))))) [2018-12-03 15:41:35,926 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2))) [2018-12-03 15:41:35,926 INFO L444 ceAbstractionStarter]: At program point L431(lines 431 442) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-12-03 15:41:35,926 INFO L444 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-12-03 15:41:35,926 INFO L444 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-12-03 15:41:35,926 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-12-03 15:41:35,926 INFO L444 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-12-03 15:41:35,943 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:35 BoogieIcfgContainer [2018-12-03 15:41:35,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:41:35,944 INFO L168 Benchmark]: Toolchain (without parser) took 20303.13 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -924.8 MB). Peak memory consumption was 929.4 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:35,945 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 15:41:35,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.34 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 15:41:35,946 INFO L168 Benchmark]: Boogie Preprocessor took 70.37 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 15:41:35,947 INFO L168 Benchmark]: RCFGBuilder took 823.63 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 15:41:35,947 INFO L168 Benchmark]: TraceAbstraction took 19358.78 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -956.5 MB). Peak memory consumption was 897.6 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:35,951 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.21 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 45.34 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 70.37 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 823.63 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 19358.78 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -956.5 MB). Peak memory consumption was 897.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 3) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 441]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 19.2s OverallTime, 20 OverallIterations, 26 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 595 SDtfs, 200 SDslu, 252 SDs, 0 SdLazy, 636 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1543 GetRequests, 1504 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=467occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.1s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 165 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 298 NumberOfFragments, 760 HoareAnnotationTreeSize, 21 FomulaSimplifications, 13595 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2162 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2768 NumberOfCodeBlocks, 2768 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3483 ConstructedInterpolants, 0 QuantifiedInterpolants, 689960 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3730 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 19274/19354 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...