java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:08,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:08,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:08,519 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:08,520 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:08,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:08,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:08,524 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:08,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:08,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:08,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:08,528 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:08,529 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:08,530 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:08,532 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:08,533 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:08,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:08,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:08,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:08,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:08,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:08,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:08,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:08,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:08,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:08,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:08,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:08,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:08,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:08,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:08,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:08,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:08,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:08,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:08,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:08,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:08,563 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:11:08,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:08,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:08,591 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:08,592 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:08,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:08,592 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:08,592 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:08,594 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:08,594 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:08,594 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:08,594 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:08,594 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:08,595 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:08,595 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:08,595 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:08,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:08,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:08,598 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:08,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:08,598 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:08,600 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:08,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:08,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:08,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:08,601 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:08,601 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:08,601 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:08,601 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:08,602 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:08,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:08,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:08,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:08,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:08,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:08,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:08,605 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:08,605 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:08,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:08,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:08,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:08,606 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:08,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:08,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:08,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:08,668 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:08,669 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:08,669 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2018-12-03 16:11:08,670 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-12-03 16:11:08,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:08,703 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:08,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:08,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:08,704 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:08,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,741 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:08,742 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:08,742 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:08,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:08,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:08,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:08,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:08,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:08,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:08,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:08,790 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:08,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (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 16:11:08,873 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-12-03 16:11:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-12-03 16:11:08,873 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-12-03 16:11:09,151 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:09,152 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:11:09,152 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:09 BoogieIcfgContainer [2018-12-03 16:11:09,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:09,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:09,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:09,156 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:09,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/2) ... [2018-12-03 16:11:09,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b452738 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:11:09, skipping insertion in model container [2018-12-03 16:11:09,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:09" (2/2) ... [2018-12-03 16:11:09,159 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-12-03 16:11:09,171 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:09,179 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:11:09,198 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:11:09,234 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:09,234 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:09,235 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:09,235 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:09,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:09,235 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:09,235 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:09,236 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 16:11:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:11:09,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:09,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:11:09,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:09,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-12-03 16:11:09,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:09,421 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 16:11:09,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:09,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:09,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:09,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:09,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:09,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:09,447 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 16:11:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:09,539 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-03 16:11:09,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:09,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:11:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:09,558 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:11:09,559 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:11:09,563 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 16:11:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:11:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 16:11:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:11:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-03 16:11:09,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 3 [2018-12-03 16:11:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:09,610 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-03 16:11:09,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-03 16:11:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:09,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:09,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:09,612 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:09,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:09,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1953617644, now seen corresponding path program 1 times [2018-12-03 16:11:09,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:09,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:09,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:09,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:09,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:09,756 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 16:11:09,758 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [11], [16], [18], [20], [21] [2018-12-03 16:11:09,804 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:09,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:10,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:10,058 INFO L272 AbstractInterpreter]: Visited 8 different actions 21 times. Merged at 7 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:11:10,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:10,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:10,110 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 16:11:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:10,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 16:11:10,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:10,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:10,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:10,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:11:10,648 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2018-12-03 16:11:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,755 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-12-03 16:11:10,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:11:10,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,757 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:11:10,757 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:11:10,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:11:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:11:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 16:11:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:11:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-03 16:11:10,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-12-03 16:11:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,767 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-03 16:11:10,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-12-03 16:11:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:10,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,769 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:10,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1953558062, now seen corresponding path program 1 times [2018-12-03 16:11:10,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:10,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:10,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:10,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,852 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 3 states. [2018-12-03 16:11:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,878 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-12-03 16:11:10,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:10,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 16:11:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,880 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:11:10,880 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:11:10,881 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 16:11:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:11:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:11:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:11:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 16:11:10,885 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2018-12-03 16:11:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,885 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 16:11:10,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 16:11:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:11:10,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,887 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-12-03 16:11:10,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:10,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 72785504, now seen corresponding path program 2 times [2018-12-03 16:11:10,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:11,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:11,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:11,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:11,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:11,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:11,075 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 16:11:11,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:11:11,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:11:11,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:11:11,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:11:11,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:11,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:11,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:11,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2018-12-03 16:11:11,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:11,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:11:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:11:11,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:11:11,518 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 12 states. [2018-12-03 16:11:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,599 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-12-03 16:11:11,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:11:11,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-12-03 16:11:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,601 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:11:11,602 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:11:11,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:11:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:11:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-12-03 16:11:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:11:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-03 16:11:11,608 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2018-12-03 16:11:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:11,608 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-03 16:11:11,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:11:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-12-03 16:11:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:11:11,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,610 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1] [2018-12-03 16:11:11,610 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:11,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,610 INFO L82 PathProgramCache]: Analyzing trace with hash 491282284, now seen corresponding path program 3 times [2018-12-03 16:11:11,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:12,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:12,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:12,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:12,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:12,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:12,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 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 16:11:12,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:11:12,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:11:12,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:11:12,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:11:12,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:12,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:12,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:12,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2018-12-03 16:11:12,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:12,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:11:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:11:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:11:12,774 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 16 states. [2018-12-03 16:11:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:12,901 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-03 16:11:12,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:11:12,902 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 16:11:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:12,903 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:11:12,904 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:11:12,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:11:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:11:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-12-03 16:11:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:11:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-03 16:11:12,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2018-12-03 16:11:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:12,910 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-03 16:11:12,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:11:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-03 16:11:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:11:12,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:12,911 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1] [2018-12-03 16:11:12,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:12,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1589732832, now seen corresponding path program 4 times [2018-12-03 16:11:12,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:12,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:13,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:13,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:13,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:13,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:13,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:13,093 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 16:11:13,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:13,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:13,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:13,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:13,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:13,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2018-12-03 16:11:13,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:13,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:11:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:11:13,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:11:13,734 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 20 states. [2018-12-03 16:11:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:14,150 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-03 16:11:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:11:14,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-03 16:11:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:14,151 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:11:14,151 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:11:14,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:11:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:11:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-12-03 16:11:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:11:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-12-03 16:11:14,158 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2018-12-03 16:11:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:14,158 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-12-03 16:11:14,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:11:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-12-03 16:11:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:11:14,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:14,160 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1] [2018-12-03 16:11:14,160 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:14,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash 602818540, now seen corresponding path program 5 times [2018-12-03 16:11:14,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:14,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:14,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:14,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:14,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:14,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:14,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:14,367 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 16:11:14,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:11:14,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:11:14,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:11:14,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:11:14,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:14,701 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:11:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:15,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:15,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:15,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2018-12-03 16:11:15,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:15,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:11:15,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:11:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:11:15,449 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 24 states. [2018-12-03 16:11:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:15,589 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-12-03 16:11:15,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:11:15,589 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-03 16:11:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:15,591 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:11:15,591 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:11:15,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:11:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:11:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-03 16:11:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:11:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-03 16:11:15,598 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 28 [2018-12-03 16:11:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:15,598 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-03 16:11:15,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:11:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-03 16:11:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:11:15,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:15,599 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1] [2018-12-03 16:11:15,600 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:15,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1979239776, now seen corresponding path program 6 times [2018-12-03 16:11:15,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:15,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:15,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:15,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:15,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:15,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:15,879 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 16:11:15,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:11:15,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:11:15,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:11:15,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:11:15,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:16,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:16,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:16,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2018-12-03 16:11:16,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:16,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:11:16,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:11:16,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=1143, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:11:16,733 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 28 states. [2018-12-03 16:11:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:16,856 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-12-03 16:11:16,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:11:16,861 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-12-03 16:11:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:16,862 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:11:16,862 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:11:16,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=497, Invalid=1143, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:11:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:11:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 16:11:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:11:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-12-03 16:11:16,871 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 33 [2018-12-03 16:11:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:16,872 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-03 16:11:16,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:11:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-12-03 16:11:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:11:16,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:16,873 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1] [2018-12-03 16:11:16,873 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:16,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1800695700, now seen corresponding path program 7 times [2018-12-03 16:11:16,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:16,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:16,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:17,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:17,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:17,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:17,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:17,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:17,094 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:17,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:17,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:17,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:17,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:17,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:17,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2018-12-03 16:11:17,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:17,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:11:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:11:17,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1530, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:11:17,796 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 32 states. [2018-12-03 16:11:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:17,957 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-12-03 16:11:17,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:11:17,958 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-12-03 16:11:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:17,959 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:11:17,959 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:11:17,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=632, Invalid=1530, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:11:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:11:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-03 16:11:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:11:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-03 16:11:17,968 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 38 [2018-12-03 16:11:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:17,968 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-03 16:11:17,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:11:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-03 16:11:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:11:17,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:17,970 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1] [2018-12-03 16:11:17,970 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:17,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1430989600, now seen corresponding path program 8 times [2018-12-03 16:11:17,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:17,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:17,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:17,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:18,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:18,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:18,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:18,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:18,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:18,231 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:18,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:11:18,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:11:18,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:11:18,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:11:18,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:18,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:19,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:19,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2018-12-03 16:11:19,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:19,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:11:19,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:11:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:11:19,816 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 36 states. [2018-12-03 16:11:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:20,152 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-03 16:11:20,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:11:20,152 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-12-03 16:11:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:20,153 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:11:20,153 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:11:20,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:11:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:11:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-12-03 16:11:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:11:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-12-03 16:11:20,162 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 43 [2018-12-03 16:11:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:20,162 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-12-03 16:11:20,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:11:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-12-03 16:11:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:11:20,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:20,164 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1] [2018-12-03 16:11:20,164 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:20,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:20,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1043842836, now seen corresponding path program 9 times [2018-12-03 16:11:20,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:20,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:20,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:20,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:20,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:20,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:20,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:20,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:20,505 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:20,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:11:20,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:11:20,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:11:20,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:11:20,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:21,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:22,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:22,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2018-12-03 16:11:22,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:22,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:11:22,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:11:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=2496, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:11:22,074 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 40 states. [2018-12-03 16:11:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:22,215 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-12-03 16:11:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:11:22,216 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 48 [2018-12-03 16:11:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:22,217 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:11:22,217 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:11:22,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=926, Invalid=2496, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:11:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:11:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-03 16:11:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:11:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-12-03 16:11:22,224 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 48 [2018-12-03 16:11:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:22,224 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-12-03 16:11:22,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:11:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-12-03 16:11:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:11:22,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:22,225 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1] [2018-12-03 16:11:22,225 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:22,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:22,226 INFO L82 PathProgramCache]: Analyzing trace with hash -676496288, now seen corresponding path program 10 times [2018-12-03 16:11:22,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:22,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:22,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:22,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:22,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:22,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:22,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:22,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:22,524 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:22,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:22,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:22,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:23,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:24,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:24,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2018-12-03 16:11:24,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:24,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:11:24,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:11:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=3075, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:11:24,707 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 44 states. [2018-12-03 16:11:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:24,930 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-12-03 16:11:24,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:11:24,930 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2018-12-03 16:11:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:24,931 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:11:24,932 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:11:24,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2494 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1085, Invalid=3075, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:11:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:11:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-12-03 16:11:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:11:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-03 16:11:24,939 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 53 [2018-12-03 16:11:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:24,939 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-03 16:11:24,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:11:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-03 16:11:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:11:24,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:24,941 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1] [2018-12-03 16:11:24,941 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:24,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1014218388, now seen corresponding path program 11 times [2018-12-03 16:11:24,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 16:11:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 16:11:25,004 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 16:11:25,065 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:11:25 BoogieIcfgContainer [2018-12-03 16:11:25,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:11:25,066 INFO L168 Benchmark]: Toolchain (without parser) took 16364.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -460.6 MB). Peak memory consumption was 349.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:25,068 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:11:25,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.01 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 16:11:25,070 INFO L168 Benchmark]: Boogie Preprocessor took 43.54 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 16:11:25,071 INFO L168 Benchmark]: RCFGBuilder took 362.65 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:25,071 INFO L168 Benchmark]: TraceAbstraction took 15911.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -479.7 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:25,078 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.01 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 43.54 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 362.65 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15911.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -479.7 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 35]: assertion can be violated assertion can be violated We found a FailurePath: [L15] one := 1; [L16] maxGatePosition := 100 * one; [L17] thousand := 1000 * one; [L20] gate := 0; [L21] time := 0; [L22] alarm := false; VAL [alarm=false, gate=0, maxGatePosition=100, one=1, thousand=1000, time=0] [L24] COND TRUE time < thousand VAL [alarm=false, gate=0, maxGatePosition=100, one=1, thousand=1000, time=0] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0] [L28] havoc time_increment; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=10] [L32] time := time + time_increment; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] [L24] COND FALSE !(time < thousand) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] [L35] assert alarm || gate == maxGatePosition; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 15.8s OverallTime, 13 OverallIterations, 11 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 670 SDslu, 836 SDs, 0 SdLazy, 877 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 724 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9340 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 45 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 679 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 894 ConstructedInterpolants, 285 QuantifiedInterpolants, 261516 SizeOfPredicates, 140 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 1/2641 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...