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 -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:07:37,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:07:37,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:07:37,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:07:37,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:07:37,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:07:37,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:07:37,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:07:37,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:07:37,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:07:37,712 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:07:37,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:07:37,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:07:37,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:07:37,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:07:37,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:07:37,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:07:37,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:07:37,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:07:37,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:07:37,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:07:37,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:07:37,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:07:37,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:07:37,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:07:37,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:07:37,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:07:37,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:07:37,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:07:37,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:07:37,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:07:37,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:07:37,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:07:37,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:07:37,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:07:37,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:07:37,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:07:37,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:07:37,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:07:37,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:07:37,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:07:37,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:07:37,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:07:37,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:07:37,817 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:07:37,818 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:07:37,819 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2019-08-05 10:07:37,819 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2019-08-05 10:07:37,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:07:37,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:07:37,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:37,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:07:37,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:07:37,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,890 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:07:37,890 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:07:37,891 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:07:37,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:37,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:07:37,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:07:37,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:07:37,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/1) ... [2019-08-05 10:07:37,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:07:37,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:07:37,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:07:37,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:07:37,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:07:37,988 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2019-08-05 10:07:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2019-08-05 10:07:37,988 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2019-08-05 10:07:38,349 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:07:38,349 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:07:38,350 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:38 BoogieIcfgContainer [2019-08-05 10:07:38,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:07:38,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:07:38,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:07:38,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:07:38,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:37" (1/2) ... [2019-08-05 10:07:38,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7e7477 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:07:38, skipping insertion in model container [2019-08-05 10:07:38,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:38" (2/2) ... [2019-08-05 10:07:38,358 INFO L109 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2019-08-05 10:07:38,367 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:07:38,374 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:07:38,388 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:07:38,411 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:07:38,411 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:07:38,412 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:07:38,412 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:07:38,412 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:07:38,412 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:07:38,412 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:07:38,413 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:07:38,413 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:07:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:07:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:07:38,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:38,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:07:38,435 INFO L418 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-08-05 10:07:38,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:38,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:07:38,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:38,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:38,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:07:38,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:38,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:38,663 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:07:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:38,720 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:07:38,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:38,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:07:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:38,735 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:07:38,735 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:07:38,737 INFO L628 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 [2019-08-05 10:07:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:07:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:07:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:07:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:07:38,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:07:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:38,771 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:07:38,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:07:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:07:38,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:38,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:07:38,772 INFO L418 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash 952992, now seen corresponding path program 1 times [2019-08-05 10:07:38,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:38,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:38,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:38,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:38,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:38,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:38,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:07:38,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:07:38,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:07:38,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:38,969 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:07:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:39,131 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:07:39,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:07:39,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:07:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:39,132 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:07:39,132 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:07:39,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:07:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:07:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:07:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:07:39,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:07:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:39,146 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:07:39,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:07:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:07:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:07:39,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:39,147 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:07:39,147 INFO L418 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 29552352, now seen corresponding path program 2 times [2019-08-05 10:07:39,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:39,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:07:39,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:39,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:39,349 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:07:39,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:39,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:39,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:39,569 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-08-05 10:07:39,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:39,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:39,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:07:39,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:39,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:39,596 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:07:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:39,746 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:07:39,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:07:39,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:07:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:39,747 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:07:39,747 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:07:39,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:07:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:07:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:07:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:07:39,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:07:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:39,750 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:07:39,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:07:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:07:39,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:39,751 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:07:39,751 INFO L418 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:39,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:39,752 INFO L82 PathProgramCache]: Analyzing trace with hash 916132512, now seen corresponding path program 3 times [2019-08-05 10:07:39,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:39,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:07:39,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:39,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:39,971 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:07:39,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:39,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:39,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,302 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-08-05 10:07:40,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:40,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:40,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:07:40,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:07:40,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:07:40,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:40,332 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:07:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:40,399 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:07:40,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:07:40,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:07:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:40,410 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:07:40,410 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:07:40,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:07:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:07:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:07:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:07:40,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:07:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:40,413 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:07:40,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:07:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:07:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:07:40,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:40,415 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:07:40,415 INFO L418 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1664653600, now seen corresponding path program 4 times [2019-08-05 10:07:40,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:40,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:07:40,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:40,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:40,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,004 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-08-05 10:07:41,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:41,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:41,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:07:41,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:41,134 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:07:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:41,248 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:07:41,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:07:41,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:07:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:41,250 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:07:41,250 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:07:41,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:07:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:07:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:07:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:07:41,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:07:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:41,253 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:07:41,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:07:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:07:41,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:07:41,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:41,254 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:07:41,254 INFO L418 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:41,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:41,255 INFO L82 PathProgramCache]: Analyzing trace with hash -64644448, now seen corresponding path program 5 times [2019-08-05 10:07:41,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:41,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:07:41,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:41,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,703 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-08-05 10:07:41,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:41,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:41,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:07:41,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:07:41,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:07:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:41,877 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:07:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:41,969 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:07:41,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:07:41,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:07:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:41,970 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:07:41,970 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:07:41,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:07:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:07:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:07:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:07:41,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:07:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:41,973 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:07:41,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:07:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:07:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:07:41,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:41,974 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:07:41,975 INFO L418 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2003968288, now seen corresponding path program 6 times [2019-08-05 10:07:41,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:41,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:07:41,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:42,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:42,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:42,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:07:42,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:07:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:07:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:42,437 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:07:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:42,524 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:07:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:07:42,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:07:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:42,526 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:07:42,526 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:07:42,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:07:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:07:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:07:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:07:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:07:42,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:07:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:42,529 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:07:42,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:07:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:07:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:07:42,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:42,530 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:07:42,531 INFO L418 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465184, now seen corresponding path program 7 times [2019-08-05 10:07:42,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:42,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:07:42,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:42,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:42,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:43,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:43,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:07:43,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:07:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:07:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:07:43,510 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:07:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:43,613 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:07:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:07:43,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:07:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:43,614 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:07:43,614 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:07:43,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:07:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:07:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:07:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:07:43,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:07:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:43,618 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:07:43,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:07:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:07:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:07:43,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:43,619 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:07:43,619 INFO L418 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:43,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1667868960, now seen corresponding path program 8 times [2019-08-05 10:07:43,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:43,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:07:43,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:43,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:43,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:44,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:44,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:07:44,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:07:44,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:07:44,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:44,157 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:07:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:44,249 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:07:44,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:07:44,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:07:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:44,250 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:07:44,250 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:07:44,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:07:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:07:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:07:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:07:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:07:44,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:07:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:44,254 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:07:44,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:07:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:07:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:07:44,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:44,255 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:07:44,255 INFO L418 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash -164320608, now seen corresponding path program 9 times [2019-08-05 10:07:44,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:44,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:07:44,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:44,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,563 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:07:44,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:44,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,056 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-08-05 10:07:45,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,311 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:07:45,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:07:45,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:07:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:07:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:07:45,798 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:07:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:45,853 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:07:45,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:07:45,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:07:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:45,855 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:07:45,855 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:07:45,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:07:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:07:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:07:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:07:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:07:45,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:07:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:45,860 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:07:45,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:07:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:07:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:07:45,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:45,860 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:07:45,860 INFO L418 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash -798961952, now seen corresponding path program 10 times [2019-08-05 10:07:45,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:45,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:07:45,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:45,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:45,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:46,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:46,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:07:46,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:07:46,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:07:46,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:07:46,589 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:07:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:46,669 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:07:46,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:07:46,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:07:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:46,670 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:07:46,670 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:07:46,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:07:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:07:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:07:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:07:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:07:46,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:07:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:46,675 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:07:46,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:07:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:07:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:07:46,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:46,675 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:07:46,676 INFO L418 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1001992864, now seen corresponding path program 11 times [2019-08-05 10:07:46,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:07:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:07:46,749 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:07:46,775 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:07:46 BoogieIcfgContainer [2019-08-05 10:07:46,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:07:46,777 INFO L168 Benchmark]: Toolchain (without parser) took 8921.97 ms. Allocated memory was 142.1 MB in the beginning and 234.9 MB in the end (delta: 92.8 MB). Free memory was 111.5 MB in the beginning and 80.1 MB in the end (delta: 31.4 MB). Peak memory consumption was 124.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:46,778 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:07:46,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.46 ms. Allocated memory is still 142.1 MB. Free memory was 111.5 MB in the beginning and 109.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:46,780 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 142.1 MB. Free memory was 109.6 MB in the beginning and 108.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:46,781 INFO L168 Benchmark]: RCFGBuilder took 431.27 ms. Allocated memory is still 142.1 MB. Free memory was 108.5 MB in the beginning and 95.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:46,782 INFO L168 Benchmark]: TraceAbstraction took 8423.57 ms. Allocated memory was 142.1 MB in the beginning and 234.9 MB in the end (delta: 92.8 MB). Free memory was 95.0 MB in the beginning and 80.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 107.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:46,786 INFO L335 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.23 ms. Allocated memory is still 142.1 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.46 ms. Allocated memory is still 142.1 MB. Free memory was 111.5 MB in the beginning and 109.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.50 ms. Allocated memory is still 142.1 MB. Free memory was 109.6 MB in the beginning and 108.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 431.27 ms. Allocated memory is still 142.1 MB. Free memory was 108.5 MB in the beginning and 95.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8423.57 ms. Allocated memory was 142.1 MB in the beginning and 234.9 MB in the end (delta: 92.8 MB). Free memory was 95.0 MB in the beginning and 80.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 107.7 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 [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=10, time_increment=10] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=109, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=208, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=307, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=406, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=505, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=604, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=703, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=802, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=901, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=99] [L24] COND FALSE !(time < thousand) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=99] [L35] assert alarm || gate == maxGatePosition; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=99] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 8.3s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 1 SDslu, 14 SDs, 0 SdLazy, 186 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 77 ConstructedInterpolants, 66 QuantifiedInterpolants, 14520 SizeOfPredicates, 88 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...