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/RailwayCrossing.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:21:19,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:21:19,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:21:19,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:21:19,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:21:19,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:21:19,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:21:19,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:21:19,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:21:19,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:21:20,000 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:21:20,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:21:20,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:21:20,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:21:20,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:21:20,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:21:20,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:21:20,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:21:20,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:21:20,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:21:20,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:21:20,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:21:20,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:21:20,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:21:20,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:21:20,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:21:20,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:21:20,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:21:20,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:21:20,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:21:20,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:21:20,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:21:20,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:21:20,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:21:20,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:21:20,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:21:20,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:21:20,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:21:20,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:21:20,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:21:20,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:21:20,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:21:20,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:21:20,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:21:20,105 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:21:20,106 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:21:20,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl [2019-08-04 21:21:20,107 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl' [2019-08-04 21:21:20,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:21:20,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:21:20,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:20,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:21:20,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:21:20,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,176 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:21:20,176 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:21:20,176 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:21:20,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:20,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:21:20,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:21:20,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:21:20,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/1) ... [2019-08-04 21:21:20,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:21:20,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:21:20,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:21:20,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:21:20,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (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-04 21:21:20,272 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2019-08-04 21:21:20,273 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2019-08-04 21:21:20,273 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2019-08-04 21:21:20,698 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:21:20,698 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:21:20,700 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:20 BoogieIcfgContainer [2019-08-04 21:21:20,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:21:20,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:21:20,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:21:20,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:21:20,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:20" (1/2) ... [2019-08-04 21:21:20,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf4c264 and model type RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:21:20, skipping insertion in model container [2019-08-04 21:21:20,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:20" (2/2) ... [2019-08-04 21:21:20,708 INFO L109 eAbstractionObserver]: Analyzing ICFG RailwayCrossing.bpl [2019-08-04 21:21:20,721 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:21:20,729 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:21:20,746 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:21:20,775 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:21:20,775 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:21:20,776 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:21:20,776 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:21:20,776 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:21:20,776 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:21:20,777 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:21:20,777 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:21:20,777 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:21:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:21:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:21:20,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:20,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:21:20,804 INFO L418 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2019-08-04 21:21:20,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:20,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:21:20,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:21,012 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-04 21:21:21,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:21,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:21:21,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:21:21,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:21:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:21:21,032 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:21:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:21,072 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:21:21,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:21:21,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:21:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:21,085 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:21:21,085 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:21:21,087 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-04 21:21:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:21:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:21:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:21:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:21:21,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:21:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:21,122 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:21:21,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:21:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:21:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:21:21,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:21,123 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:21:21,124 INFO L418 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash 955939, now seen corresponding path program 1 times [2019-08-04 21:21:21,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:21,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:21,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:21,265 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-04 21:21:21,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:21,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:21:21,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:21:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:21:21,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:21:21,269 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:21:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:21,321 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:21:21,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:21:21,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:21:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:21,323 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:21:21,323 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:21:21,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:21:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:21:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:21:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:21:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:21:21,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:21:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:21,327 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:21:21,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:21:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:21:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:21:21,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:21,328 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:21:21,328 INFO L418 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash 29644672, now seen corresponding path program 2 times [2019-08-04 21:21:21,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:21,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:21:21,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:21,566 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-04 21:21:21,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:21,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:21:21,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:21:21,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:21:21,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:21,568 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:21:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:21,618 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:21:21,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:21:21,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:21:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:21,620 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:21:21,620 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:21:21,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:21:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:21:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:21:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:21:21,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:21:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:21,623 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:21:21,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:21:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:21:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:21:21,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:21,624 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:21:21,624 INFO L418 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:21,625 INFO L82 PathProgramCache]: Analyzing trace with hash 918995395, now seen corresponding path program 3 times [2019-08-04 21:21:21,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:21,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:21:21,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:22,006 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-04 21:21:22,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:22,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:22,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:22,008 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:21:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:22,049 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:21:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:22,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:21:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:22,051 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:21:22,051 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:21:22,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:21:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:21:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:21:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:21:22,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:21:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:22,055 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:21:22,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:21:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:22,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:22,056 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:21:22,056 INFO L418 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1575903264, now seen corresponding path program 4 times [2019-08-04 21:21:22,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:22,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:21:22,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:22,316 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-04 21:21:22,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:22,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:22,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:22,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:22,318 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:21:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:22,419 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:21:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:21:22,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:21:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:22,421 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:21:22,422 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:21:22,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:21:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:21:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:21:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:21:22,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:21:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:22,428 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:21:22,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:21:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:21:22,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:22,429 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:21:22,429 INFO L418 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:22,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:22,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1608350365, now seen corresponding path program 5 times [2019-08-04 21:21:22,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:22,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:21:22,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:22,683 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-04 21:21:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:21:22,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:22,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:22,684 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:21:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:22,712 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:21:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:21:22,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:21:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:22,714 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:21:22,715 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:21:22,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:21:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:21:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:21:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:21:22,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:21:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:22,718 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:21:22,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:21:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:21:22,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:22,719 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:21:22,719 INFO L418 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1680756800, now seen corresponding path program 6 times [2019-08-04 21:21:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:22,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:21:22,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:23,311 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-04 21:21:23,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:23,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:21:23,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:21:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:21:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:23,313 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:21:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:23,361 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:21:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:21:23,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:21:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:23,363 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:21:23,363 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:21:23,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:21:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:21:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:21:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:21:23,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:21:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:23,366 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:21:23,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:21:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:21:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:23,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:23,366 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:21:23,367 INFO L418 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:23,367 INFO L82 PathProgramCache]: Analyzing trace with hash 563863811, now seen corresponding path program 7 times [2019-08-04 21:21:23,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:23,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:21:23,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:23,731 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-04 21:21:23,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:23,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:21:23,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:21:23,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:21:23,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:21:23,733 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:21:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:23,780 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:21:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:23,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:21:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:23,782 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:21:23,782 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:21:23,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:21:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:21:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:21:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:21:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:21:23,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:21:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:23,787 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:21:23,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:21:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:21:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:21:23,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:23,788 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:21:23,788 INFO L418 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:23,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash 299919520, now seen corresponding path program 8 times [2019-08-04 21:21:23,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:23,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:21:23,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:24,124 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-04 21:21:24,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:21:24,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:21:24,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:21:24,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:24,126 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:21:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:24,186 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:21:24,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:21:24,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:21:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:24,187 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:21:24,187 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:21:24,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:21:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:21:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:21:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:21:24,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:21:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:24,190 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:21:24,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:21:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:21:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:24,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:24,191 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:21:24,191 INFO L418 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:24,191 INFO L82 PathProgramCache]: Analyzing trace with hash 707581091, now seen corresponding path program 9 times [2019-08-04 21:21:24,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:24,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:21:24,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:24,533 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-04 21:21:24,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:24,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:21:24,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:21:24,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:21:24,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:21:24,534 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:21:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:24,629 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:21:24,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:21:24,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:21:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:24,630 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:21:24,630 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:21:24,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:21:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:21:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:21:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:21:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:21:24,634 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:21:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:24,634 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:21:24,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:21:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:21:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:24,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:24,635 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:21:24,635 INFO L418 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:24,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:24,635 INFO L82 PathProgramCache]: Analyzing trace with hash 460187904, now seen corresponding path program 10 times [2019-08-04 21:21:24,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:24,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:21:24,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:25,310 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-04 21:21:25,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:25,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:21:25,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:21:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:21:25,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:21:25,312 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:21:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:25,355 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:21:25,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:25,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:21:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:25,356 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:21:25,357 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:21:25,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:21:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:21:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:21:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:21:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:21:25,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:21:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:25,361 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:21:25,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:21:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:21:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:21:25,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:25,362 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:21:25,362 INFO L418 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1380933699, now seen corresponding path program 11 times [2019-08-04 21:21:25,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:25,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:21:25,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:25,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:25,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:21:25,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:21:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:21:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:25,915 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:21:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:25,954 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:21:25,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:25,964 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:21:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:25,965 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:21:25,965 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:21:25,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:21:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:21:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:21:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:21:25,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:21:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:25,968 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:21:25,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:21:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:21:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:21:25,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:25,969 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:21:25,969 INFO L418 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash -140717728, now seen corresponding path program 12 times [2019-08-04 21:21:25,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:25,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:21:25,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:26,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:21:26,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:21:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:21:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:21:26,304 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:21:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:26,341 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:21:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:21:26,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:21:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:26,342 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:21:26,342 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:21:26,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:21:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:21:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:21:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:21:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:21:26,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:21:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:26,346 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:21:26,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:21:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:21:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:21:26,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:26,347 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:21:26,348 INFO L418 AbstractCegarLoop]: === Iteration 14 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -67271709, now seen corresponding path program 13 times [2019-08-04 21:21:26,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:26,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:21:26,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:26,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:26,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:21:26,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:21:26,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:21:26,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:26,681 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:21:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:26,714 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:21:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:21:26,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:21:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:26,716 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:21:26,716 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:21:26,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:21:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:21:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:21:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:21:26,720 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:21:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:26,721 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:21:26,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:21:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:21:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:21:26,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:26,721 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:21:26,722 INFO L418 AbstractCegarLoop]: === Iteration 15 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2085412416, now seen corresponding path program 14 times [2019-08-04 21:21:26,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:26,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:21:26,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:27,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:27,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:21:27,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:21:27,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:21:27,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:27,735 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:21:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:27,880 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:21:27,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:21:27,880 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:21:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:27,881 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:21:27,881 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:21:27,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:21:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:21:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:21:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:21:27,884 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:21:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:27,885 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:21:27,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:21:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:21:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:27,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:27,886 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:21:27,886 INFO L418 AbstractCegarLoop]: === Iteration 16 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:27,886 INFO L82 PathProgramCache]: Analyzing trace with hash -223264893, now seen corresponding path program 15 times [2019-08-04 21:21:27,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:27,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:21:27,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:28,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:28,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:21:28,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:21:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:21:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:21:28,497 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:21:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:28,546 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:21:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:21:28,547 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:21:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:28,548 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:21:28,548 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:21:28,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:21:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:21:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:21:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:21:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:21:28,553 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:21:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:28,553 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:21:28,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:21:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:21:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:21:28,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:28,554 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:21:28,554 INFO L418 AbstractCegarLoop]: === Iteration 17 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1668733472, now seen corresponding path program 16 times [2019-08-04 21:21:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:28,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:21:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:29,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:29,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:21:29,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:21:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:21:29,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:21:29,026 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:21:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:29,068 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:21:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:21:29,069 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:21:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:29,070 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:21:29,070 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:21:29,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:21:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:21:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:21:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:21:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:21:29,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:21:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:29,074 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:21:29,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:21:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:21:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:21:29,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:29,075 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:21:29,075 INFO L418 AbstractCegarLoop]: === Iteration 18 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash 191140643, now seen corresponding path program 17 times [2019-08-04 21:21:29,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:29,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:21:29,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:29,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:29,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:21:29,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:21:29,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:21:29,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:21:29,576 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:21:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:29,618 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:21:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:21:29,625 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:21:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:29,626 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:21:29,626 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:21:29,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:21:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:21:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:21:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:21:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:21:29,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:21:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:29,632 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:21:29,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:21:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:21:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:21:29,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:29,634 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:21:29,634 INFO L418 AbstractCegarLoop]: === Iteration 19 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:29,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:29,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1630403200, now seen corresponding path program 18 times [2019-08-04 21:21:29,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:29,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:21:29,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:30,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:21:30,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:21:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:21:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:21:30,032 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:21:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:30,075 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:21:30,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:21:30,075 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:21:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:30,076 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:21:30,077 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:21:30,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:21:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:21:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:21:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:21:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:21:30,081 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:21:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:30,081 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:21:30,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:21:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:21:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:21:30,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:30,082 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:21:30,083 INFO L418 AbstractCegarLoop]: === Iteration 20 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash -997097789, now seen corresponding path program 19 times [2019-08-04 21:21:30,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:30,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:21:30,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:30,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:30,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:21:30,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:21:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:21:30,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:21:30,700 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:21:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:30,755 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:21:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:21:30,756 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:21:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:30,757 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:21:30,757 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:21:30,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:21:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:21:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:21:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:21:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:21:30,762 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:21:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:30,762 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:21:30,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:21:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:21:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:21:30,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:30,763 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:21:30,763 INFO L418 AbstractCegarLoop]: === Iteration 21 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -845249824, now seen corresponding path program 20 times [2019-08-04 21:21:30,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:30,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:21:30,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:31,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:31,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:21:31,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:21:31,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:21:31,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:21:31,256 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:21:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:31,303 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:21:31,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:21:31,303 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:21:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:31,304 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:21:31,304 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:21:31,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:21:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:21:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:21:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:21:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:21:31,308 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:21:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:31,308 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:21:31,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:21:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:21:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:21:31,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:31,309 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:21:31,309 INFO L418 AbstractCegarLoop]: === Iteration 22 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:31,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash -432930205, now seen corresponding path program 21 times [2019-08-04 21:21:31,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:31,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:21:31,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:32,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:32,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:21:32,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:21:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:21:32,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:21:32,808 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:21:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:32,860 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:21:32,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:21:32,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:21:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:32,864 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:21:32,864 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:21:32,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:21:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:21:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:21:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:21:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:21:32,867 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:21:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:32,867 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:21:32,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:21:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:21:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:21:32,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:32,868 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:21:32,868 INFO L418 AbstractCegarLoop]: === Iteration 23 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash -535923904, now seen corresponding path program 22 times [2019-08-04 21:21:32,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:32,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:21:32,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:34,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:34,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:21:34,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:21:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:21:34,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:21:34,270 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:21:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:34,339 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:21:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:21:34,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:21:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:34,340 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:21:34,340 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:21:34,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:21:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:21:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:21:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:21:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:21:34,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:21:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:34,344 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:21:34,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:21:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:21:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:21:34,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:34,345 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:21:34,346 INFO L418 AbstractCegarLoop]: === Iteration 24 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash 566238723, now seen corresponding path program 23 times [2019-08-04 21:21:34,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:34,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:21:34,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:35,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:35,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:21:35,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:21:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:21:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:21:35,065 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:21:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:35,147 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:21:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:21:35,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:21:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:35,148 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:21:35,149 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:21:35,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:21:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:21:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:21:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:21:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:21:35,152 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:21:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:35,153 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:21:35,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:21:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:21:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:21:35,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:35,154 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:21:35,154 INFO L418 AbstractCegarLoop]: === Iteration 25 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash 373541792, now seen corresponding path program 24 times [2019-08-04 21:21:35,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:35,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:21:35,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:36,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:36,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:21:36,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:21:36,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:21:36,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:21:36,111 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:21:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:36,177 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:21:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:21:36,178 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:21:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:36,178 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:21:36,179 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:21:36,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:21:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:21:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:21:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:21:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:21:36,182 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:21:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:36,183 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:21:36,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:21:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:21:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:21:36,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:36,184 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:21:36,184 INFO L418 AbstractCegarLoop]: === Iteration 26 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1305095773, now seen corresponding path program 25 times [2019-08-04 21:21:36,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:36,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:21:36,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:36,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:36,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:21:36,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:21:36,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:21:36,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:21:36,979 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:21:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:37,057 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:21:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:21:37,058 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:21:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:37,058 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:21:37,059 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:21:37,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:21:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:21:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:21:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:21:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:21:37,061 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:21:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:37,062 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:21:37,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:21:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:21:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:21:37,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:37,063 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:21:37,063 INFO L418 AbstractCegarLoop]: === Iteration 27 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:37,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:37,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1803252736, now seen corresponding path program 26 times [2019-08-04 21:21:37,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:37,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:21:37,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:39,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:39,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:21:39,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:21:39,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:21:39,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:21:39,574 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:21:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:39,684 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:21:39,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:21:39,685 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:21:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:39,685 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:21:39,685 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:21:39,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:21:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:21:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:21:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:21:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:21:39,690 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:21:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:39,690 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:21:39,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:21:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:21:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:21:39,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:39,691 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:21:39,692 INFO L418 AbstractCegarLoop]: === Iteration 28 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:39,692 INFO L82 PathProgramCache]: Analyzing trace with hash -66249405, now seen corresponding path program 27 times [2019-08-04 21:21:39,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:39,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:21:39,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:40,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:40,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:21:40,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:21:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:21:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:21:40,328 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:21:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:40,458 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:21:40,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:21:40,459 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:21:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:40,460 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:21:40,460 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:21:40,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:21:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:21:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:21:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:21:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:21:40,464 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:21:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:40,464 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:21:40,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:21:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:21:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:21:40,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:40,465 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:21:40,466 INFO L418 AbstractCegarLoop]: === Iteration 29 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:40,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2053720992, now seen corresponding path program 28 times [2019-08-04 21:21:40,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:40,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:21:40,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:21:41,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:21:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:21:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:21:41,216 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:21:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:41,308 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:21:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:21:41,308 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:21:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:41,309 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:21:41,309 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:21:41,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:21:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:21:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:21:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:21:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:21:41,315 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:21:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:41,315 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:21:41,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:21:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:21:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:21:41,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:41,316 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:21:41,316 INFO L418 AbstractCegarLoop]: === Iteration 30 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash 759169251, now seen corresponding path program 29 times [2019-08-04 21:21:41,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:41,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:21:41,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:42,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:42,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:21:42,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:21:42,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:21:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:21:42,131 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:21:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:42,197 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:21:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:21:42,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:21:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:42,198 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:21:42,198 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:21:42,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:21:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:21:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:21:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:21:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:21:42,202 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:21:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:42,202 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:21:42,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:21:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:21:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:21:42,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:42,203 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:21:42,203 INFO L418 AbstractCegarLoop]: === Iteration 31 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2059420864, now seen corresponding path program 30 times [2019-08-04 21:21:42,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:42,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:21:42,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:43,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:43,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:21:43,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:21:43,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:21:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:21:43,516 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:21:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:43,588 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:21:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:21:43,589 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:21:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:43,589 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:21:43,589 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:21:43,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:21:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:21:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:21:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:21:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:21:43,592 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:21:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:43,593 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:21:43,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:21:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:21:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:21:43,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:43,593 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:21:43,593 INFO L418 AbstractCegarLoop]: === Iteration 32 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash -582452093, now seen corresponding path program 31 times [2019-08-04 21:21:43,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:43,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:21:43,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:44,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:44,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:21:44,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:21:44,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:21:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:21:44,457 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:21:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:44,519 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:21:44,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:21:44,520 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:21:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:44,520 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:21:44,521 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:21:44,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:21:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:21:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:21:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:21:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:21:44,524 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:21:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:44,525 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:21:44,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:21:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:21:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:21:44,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:44,526 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:21:44,526 INFO L418 AbstractCegarLoop]: === Iteration 33 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:44,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:44,526 INFO L82 PathProgramCache]: Analyzing trace with hash -876135136, now seen corresponding path program 32 times [2019-08-04 21:21:44,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:44,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:21:44,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:45,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:45,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:21:45,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:21:45,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:21:45,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:21:45,395 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:21:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:45,451 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:21:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:21:45,452 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:21:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:45,452 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:21:45,452 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:21:45,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:21:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:21:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:21:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:21:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:21:45,456 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:21:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:45,456 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:21:45,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:21:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:21:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:21:45,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:45,458 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:21:45,458 INFO L418 AbstractCegarLoop]: === Iteration 34 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:45,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1390374877, now seen corresponding path program 33 times [2019-08-04 21:21:45,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:45,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:21:45,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:46,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:46,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:21:46,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:21:46,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:21:46,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:21:46,358 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:21:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:46,425 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:21:46,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:21:46,427 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:21:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:46,427 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:21:46,427 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:21:46,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:21:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:21:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:21:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:21:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:21:46,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:21:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:46,430 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:21:46,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:21:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:21:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:21:46,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:46,431 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:21:46,431 INFO L418 AbstractCegarLoop]: === Iteration 35 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:46,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash -151937664, now seen corresponding path program 34 times [2019-08-04 21:21:46,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:46,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:21:46,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:47,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:47,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:21:47,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:21:47,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:21:47,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:21:47,886 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:21:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:47,947 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:21:47,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:21:47,947 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:21:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:47,948 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:21:47,948 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:21:47,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:21:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:21:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:21:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:21:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:21:47,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:21:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:47,952 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:21:47,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:21:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:21:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:21:47,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:47,953 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:21:47,953 INFO L418 AbstractCegarLoop]: === Iteration 36 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash -415089725, now seen corresponding path program 35 times [2019-08-04 21:21:47,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:47,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:21:47,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:48,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:48,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:21:48,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:21:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:21:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:21:48,817 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:21:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:48,897 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:21:48,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:21:48,897 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:21:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:48,898 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:21:48,898 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:21:48,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:21:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:21:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:21:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:21:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:21:48,901 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:21:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:48,901 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:21:48,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:21:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:21:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:21:48,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:48,902 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:21:48,902 INFO L418 AbstractCegarLoop]: === Iteration 37 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash 17130976, now seen corresponding path program 36 times [2019-08-04 21:21:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:48,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:21:48,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:50,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:50,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:21:50,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:21:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:21:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:21:50,326 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:21:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:50,388 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:21:50,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:21:50,388 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:21:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:50,389 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:21:50,389 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:21:50,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:21:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:21:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:21:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:21:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:21:50,392 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:21:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:50,393 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:21:50,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:21:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:21:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:21:50,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:50,393 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:21:50,394 INFO L418 AbstractCegarLoop]: === Iteration 38 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash 531070819, now seen corresponding path program 37 times [2019-08-04 21:21:50,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:50,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:21:50,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:51,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:21:51,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:21:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:21:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:21:51,402 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:21:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:51,495 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:21:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:21:51,496 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:21:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:51,496 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:21:51,497 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:21:51,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:21:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:21:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:21:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:21:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:21:51,500 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:21:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:51,500 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:21:51,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:21:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:21:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:21:51,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:51,501 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:21:51,501 INFO L418 AbstractCegarLoop]: === Iteration 39 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash -716663232, now seen corresponding path program 38 times [2019-08-04 21:21:51,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:51,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:21:51,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:53,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:53,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:21:53,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:21:53,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:21:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:21:53,507 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:21:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:53,583 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:21:53,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:21:53,584 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:21:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:53,585 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:21:53,585 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:21:53,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:21:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:21:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:21:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:21:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:21:53,588 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:21:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:53,589 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:21:53,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:21:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:21:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:21:53,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:53,590 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:21:53,590 INFO L418 AbstractCegarLoop]: === Iteration 40 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash -741713149, now seen corresponding path program 39 times [2019-08-04 21:21:53,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:53,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:21:53,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:54,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:21:54,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:21:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:21:54,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:21:54,762 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:21:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:54,833 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:21:54,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:21:54,834 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:21:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:54,835 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:21:54,835 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:21:54,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:21:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:21:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:21:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:21:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:21:54,838 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:21:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:54,838 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:21:54,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:21:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:21:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:21:54,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:54,839 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:21:54,839 INFO L418 AbstractCegarLoop]: === Iteration 41 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1518260576, now seen corresponding path program 40 times [2019-08-04 21:21:54,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:54,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:21:54,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:55,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:55,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:21:55,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:21:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:21:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:21:55,991 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:21:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:56,095 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:21:56,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:21:56,096 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:21:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:56,096 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:21:56,097 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:21:56,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:21:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:21:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:21:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:21:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:21:56,100 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:21:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:56,100 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:21:56,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:21:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:21:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:21:56,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:56,102 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:21:56,102 INFO L418 AbstractCegarLoop]: === Iteration 42 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash 178572963, now seen corresponding path program 41 times [2019-08-04 21:21:56,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:56,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:21:56,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:57,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:57,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:21:57,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:21:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:21:57,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:21:57,445 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:21:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:57,524 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:21:57,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:21:57,524 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:21:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:57,525 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:21:57,525 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:21:57,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:21:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:21:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:21:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:21:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:21:57,528 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:21:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:57,528 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:21:57,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:21:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:21:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:21:57,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:57,529 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:21:57,529 INFO L418 AbstractCegarLoop]: === Iteration 43 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1240805120, now seen corresponding path program 42 times [2019-08-04 21:21:57,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:57,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:21:57,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:59,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:21:59,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:21:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:21:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:21:59,112 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:21:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:59,193 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:21:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:21:59,194 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:21:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:59,194 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:21:59,194 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:21:59,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:21:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:21:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:21:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:21:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:21:59,197 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:21:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:59,198 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:21:59,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:21:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:21:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:21:59,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:59,198 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:21:59,198 INFO L418 AbstractCegarLoop]: === Iteration 44 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash -189736381, now seen corresponding path program 43 times [2019-08-04 21:21:59,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:59,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:21:59,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:00,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:00,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:22:00,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:22:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:22:00,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:22:00,442 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:22:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:00,622 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:22:00,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:22:00,623 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:22:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:00,624 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:22:00,624 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:22:00,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:22:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:22:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:22:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:22:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:22:00,628 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:22:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:00,628 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:22:00,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:22:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:22:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:22:00,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:00,628 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:22:00,629 INFO L418 AbstractCegarLoop]: === Iteration 45 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1586849952, now seen corresponding path program 44 times [2019-08-04 21:22:00,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:00,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:22:00,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:22:02,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:22:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:22:02,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:22:02,051 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:22:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:02,148 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:22:02,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:22:02,149 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:22:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:02,150 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:22:02,150 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:22:02,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:22:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:22:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:22:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:22:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:22:02,153 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:22:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:02,153 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:22:02,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:22:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:22:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:22:02,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:02,154 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:22:02,155 INFO L418 AbstractCegarLoop]: === Iteration 46 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:02,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:02,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1947697693, now seen corresponding path program 45 times [2019-08-04 21:22:02,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:02,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:22:02,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:03,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:03,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:22:03,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:22:03,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:22:03,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:22:03,981 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:22:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:04,298 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:22:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:22:04,298 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:22:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:04,299 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:22:04,299 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:22:04,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:22:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:22:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:22:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:22:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:22:04,302 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:22:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:04,302 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:22:04,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:22:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:22:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:22:04,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:04,303 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:22:04,303 INFO L418 AbstractCegarLoop]: === Iteration 47 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash -249075776, now seen corresponding path program 46 times [2019-08-04 21:22:04,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:04,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:22:04,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:05,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:05,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:22:05,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:22:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:22:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:22:05,800 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:22:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:05,899 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:22:05,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:22:05,900 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:22:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:05,901 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:22:05,901 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:22:05,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:22:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:22:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:22:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:22:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:22:05,904 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:22:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:05,904 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:22:05,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:22:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:22:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:22:05,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:05,904 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:22:05,905 INFO L418 AbstractCegarLoop]: === Iteration 48 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash 868596099, now seen corresponding path program 47 times [2019-08-04 21:22:05,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:05,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:22:05,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:07,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:07,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:22:07,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:22:07,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:22:07,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:22:07,721 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:22:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:07,814 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:22:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:22:07,815 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:22:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:07,816 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:22:07,816 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:22:07,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:22:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:22:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:22:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:22:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:22:07,820 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:22:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:07,820 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:22:07,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:22:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:22:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:22:07,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:07,821 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:22:07,821 INFO L418 AbstractCegarLoop]: === Iteration 49 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:07,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1156685856, now seen corresponding path program 48 times [2019-08-04 21:22:07,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:07,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:22:07,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:09,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:09,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:22:09,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:22:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:22:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:22:09,921 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:22:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:10,030 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:22:10,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:22:10,030 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:22:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:10,031 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:22:10,031 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:22:10,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:22:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:22:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:22:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:22:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:22:10,034 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:22:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:10,034 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:22:10,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:22:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:22:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:22:10,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:10,035 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:22:10,035 INFO L418 AbstractCegarLoop]: === Iteration 50 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1497533731, now seen corresponding path program 49 times [2019-08-04 21:22:10,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:10,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:22:10,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:12,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:12,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:22:12,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:22:12,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:22:12,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:22:12,076 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:22:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:12,162 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:22:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:22:12,162 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:22:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:12,163 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:22:12,163 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:22:12,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:22:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:22:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:22:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:22:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:22:12,166 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:22:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:12,166 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:22:12,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:22:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:22:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:22:12,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,167 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:22:12,167 INFO L418 AbstractCegarLoop]: === Iteration 51 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,168 INFO L82 PathProgramCache]: Analyzing trace with hash -821084032, now seen corresponding path program 50 times [2019-08-04 21:22:12,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:14,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:14,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:22:14,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:22:14,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:22:14,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:22:14,585 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:22:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:14,698 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:22:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:22:14,699 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:22:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:14,700 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:22:14,700 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:22:14,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:22:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:22:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:22:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:22:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:22:14,702 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:22:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:14,703 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:22:14,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:22:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:22:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:22:14,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:14,703 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:22:14,704 INFO L418 AbstractCegarLoop]: === Iteration 52 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:14,704 INFO L82 PathProgramCache]: Analyzing trace with hash 316209347, now seen corresponding path program 51 times [2019-08-04 21:22:14,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:14,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-04 21:22:14,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:16,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:16,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:22:16,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:22:16,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:22:16,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:22:16,943 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:22:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:17,046 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:22:17,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:22:17,047 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:22:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:17,048 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:22:17,048 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:22:17,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:22:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:22:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:22:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:22:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:22:17,050 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:22:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:17,050 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:22:17,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:22:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:22:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:22:17,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:17,051 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:22:17,051 INFO L418 AbstractCegarLoop]: === Iteration 53 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1212565728, now seen corresponding path program 52 times [2019-08-04 21:22:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:17,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:22:17,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:19,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:22:19,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:22:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:22:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:22:19,525 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:22:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:19,636 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:22:19,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:22:19,636 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:22:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:19,637 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:22:19,637 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:22:19,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:22:19,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:22:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:22:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:22:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:22:19,640 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:22:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:19,640 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:22:19,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:22:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:22:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:22:19,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:19,641 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:22:19,641 INFO L418 AbstractCegarLoop]: === Iteration 54 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:19,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1065157533, now seen corresponding path program 53 times [2019-08-04 21:22:19,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:19,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-04 21:22:19,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:21,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:21,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:22:21,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:22:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:22:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:22:21,946 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:22:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:22,081 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:22:22,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:22:22,081 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:22:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:22,082 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:22:22,082 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:22:22,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:22:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:22:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:22:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:22:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:22:22,085 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:22:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:22,086 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:22:22,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:22:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:22:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:22:22,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:22,086 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:22:22,086 INFO L418 AbstractCegarLoop]: === Iteration 55 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1339865408, now seen corresponding path program 54 times [2019-08-04 21:22:22,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:22,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-04 21:22:22,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:24,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:24,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:22:24,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:22:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:22:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:22:24,677 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:22:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:24,801 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:22:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:22:24,801 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:22:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:24,802 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:22:24,802 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:22:24,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:22:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:22:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:22:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:22:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:22:24,804 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:22:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:24,805 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:22:24,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:22:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:22:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:22:24,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:24,806 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:22:24,806 INFO L418 AbstractCegarLoop]: === Iteration 56 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:24,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:24,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1413834749, now seen corresponding path program 55 times [2019-08-04 21:22:24,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:24,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-04 21:22:24,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:27,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:27,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:22:27,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:22:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:22:27,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:22:27,168 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:22:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:27,294 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:22:27,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:22:27,295 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:22:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:27,296 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:22:27,296 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:22:27,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:22:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:22:27,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:22:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:22:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:22:27,299 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:22:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:27,300 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:22:27,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:22:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:22:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:22:27,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:27,300 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:22:27,300 INFO L418 AbstractCegarLoop]: === Iteration 57 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:27,301 INFO L82 PathProgramCache]: Analyzing trace with hash -879193696, now seen corresponding path program 56 times [2019-08-04 21:22:27,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:27,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-04 21:22:27,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:30,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:30,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:22:30,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:22:30,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:22:30,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:22:30,009 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:22:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:30,118 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:22:30,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:22:30,119 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:22:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:30,120 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:22:30,120 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:22:30,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:22:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:22:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:22:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:22:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:22:30,125 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:22:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:30,125 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:22:30,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:22:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:22:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:22:30,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:30,126 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:22:30,127 INFO L418 AbstractCegarLoop]: === Iteration 58 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:30,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:30,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1485190237, now seen corresponding path program 57 times [2019-08-04 21:22:30,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:30,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-04 21:22:30,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:33,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:33,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:22:33,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:22:33,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:22:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:22:33,476 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:22:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:33,589 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:22:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:22:33,589 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:22:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:33,590 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:22:33,590 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:22:33,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:22:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:22:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:22:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:22:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:22:33,592 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:22:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:33,592 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:22:33,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:22:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:22:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:22:33,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:33,594 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:22:33,594 INFO L418 AbstractCegarLoop]: === Iteration 59 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1203753472, now seen corresponding path program 58 times [2019-08-04 21:22:33,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:33,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-04 21:22:33,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:36,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:36,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:22:36,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:22:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:22:36,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:22:36,885 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:22:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:36,990 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:22:36,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:22:36,991 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:22:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:36,992 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:22:36,992 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:22:36,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:22:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:22:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:22:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:22:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:22:36,994 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:22:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:36,994 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:22:36,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:22:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:22:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:22:36,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:36,995 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:22:36,995 INFO L418 AbstractCegarLoop]: === Iteration 60 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:36,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1338337469, now seen corresponding path program 59 times [2019-08-04 21:22:36,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:37,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-04 21:22:37,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:40,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:40,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:22:40,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:22:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:22:40,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:22:40,096 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:22:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:40,224 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:22:40,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:22:40,225 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:22:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:40,226 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:22:40,226 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:22:40,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:22:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:22:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:22:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:22:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:22:40,228 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:22:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:40,229 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:22:40,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:22:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:22:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:22:40,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:40,229 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:22:40,229 INFO L418 AbstractCegarLoop]: === Iteration 61 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:40,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1461221984, now seen corresponding path program 60 times [2019-08-04 21:22:40,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:40,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-04 21:22:40,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:43,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:43,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:22:43,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:22:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:22:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:22:43,020 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:22:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:43,155 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:22:43,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:22:43,155 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:22:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:43,156 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:22:43,156 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:22:43,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:22:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:22:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:22:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:22:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:22:43,159 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:22:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:43,159 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:22:43,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:22:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:22:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:22:43,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:43,160 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:22:43,160 INFO L418 AbstractCegarLoop]: === Iteration 62 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1946748189, now seen corresponding path program 61 times [2019-08-04 21:22:43,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:43,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-04 21:22:43,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:46,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:46,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:22:46,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:22:46,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:22:46,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:22:46,406 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:22:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:46,572 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:22:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:22:46,573 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:22:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:46,574 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:22:46,574 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:22:46,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:22:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:22:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:22:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:22:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:22:46,576 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:22:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:46,577 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:22:46,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:22:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:22:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:22:46,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:46,577 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:22:46,578 INFO L418 AbstractCegarLoop]: === Iteration 63 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash -219641152, now seen corresponding path program 62 times [2019-08-04 21:22:46,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:46,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-04 21:22:46,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:49,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:49,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:22:49,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:22:49,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:22:49,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:22:49,729 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:22:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:49,865 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:22:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:22:49,866 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:22:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:49,866 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:22:49,866 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:22:49,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:22:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:22:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:22:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:22:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:22:49,869 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:22:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:49,870 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:22:49,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:22:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:22:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:22:49,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:49,871 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:22:49,871 INFO L418 AbstractCegarLoop]: === Iteration 64 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1781069443, now seen corresponding path program 63 times [2019-08-04 21:22:49,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:49,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-04 21:22:49,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:52,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:52,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:22:52,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:22:52,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:22:52,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:22:52,974 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:22:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:53,122 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:22:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:22:53,123 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:22:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:53,124 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:22:53,124 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:22:53,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:22:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:22:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:22:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:22:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:22:53,127 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:22:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:53,128 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:22:53,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:22:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:22:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:22:53,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:53,129 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:22:53,129 INFO L418 AbstractCegarLoop]: === Iteration 65 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:53,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash -621411552, now seen corresponding path program 64 times [2019-08-04 21:22:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:53,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-04 21:22:53,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:56,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:56,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:22:56,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:22:56,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:22:56,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:22:56,747 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:22:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:56,893 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:22:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:22:56,894 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:22:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:56,895 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:22:56,895 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:22:56,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:22:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:22:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:22:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:22:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:22:56,898 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:22:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:56,899 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:22:56,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:22:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:22:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:22:56,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:56,900 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:22:56,900 INFO L418 AbstractCegarLoop]: === Iteration 66 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2083878365, now seen corresponding path program 65 times [2019-08-04 21:22:56,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:56,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-04 21:22:56,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:00,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:00,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:23:00,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:23:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:23:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:23:00,572 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:23:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:00,700 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:23:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:23:00,701 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:23:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:00,702 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:23:00,702 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:23:00,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:23:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:23:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:23:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:23:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:23:00,704 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:23:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:00,705 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:23:00,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:23:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:23:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:23:00,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:00,706 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:23:00,706 INFO L418 AbstractCegarLoop]: === Iteration 67 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:00,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:00,706 INFO L82 PathProgramCache]: Analyzing trace with hash -175709312, now seen corresponding path program 66 times [2019-08-04 21:23:00,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:00,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-04 21:23:00,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:06,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:23:06,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:23:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:23:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:23:06,019 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:23:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:06,156 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:23:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:23:06,157 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:23:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:06,157 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:23:06,157 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:23:06,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:23:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:23:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:23:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:23:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:23:06,160 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:23:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:06,160 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:23:06,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:23:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:23:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:23:06,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:06,161 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:23:06,161 INFO L418 AbstractCegarLoop]: === Iteration 68 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1152010813, now seen corresponding path program 67 times [2019-08-04 21:23:06,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:06,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-04 21:23:06,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:09,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:09,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:23:09,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:23:09,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:23:09,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:23:09,964 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:23:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:10,106 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:23:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:23:10,106 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:23:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:10,107 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:23:10,107 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:23:10,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:23:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:23:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:23:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:23:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:23:10,110 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:23:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:10,111 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:23:10,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:23:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:23:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:23:10,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:10,111 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:23:10,112 INFO L418 AbstractCegarLoop]: === Iteration 69 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1352586272, now seen corresponding path program 68 times [2019-08-04 21:23:10,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:10,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-04 21:23:10,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:13,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:13,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:23:13,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:23:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:23:13,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:23:13,697 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:23:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:13,849 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:23:13,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:23:13,849 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:23:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:13,850 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:23:13,850 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:23:13,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:23:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:23:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:23:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:23:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:23:13,852 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:23:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:13,853 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:23:13,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:23:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:23:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:23:13,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:13,854 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:23:13,854 INFO L418 AbstractCegarLoop]: === Iteration 70 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:13,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1019509091, now seen corresponding path program 69 times [2019-08-04 21:23:13,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:13,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-04 21:23:13,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:17,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:17,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:23:17,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:23:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:23:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:23:17,876 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:23:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:18,025 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:23:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:23:18,025 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:23:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:18,027 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:23:18,027 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:23:18,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:23:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:23:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:23:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:23:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:23:18,030 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:23:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:18,030 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:23:18,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:23:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:23:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:23:18,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:18,031 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:23:18,032 INFO L418 AbstractCegarLoop]: === Iteration 71 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:18,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1540021312, now seen corresponding path program 70 times [2019-08-04 21:23:18,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:18,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-04 21:23:18,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:22,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:22,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:23:22,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:23:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:23:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:23:22,140 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:23:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:22,294 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:23:22,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:23:22,295 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:23:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:22,296 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:23:22,296 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:23:22,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:23:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:23:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:23:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:23:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:23:22,299 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:23:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:22,299 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:23:22,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:23:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:23:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:23:22,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:22,300 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:23:22,300 INFO L418 AbstractCegarLoop]: === Iteration 72 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash 496030979, now seen corresponding path program 71 times [2019-08-04 21:23:22,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:22,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-04 21:23:22,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:26,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:26,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:23:26,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:23:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:23:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:23:26,505 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:23:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:26,646 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:23:26,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:23:26,646 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:23:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:26,647 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:23:26,648 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:23:26,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:23:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:23:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:23:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:23:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:23:26,651 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:23:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:26,651 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:23:26,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:23:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:23:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:23:26,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:26,652 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:23:26,652 INFO L418 AbstractCegarLoop]: === Iteration 73 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:26,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1802898272, now seen corresponding path program 72 times [2019-08-04 21:23:26,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:26,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-04 21:23:26,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:30,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:23:30,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:23:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:23:30,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:23:30,983 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:23:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:31,137 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:23:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:23:31,137 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:23:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:31,138 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:23:31,138 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:23:31,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:23:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:23:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:23:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:23:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:23:31,141 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:23:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:31,141 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:23:31,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:23:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:23:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:23:31,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:31,142 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:23:31,143 INFO L418 AbstractCegarLoop]: === Iteration 74 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -55261021, now seen corresponding path program 73 times [2019-08-04 21:23:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:31,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-04 21:23:31,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:35,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:35,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:23:35,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:23:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:23:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:23:35,874 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:23:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:36,025 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:23:36,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:23:36,026 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:23:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:36,027 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:23:36,027 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:23:36,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:23:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:23:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:23:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:23:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:23:36,030 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:23:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:36,030 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:23:36,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:23:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:23:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:23:36,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:36,031 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:23:36,031 INFO L418 AbstractCegarLoop]: === Iteration 75 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:36,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1713081088, now seen corresponding path program 74 times [2019-08-04 21:23:36,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:36,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-04 21:23:36,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:40,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:40,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:23:40,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:23:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:23:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:23:40,673 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:23:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:40,815 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:23:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:23:40,815 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:23:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:40,816 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:23:40,816 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:23:40,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:23:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:23:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:23:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:23:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:23:40,820 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:23:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:40,820 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:23:40,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:23:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:23:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:23:40,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:40,821 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:23:40,821 INFO L418 AbstractCegarLoop]: === Iteration 76 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:40,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:40,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1565895613, now seen corresponding path program 75 times [2019-08-04 21:23:40,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:40,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-04 21:23:40,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:45,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:45,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:23:45,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:23:45,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:23:45,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:23:45,110 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:23:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:45,270 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:23:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:23:45,271 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:23:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:45,272 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:23:45,272 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:23:45,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:23:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:23:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:23:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:23:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:23:45,274 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:23:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:45,275 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:23:45,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:23:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:23:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:23:45,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:45,276 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:23:45,276 INFO L418 AbstractCegarLoop]: === Iteration 77 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1298113184, now seen corresponding path program 76 times [2019-08-04 21:23:45,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:45,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-04 21:23:45,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:23:49,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:23:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:23:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:23:49,896 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:23:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:50,056 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:23:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:23:50,057 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:23:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:50,058 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:23:50,058 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:23:50,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:23:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:23:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:23:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:23:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:23:50,061 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:23:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:50,061 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:23:50,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:23:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:23:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:23:50,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:50,062 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:23:50,062 INFO L418 AbstractCegarLoop]: === Iteration 78 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:50,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1586792477, now seen corresponding path program 77 times [2019-08-04 21:23:50,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:50,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-04 21:23:50,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:54,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:54,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:23:54,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:23:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:23:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:23:54,740 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:23:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:55,293 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:23:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:23:55,294 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:23:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:55,294 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:23:55,295 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:23:55,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:23:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:23:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:23:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:23:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:23:55,297 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:23:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:55,298 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:23:55,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:23:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:23:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:23:55,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:55,299 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:23:55,299 INFO L418 AbstractCegarLoop]: === Iteration 79 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1945915968, now seen corresponding path program 78 times [2019-08-04 21:23:55,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:55,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-04 21:23:55,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:00,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:00,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:24:00,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:24:00,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:24:00,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:24:00,439 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-04 21:24:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:00,698 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:24:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:24:00,699 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-04 21:24:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:00,700 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:24:00,700 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:24:00,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:24:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:24:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:24:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:24:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:24:00,702 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-04 21:24:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:00,703 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:24:00,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:24:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:24:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:24:00,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:00,703 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-04 21:24:00,704 INFO L418 AbstractCegarLoop]: === Iteration 80 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash -193842301, now seen corresponding path program 79 times [2019-08-04 21:24:00,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:00,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-04 21:24:00,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:05,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:05,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:24:05,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:24:05,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:24:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:24:05,794 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-04 21:24:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:05,999 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-04 21:24:06,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:24:06,000 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-04 21:24:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:06,000 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:24:06,000 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:24:06,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:24:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:24:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:24:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:24:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-04 21:24:06,002 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-04 21:24:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:06,002 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-04 21:24:06,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:24:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-04 21:24:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:24:06,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:06,003 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-04 21:24:06,004 INFO L418 AbstractCegarLoop]: === Iteration 81 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:06,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1714133472, now seen corresponding path program 80 times [2019-08-04 21:24:06,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:06,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-04 21:24:06,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:11,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:11,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:24:11,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:24:11,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:24:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:24:11,096 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-04 21:24:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:11,331 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-04 21:24:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:24:11,331 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-04 21:24:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:11,332 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:24:11,332 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:24:11,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:24:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:24:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:24:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:24:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:24:11,335 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-04 21:24:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:11,335 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:24:11,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:24:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:24:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:24:11,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:11,336 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-04 21:24:11,336 INFO L418 AbstractCegarLoop]: === Iteration 82 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1598519517, now seen corresponding path program 81 times [2019-08-04 21:24:11,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:11,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-04 21:24:11,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:17,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:17,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:24:17,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:24:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:24:17,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:24:17,077 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-04 21:24:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:17,404 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:24:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:24:17,405 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-04 21:24:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:17,406 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:24:17,406 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:24:17,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:24:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:24:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:24:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:24:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-04 21:24:17,409 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-04 21:24:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:17,409 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-04 21:24:17,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:24:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-04 21:24:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:24:17,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:17,410 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-04 21:24:17,410 INFO L418 AbstractCegarLoop]: === Iteration 83 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1985513088, now seen corresponding path program 82 times [2019-08-04 21:24:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:17,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-04 21:24:17,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:23,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:23,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:24:23,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:24:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:24:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:24:23,190 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-04 21:24:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:23,358 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-04 21:24:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:24:23,358 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-04 21:24:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:23,359 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:24:23,359 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:24:23,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:24:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:24:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:24:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:24:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-04 21:24:23,362 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-04 21:24:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:23,362 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-04 21:24:23,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:24:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-04 21:24:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:24:23,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:23,363 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-04 21:24:23,363 INFO L418 AbstractCegarLoop]: === Iteration 84 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:23,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1421374147, now seen corresponding path program 83 times [2019-08-04 21:24:23,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:23,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-04 21:24:23,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:28,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:28,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:24:28,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:24:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:24:28,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:24:28,889 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-04 21:24:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:29,167 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-04 21:24:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:24:29,168 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-04 21:24:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:29,168 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:24:29,168 INFO L226 Difference]: Without dead ends: 88 [2019-08-04 21:24:29,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:24:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-04 21:24:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-04 21:24:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:24:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-04 21:24:29,171 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-04 21:24:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:29,172 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-04 21:24:29,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:24:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-04 21:24:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-04 21:24:29,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:29,173 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-04 21:24:29,173 INFO L418 AbstractCegarLoop]: === Iteration 85 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:29,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1112936160, now seen corresponding path program 84 times [2019-08-04 21:24:29,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:29,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 172 conjunts are in the unsatisfiable core [2019-08-04 21:24:29,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:34,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:34,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:24:34,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:24:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:24:34,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:24:34,923 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-04 21:24:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:35,099 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-04 21:24:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:24:35,100 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-04 21:24:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:35,101 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:24:35,101 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:24:35,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:24:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:24:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:24:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:24:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-04 21:24:35,104 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-04 21:24:35,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:35,104 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-04 21:24:35,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:24:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-04 21:24:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:24:35,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:35,105 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-04 21:24:35,105 INFO L418 AbstractCegarLoop]: === Iteration 86 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash 141293155, now seen corresponding path program 85 times [2019-08-04 21:24:35,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:35,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-04 21:24:35,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:40,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:40,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:24:40,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:24:40,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:24:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:24:40,820 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-04 21:24:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:41,073 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-04 21:24:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:24:41,074 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-04 21:24:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:41,075 INFO L225 Difference]: With dead ends: 90 [2019-08-04 21:24:41,075 INFO L226 Difference]: Without dead ends: 90 [2019-08-04 21:24:41,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:24:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-04 21:24:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-04 21:24:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:24:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-04 21:24:41,078 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-04 21:24:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:41,078 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-04 21:24:41,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:24:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-04 21:24:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-04 21:24:41,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:41,079 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-04 21:24:41,079 INFO L418 AbstractCegarLoop]: === Iteration 87 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:41,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 85131072, now seen corresponding path program 86 times [2019-08-04 21:24:41,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:41,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-04 21:24:41,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:47,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:47,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:24:47,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:24:47,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:24:47,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:24:47,143 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-04 21:24:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:47,343 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-04 21:24:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-04 21:24:47,343 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-04 21:24:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:47,344 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:24:47,344 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:24:47,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:24:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:24:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:24:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:24:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-04 21:24:47,347 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-04 21:24:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:47,347 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-04 21:24:47,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-04 21:24:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-04 21:24:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:24:47,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:47,348 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-04 21:24:47,348 INFO L418 AbstractCegarLoop]: === Iteration 88 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:47,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1655893501, now seen corresponding path program 87 times [2019-08-04 21:24:47,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:47,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-04 21:24:47,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:53,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:53,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:24:53,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:24:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:24:53,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:24:53,461 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-04 21:24:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:53,627 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-04 21:24:53,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:24:53,627 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-04 21:24:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:53,628 INFO L225 Difference]: With dead ends: 92 [2019-08-04 21:24:53,628 INFO L226 Difference]: Without dead ends: 92 [2019-08-04 21:24:53,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:24:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-04 21:24:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-04 21:24:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-04 21:24:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-04 21:24:53,630 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-04 21:24:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:53,631 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-04 21:24:53,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:24:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-04 21:24:53,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-04 21:24:53,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:53,632 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-04 21:24:53,632 INFO L418 AbstractCegarLoop]: === Iteration 89 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:53,632 INFO L82 PathProgramCache]: Analyzing trace with hash 206919584, now seen corresponding path program 88 times [2019-08-04 21:24:53,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:53,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-04 21:24:53,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:59,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:59,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-04 21:24:59,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-04 21:24:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-04 21:24:59,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:24:59,726 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-04 21:24:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:59,905 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-04 21:24:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:24:59,906 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-04 21:24:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:59,906 INFO L225 Difference]: With dead ends: 93 [2019-08-04 21:24:59,906 INFO L226 Difference]: Without dead ends: 93 [2019-08-04 21:24:59,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:24:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-04 21:24:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-04 21:24:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:24:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-04 21:24:59,908 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-04 21:24:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:59,908 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-04 21:24:59,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-04 21:24:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-04 21:24:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:24:59,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:59,909 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-04 21:24:59,909 INFO L418 AbstractCegarLoop]: === Iteration 90 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:59,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2119550371, now seen corresponding path program 89 times [2019-08-04 21:24:59,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:59,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-04 21:24:59,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:06,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:06,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:25:06,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:25:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:25:06,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:25:06,103 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-04 21:25:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:06,583 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-04 21:25:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:25:06,583 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-04 21:25:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:06,584 INFO L225 Difference]: With dead ends: 94 [2019-08-04 21:25:06,584 INFO L226 Difference]: Without dead ends: 94 [2019-08-04 21:25:06,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:25:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-04 21:25:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-04 21:25:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-04 21:25:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-04 21:25:06,588 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-04 21:25:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:06,588 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-04 21:25:06,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:25:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-04 21:25:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-04 21:25:06,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:06,589 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-04 21:25:06,589 INFO L418 AbstractCegarLoop]: === Iteration 91 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:06,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:06,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1281562624, now seen corresponding path program 90 times [2019-08-04 21:25:06,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:06,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 184 conjunts are in the unsatisfiable core [2019-08-04 21:25:06,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:13,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:13,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-04 21:25:13,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-04 21:25:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-04 21:25:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:25:13,382 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-04 21:25:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:13,576 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-04 21:25:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-04 21:25:13,576 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-04 21:25:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:13,577 INFO L225 Difference]: With dead ends: 95 [2019-08-04 21:25:13,578 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:25:13,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:25:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:25:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-04 21:25:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-04 21:25:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-04 21:25:13,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-04 21:25:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:13,581 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-04 21:25:13,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-04 21:25:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-04 21:25:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:25:13,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:13,582 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-04 21:25:13,582 INFO L418 AbstractCegarLoop]: === Iteration 92 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:13,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:13,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1073746243, now seen corresponding path program 91 times [2019-08-04 21:25:13,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:13,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-04 21:25:13,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:20,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:20,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:25:20,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:25:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:25:20,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:25:20,068 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-04 21:25:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:20,253 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-04 21:25:20,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:25:20,254 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-04 21:25:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:20,255 INFO L225 Difference]: With dead ends: 96 [2019-08-04 21:25:20,255 INFO L226 Difference]: Without dead ends: 96 [2019-08-04 21:25:20,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:25:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-04 21:25:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-04 21:25:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-04 21:25:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-04 21:25:20,257 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-04 21:25:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:20,257 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-04 21:25:20,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:25:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-04 21:25:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-04 21:25:20,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:20,258 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-04 21:25:20,258 INFO L418 AbstractCegarLoop]: === Iteration 93 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:20,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1073594272, now seen corresponding path program 92 times [2019-08-04 21:25:20,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:20,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 188 conjunts are in the unsatisfiable core [2019-08-04 21:25:20,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-04 21:25:25,254 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:25:25,254 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:25:25,258 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:25:25,258 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:25:25 BoogieIcfgContainer [2019-08-04 21:25:25,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:25:25,260 INFO L168 Benchmark]: Toolchain (without parser) took 245117.09 ms. Allocated memory was 141.0 MB in the beginning and 620.8 MB in the end (delta: 479.7 MB). Free memory was 109.3 MB in the beginning and 262.9 MB in the end (delta: -153.6 MB). Peak memory consumption was 326.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:25:25,261 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:25:25,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.28 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:25:25,262 INFO L168 Benchmark]: Boogie Preprocessor took 22.25 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 105.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:25:25,263 INFO L168 Benchmark]: RCFGBuilder took 498.27 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 92.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:25:25,263 INFO L168 Benchmark]: TraceAbstraction took 244557.05 ms. Allocated memory was 141.0 MB in the beginning and 620.8 MB in the end (delta: 479.7 MB). Free memory was 91.8 MB in the beginning and 262.9 MB in the end (delta: -171.1 MB). Peak memory consumption was 308.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:25:25,266 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.22 ms. Allocated memory is still 141.0 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.28 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.25 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 105.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 498.27 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 92.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244557.05 ms. Allocated memory was 141.0 MB in the beginning and 620.8 MB in the end (delta: 479.7 MB). Free memory was 91.8 MB in the beginning and 262.9 MB in the end (delta: -171.1 MB). Peak memory consumption was 308.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 92,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 244.4s OverallTime, 93 OverallIterations, 92 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 277 SDtfs, 0 SDslu, 1146 SDs, 0 SdLazy, 5515 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4370 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 218.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=92, 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.2s AutomataMinimizationTime, 92 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 224.1s InterpolantComputationTime, 4462 NumberOfCodeBlocks, 4462 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 4370 ConstructedInterpolants, 4278 QuantifiedInterpolants, 3757602 SizeOfPredicates, 4462 NumberOfNonLiveVariables, 26588 ConjunctsInSsa, 8740 ConjunctsInUnsatCore, 92 InterpolantComputations, 1 PerfectInterpolantSequences, 0/129766 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown