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/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:46:41,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:46:41,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:46:41,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:46:41,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:46:41,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:46:41,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:46:41,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:46:41,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:46:41,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:46:41,280 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:46:41,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:46:41,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:46:41,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:46:41,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:46:41,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:46:41,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:46:41,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:46:41,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:46:41,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:46:41,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:46:41,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:46:41,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:46:41,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:46:41,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:46:41,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:46:41,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:46:41,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:46:41,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:46:41,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:46:41,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:46:41,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:46:41,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:46:41,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:46:41,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:46:41,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:46:41,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:46:41,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:46:41,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:46:41,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:46:41,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:46:41,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:46:41,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:46:41,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:46:41,367 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:46:41,368 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:46:41,369 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl [2019-08-04 21:46:41,369 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2019-08-04 21:46:41,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:46:41,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:46:41,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:46:41,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:46:41,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:46:41,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,444 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:46:41,444 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:46:41,444 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:46:41,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:46:41,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:46:41,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:46:41,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:46:41,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/1) ... [2019-08-04 21:46:41,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:46:41,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:46:41,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:46:41,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:46:41,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (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:46:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-04 21:46:41,547 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-04 21:46:41,815 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:46:41,816 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:46:41,817 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:46:41 BoogieIcfgContainer [2019-08-04 21:46:41,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:46:41,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:46:41,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:46:41,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:46:41,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:41" (1/2) ... [2019-08-04 21:46:41,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c92440 and model type doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:46:41, skipping insertion in model container [2019-08-04 21:46:41,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:46:41" (2/2) ... [2019-08-04 21:46:41,826 INFO L109 eAbstractionObserver]: Analyzing ICFG doubleLoopUniformIterations.bpl [2019-08-04 21:46:41,835 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:46:41,842 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-04 21:46:41,857 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-04 21:46:41,881 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:46:41,882 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:46:41,882 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:46:41,883 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:46:41,883 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:46:41,883 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:46:41,883 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:46:41,883 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:46:41,883 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:46:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-04 21:46:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:46:41,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:41,910 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:46:41,912 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash 926725, now seen corresponding path program 1 times [2019-08-04 21:46:41,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:41,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:46:42,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:42,039 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:46:42,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:46:42,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-04 21:46:42,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:46:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:46:42,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:46:42,062 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-04 21:46:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:42,138 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-08-04 21:46:42,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:46:42,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-04 21:46:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:42,151 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:46:42,151 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:46:42,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:46:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:46:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:46:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:46:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-04 21:46:42,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 4 [2019-08-04 21:46:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:42,184 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-04 21:46:42,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:46:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-04 21:46:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:46:42,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:42,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-04 21:46:42,186 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:42,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:42,187 INFO L82 PathProgramCache]: Analyzing trace with hash 28728519, now seen corresponding path program 1 times [2019-08-04 21:46:42,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:42,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:46:42,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:42,259 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:46:42,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:46:42,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-04 21:46:42,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:46:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:46:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:46:42,268 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 3 states. [2019-08-04 21:46:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:42,423 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-04 21:46:42,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:46:42,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-04 21:46:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:42,425 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:46:42,426 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:46:42,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:46:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:46:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:46:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:46:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-04 21:46:42,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-04 21:46:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:42,430 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-04 21:46:42,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:46:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-04 21:46:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:46:42,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:42,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:46:42,435 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash 891297133, now seen corresponding path program 1 times [2019-08-04 21:46:42,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:42,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:46:42,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:42,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:46:42,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:46:42,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:46:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:46:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:42,603 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-04 21:46:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:42,680 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-04 21:46:42,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:46:42,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-04 21:46:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:42,681 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:46:42,682 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:46:42,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:46:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:46:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:46:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-04 21:46:42,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-04 21:46:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:42,686 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-04 21:46:42,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:46:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-04 21:46:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:46:42,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:42,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:46:42,687 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:42,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1860345825, now seen corresponding path program 1 times [2019-08-04 21:46:42,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:42,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:46:42,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:42,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:42,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-04 21:46:42,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:46:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:46:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:42,736 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-04 21:46:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:42,774 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-04 21:46:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:46:42,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-04 21:46:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:42,775 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:46:42,775 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:46:42,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:46:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-04 21:46:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:46:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-04 21:46:42,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2019-08-04 21:46:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:42,779 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-04 21:46:42,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:46:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-04 21:46:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:46:42,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:42,780 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:46:42,780 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:42,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1836084205, now seen corresponding path program 2 times [2019-08-04 21:46:42,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:42,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:46:42,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:42,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:42,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:46:42,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:46:42,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:46:42,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:42,851 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 4 states. [2019-08-04 21:46:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:42,915 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-04 21:46:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:46:42,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-04 21:46:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:42,917 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:46:42,917 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:46:42,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:46:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:46:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:46:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-04 21:46:42,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2019-08-04 21:46:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:42,921 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-04 21:46:42,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:46:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-04 21:46:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:46:42,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:42,923 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:46:42,923 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:42,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1860095751, now seen corresponding path program 3 times [2019-08-04 21:46:42,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:42,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:46:42,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:43,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:43,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:46:43,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:46:43,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:46:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:43,008 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-04 21:46:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:43,198 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-04 21:46:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:46:43,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-04 21:46:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:43,199 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:46:43,200 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:46:43,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:46:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:46:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:46:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-04 21:46:43,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-04 21:46:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:43,203 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-04 21:46:43,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:46:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-04 21:46:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:46:43,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:43,204 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-04 21:46:43,204 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1828331911, now seen corresponding path program 4 times [2019-08-04 21:46:43,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:43,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:46:43,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:43,309 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:46:43,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:43,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:46:43,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:46:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:46:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:43,310 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2019-08-04 21:46:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:43,367 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-04 21:46:43,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:46:43,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-04 21:46:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:43,369 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:46:43,369 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:46:43,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:46:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-08-04 21:46:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:46:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-04 21:46:43,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-08-04 21:46:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:43,375 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-04 21:46:43,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:46:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-04 21:46:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:46:43,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:43,375 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-04 21:46:43,377 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:43,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:43,378 INFO L82 PathProgramCache]: Analyzing trace with hash 843652871, now seen corresponding path program 5 times [2019-08-04 21:46:43,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:43,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:46:43,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:43,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:43,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:46:43,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:46:43,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:46:43,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:43,513 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2019-08-04 21:46:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:43,587 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-04 21:46:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:46:43,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-04 21:46:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:43,588 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:46:43,588 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:46:43,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:46:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:46:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:46:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-04 21:46:43,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2019-08-04 21:46:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:43,591 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-04 21:46:43,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:46:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-04 21:46:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:46:43,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:43,592 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-04 21:46:43,593 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1588010797, now seen corresponding path program 6 times [2019-08-04 21:46:43,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:43,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:46:43,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:43,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:43,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:46:43,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:46:43,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:46:43,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:43,686 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-04 21:46:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:43,820 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-04 21:46:43,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:46:43,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-04 21:46:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:43,821 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:46:43,822 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:46:43,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:46:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:46:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:46:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-04 21:46:43,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-08-04 21:46:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:43,826 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-04 21:46:43,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:46:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-04 21:46:43,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:46:43,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:43,827 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2019-08-04 21:46:43,827 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:43,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:43,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1983632929, now seen corresponding path program 7 times [2019-08-04 21:46:43,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:43,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:46:43,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:43,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:43,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:46:43,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:46:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:46:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:43,893 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2019-08-04 21:46:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:43,956 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-08-04 21:46:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:46:43,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-04 21:46:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:43,958 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:46:43,958 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:46:43,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:46:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-08-04 21:46:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:46:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-04 21:46:43,961 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2019-08-04 21:46:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:43,961 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-04 21:46:43,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:46:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-04 21:46:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:46:43,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:43,962 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-04 21:46:43,963 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:43,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:43,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1363017133, now seen corresponding path program 8 times [2019-08-04 21:46:43,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:43,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:46:43,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:44,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:44,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:46:44,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:46:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:46:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:44,032 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2019-08-04 21:46:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:44,091 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-04 21:46:44,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:46:44,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-04 21:46:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:44,092 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:46:44,092 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:46:44,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:46:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:46:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:46:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-04 21:46:44,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2019-08-04 21:46:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:44,096 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-04 21:46:44,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:46:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-04 21:46:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:46:44,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:44,097 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-04 21:46:44,097 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1331690937, now seen corresponding path program 9 times [2019-08-04 21:46:44,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:44,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:46:44,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:44,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:44,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:46:44,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:46:44,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:46:44,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:44,212 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-04 21:46:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:44,508 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-04 21:46:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:46:44,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-04 21:46:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:44,509 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:46:44,509 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:46:44,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:46:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:46:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:46:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-04 21:46:44,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-08-04 21:46:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:44,513 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-04 21:46:44,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:46:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-04 21:46:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:46:44,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:44,514 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2019-08-04 21:46:44,514 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1667192391, now seen corresponding path program 10 times [2019-08-04 21:46:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:44,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:46:44,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:44,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:44,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:46:44,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:46:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:46:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:44,614 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2019-08-04 21:46:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:44,695 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-04 21:46:44,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:46:44,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:46:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:44,697 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:46:44,697 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:46:44,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:46:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2019-08-04 21:46:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:46:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-04 21:46:44,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-08-04 21:46:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:44,702 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-04 21:46:44,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:46:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-04 21:46:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:46:44,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:44,703 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-04 21:46:44,703 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash 143295047, now seen corresponding path program 11 times [2019-08-04 21:46:44,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:44,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:46:44,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:44,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:44,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:46:44,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:46:44,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:46:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:44,800 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2019-08-04 21:46:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:44,861 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-04 21:46:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:46:44,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-04 21:46:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:44,863 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:46:44,863 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:46:44,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:46:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:46:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:46:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-04 21:46:44,867 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2019-08-04 21:46:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:44,867 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-04 21:46:44,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:46:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-04 21:46:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:46:44,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:44,868 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-04 21:46:44,869 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1788276499, now seen corresponding path program 12 times [2019-08-04 21:46:44,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:44,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:46:44,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:44,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:44,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:46:44,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:46:44,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:46:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:44,978 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-08-04 21:46:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:45,023 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-04 21:46:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:46:45,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-04 21:46:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:45,025 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:46:45,025 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:46:45,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:46:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:46:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:46:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-04 21:46:45,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-04 21:46:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:45,029 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-04 21:46:45,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:46:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-04 21:46:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:46:45,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:45,029 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2019-08-04 21:46:45,030 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash 397941857, now seen corresponding path program 13 times [2019-08-04 21:46:45,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:45,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:46:45,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:45,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:45,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:46:45,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:46:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:46:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:45,263 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-08-04 21:46:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:45,401 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-08-04 21:46:45,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:46:45,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-04 21:46:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:45,402 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:46:45,402 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:46:45,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:46:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-08-04 21:46:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:46:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-04 21:46:45,406 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2019-08-04 21:46:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:45,407 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-04 21:46:45,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:46:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-04 21:46:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:46:45,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:45,408 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-04 21:46:45,408 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:45,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash -548765843, now seen corresponding path program 14 times [2019-08-04 21:46:45,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:45,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:46:45,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:45,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:45,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:46:45,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:46:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:46:45,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:45,529 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-08-04 21:46:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:45,629 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-04 21:46:45,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:46:45,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-08-04 21:46:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:45,631 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:46:45,631 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:46:45,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:46:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:46:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:46:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-04 21:46:45,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2019-08-04 21:46:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:45,635 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-04 21:46:45,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:46:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-04 21:46:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:46:45,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:45,636 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-04 21:46:45,636 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:45,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash -297941625, now seen corresponding path program 15 times [2019-08-04 21:46:45,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:45,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:46:45,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:45,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:45,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:46:45,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:46:45,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:46:45,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:45,789 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-08-04 21:46:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:45,847 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-04 21:46:45,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:46:45,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-04 21:46:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:45,849 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:46:45,849 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:46:45,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:46:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:46:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:46:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-04 21:46:45,852 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2019-08-04 21:46:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:45,853 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-04 21:46:45,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:46:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-04 21:46:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:46:45,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:45,854 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2019-08-04 21:46:45,854 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:45,854 INFO L82 PathProgramCache]: Analyzing trace with hash -646317305, now seen corresponding path program 16 times [2019-08-04 21:46:45,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:45,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:46:45,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:45,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:45,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:46:45,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:46:45,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:46:45,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:45,974 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 9 states. [2019-08-04 21:46:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:46,114 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-04 21:46:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:46:46,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-08-04 21:46:46,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:46,116 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:46:46,116 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:46:46,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:46:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-08-04 21:46:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:46:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-04 21:46:46,120 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-08-04 21:46:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:46,120 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-04 21:46:46,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:46:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-04 21:46:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:46:46,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:46,122 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-04 21:46:46,122 INFO L418 AbstractCegarLoop]: === Iteration 20 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1438938503, now seen corresponding path program 17 times [2019-08-04 21:46:46,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:46,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:46:46,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:46,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:46,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:46:46,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:46:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:46:46,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:46,252 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 9 states. [2019-08-04 21:46:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:46,332 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-04 21:46:46,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:46:46,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:46:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:46,337 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:46:46,337 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:46:46,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:46:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:46:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:46:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-04 21:46:46,340 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2019-08-04 21:46:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:46,340 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-04 21:46:46,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:46:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-04 21:46:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:46:46,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:46,341 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-04 21:46:46,342 INFO L418 AbstractCegarLoop]: === Iteration 21 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash 624554669, now seen corresponding path program 18 times [2019-08-04 21:46:46,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:46,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:46:46,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:46,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:46,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:46:46,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:46:46,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:46:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:46,445 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-08-04 21:46:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:46,517 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-04 21:46:46,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:46:46,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-04 21:46:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:46,518 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:46:46,518 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:46:46,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:46:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:46:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:46:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-04 21:46:46,522 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-08-04 21:46:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:46,522 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-04 21:46:46,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:46:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-04 21:46:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:46:46,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:46,523 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2019-08-04 21:46:46,524 INFO L418 AbstractCegarLoop]: === Iteration 22 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:46,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2113703263, now seen corresponding path program 19 times [2019-08-04 21:46:46,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:46,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:46:46,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:46,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:46,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:46:46,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:46:46,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:46:46,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:46,651 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2019-08-04 21:46:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:46,791 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-08-04 21:46:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:46:46,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-08-04 21:46:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:46,794 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:46:46,794 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:46:46,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:46:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-08-04 21:46:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:46:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-04 21:46:46,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-08-04 21:46:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:46,798 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-04 21:46:46,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:46:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-04 21:46:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:46:46,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:46,799 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-04 21:46:46,799 INFO L418 AbstractCegarLoop]: === Iteration 23 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1100353235, now seen corresponding path program 20 times [2019-08-04 21:46:46,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:46,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:46:46,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:46,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:46,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:46:46,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:46:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:46:46,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:46,894 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states. [2019-08-04 21:46:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:47,279 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-04 21:46:47,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:46:47,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-08-04 21:46:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:47,280 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:46:47,280 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:46:47,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:46:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:46:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:46:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-04 21:46:47,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2019-08-04 21:46:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:47,284 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-04 21:46:47,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:46:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-04 21:46:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:46:47,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:47,285 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-04 21:46:47,286 INFO L418 AbstractCegarLoop]: === Iteration 24 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash -576448313, now seen corresponding path program 21 times [2019-08-04 21:46:47,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:47,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:46:47,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:47,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:47,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:46:47,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:46:47,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:46:47,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:47,405 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-08-04 21:46:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:47,456 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-04 21:46:47,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:46:47,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-04 21:46:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:47,458 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:46:47,458 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:46:47,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:46:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:46:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:46:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-04 21:46:47,461 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-08-04 21:46:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:47,462 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-04 21:46:47,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:46:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-04 21:46:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:46:47,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:47,464 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2019-08-04 21:46:47,464 INFO L418 AbstractCegarLoop]: === Iteration 25 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:47,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:47,465 INFO L82 PathProgramCache]: Analyzing trace with hash -690090041, now seen corresponding path program 22 times [2019-08-04 21:46:47,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:47,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:46:47,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:47,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:47,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:46:47,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:46:47,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:46:47,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:47,568 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2019-08-04 21:46:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:47,690 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-08-04 21:46:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:46:47,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-08-04 21:46:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:47,691 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:46:47,691 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:46:47,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:46:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-08-04 21:46:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:46:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-04 21:46:47,695 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-08-04 21:46:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:47,695 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-04 21:46:47,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:46:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-04 21:46:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:46:47,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:47,696 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-04 21:46:47,696 INFO L418 AbstractCegarLoop]: === Iteration 26 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:47,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:47,697 INFO L82 PathProgramCache]: Analyzing trace with hash 81983687, now seen corresponding path program 23 times [2019-08-04 21:46:47,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:47,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:46:47,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:47,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:47,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:46:47,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:46:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:46:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:47,860 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2019-08-04 21:46:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:48,199 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-04 21:46:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:46:48,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-08-04 21:46:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:48,201 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:46:48,201 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:46:48,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:46:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:46:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:46:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-04 21:46:48,204 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2019-08-04 21:46:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:48,204 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-04 21:46:48,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:46:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-04 21:46:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:46:48,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:48,205 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-04 21:46:48,205 INFO L418 AbstractCegarLoop]: === Iteration 27 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:48,206 INFO L82 PathProgramCache]: Analyzing trace with hash -856832915, now seen corresponding path program 24 times [2019-08-04 21:46:48,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:48,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:46:48,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:48,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:48,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:46:48,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:46:48,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:46:48,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:48,629 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-08-04 21:46:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:48,688 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-08-04 21:46:48,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:46:48,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-04 21:46:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:48,690 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:46:48,690 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:46:48,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:46:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:46:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:46:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-04 21:46:48,693 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-08-04 21:46:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:48,694 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-04 21:46:48,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:46:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-04 21:46:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:46:48,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:48,695 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2019-08-04 21:46:48,695 INFO L418 AbstractCegarLoop]: === Iteration 28 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash -792078111, now seen corresponding path program 25 times [2019-08-04 21:46:48,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:48,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:46:48,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:49,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:49,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:46:49,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:46:49,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:46:49,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:49,132 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-08-04 21:46:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:49,302 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-08-04 21:46:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:46:49,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-08-04 21:46:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:49,303 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:46:49,303 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:46:49,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:46:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-08-04 21:46:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:46:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-08-04 21:46:49,306 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2019-08-04 21:46:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:49,306 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-08-04 21:46:49,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:46:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-08-04 21:46:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:46:49,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:49,307 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-04 21:46:49,307 INFO L418 AbstractCegarLoop]: === Iteration 29 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:49,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:49,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1215320813, now seen corresponding path program 26 times [2019-08-04 21:46:49,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:49,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:46:49,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:49,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:49,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:46:49,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:46:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:46:49,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:49,396 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 12 states. [2019-08-04 21:46:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:49,589 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-04 21:46:49,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:46:49,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-08-04 21:46:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:49,590 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:46:49,590 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:46:49,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:46:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:46:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:46:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-04 21:46:49,594 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2019-08-04 21:46:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:49,594 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-04 21:46:49,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:46:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-04 21:46:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:46:49,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:49,595 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-04 21:46:49,595 INFO L418 AbstractCegarLoop]: === Iteration 30 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:49,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2118190073, now seen corresponding path program 27 times [2019-08-04 21:46:49,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:49,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:46:49,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:49,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:49,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:46:49,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:46:49,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:46:49,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:49,993 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-08-04 21:46:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:50,036 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-04 21:46:50,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:46:50,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-04 21:46:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:50,037 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:46:50,038 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:46:50,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:46:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:46:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:46:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-04 21:46:50,041 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2019-08-04 21:46:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:50,041 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-04 21:46:50,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:46:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-04 21:46:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:46:50,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:50,042 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2019-08-04 21:46:50,043 INFO L418 AbstractCegarLoop]: === Iteration 31 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1239444345, now seen corresponding path program 28 times [2019-08-04 21:46:50,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:50,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:46:50,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:50,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:50,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:46:50,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:46:50,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:46:50,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:50,300 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-08-04 21:46:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:50,585 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-08-04 21:46:50,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:46:50,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-08-04 21:46:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:50,586 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:46:50,587 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:46:50,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:46:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-08-04 21:46:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:46:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-04 21:46:50,590 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2019-08-04 21:46:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:50,590 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-04 21:46:50,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:46:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-04 21:46:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:46:50,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:50,591 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2019-08-04 21:46:50,591 INFO L418 AbstractCegarLoop]: === Iteration 32 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash 231869447, now seen corresponding path program 29 times [2019-08-04 21:46:50,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:50,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:46:50,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:46:50,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:46:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:46:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:50,778 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 13 states. [2019-08-04 21:46:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:50,960 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-04 21:46:50,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:46:50,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-08-04 21:46:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:50,961 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:46:50,962 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:46:50,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:46:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:46:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:46:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-04 21:46:50,965 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2019-08-04 21:46:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:50,965 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-04 21:46:50,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:46:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-04 21:46:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:46:50,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:50,966 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2019-08-04 21:46:50,966 INFO L418 AbstractCegarLoop]: === Iteration 33 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:50,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:50,967 INFO L82 PathProgramCache]: Analyzing trace with hash -27752915, now seen corresponding path program 30 times [2019-08-04 21:46:50,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:50,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:46:50,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:51,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:51,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:46:51,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:46:51,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:46:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:51,156 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-08-04 21:46:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:51,218 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-04 21:46:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:46:51,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-04 21:46:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:51,219 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:46:51,219 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:46:51,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:46:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:46:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:46:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-04 21:46:51,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-08-04 21:46:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:51,223 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-04 21:46:51,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:46:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-04 21:46:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:46:51,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:51,224 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1] [2019-08-04 21:46:51,224 INFO L418 AbstractCegarLoop]: === Iteration 34 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash -860401887, now seen corresponding path program 31 times [2019-08-04 21:46:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:51,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:46:51,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:51,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:51,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:46:51,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:46:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:46:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:51,534 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2019-08-04 21:46:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:51,818 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-08-04 21:46:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:46:51,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-08-04 21:46:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:51,820 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:46:51,820 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:46:51,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:46:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2019-08-04 21:46:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:46:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-08-04 21:46:51,823 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2019-08-04 21:46:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:51,824 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-08-04 21:46:51,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:46:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-08-04 21:46:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:46:51,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:51,824 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2019-08-04 21:46:51,825 INFO L418 AbstractCegarLoop]: === Iteration 35 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash -902716243, now seen corresponding path program 32 times [2019-08-04 21:46:51,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:51,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:46:51,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:52,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:52,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:46:52,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:46:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:46:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:52,995 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 14 states. [2019-08-04 21:46:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:53,515 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-04 21:46:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:46:53,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-08-04 21:46:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:53,516 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:46:53,517 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:46:53,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:46:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:46:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:46:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-04 21:46:53,525 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2019-08-04 21:46:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:53,525 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-04 21:46:53,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:46:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-04 21:46:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:46:53,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:53,526 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2019-08-04 21:46:53,526 INFO L418 AbstractCegarLoop]: === Iteration 36 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:53,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:53,528 INFO L82 PathProgramCache]: Analyzing trace with hash -361074873, now seen corresponding path program 33 times [2019-08-04 21:46:53,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:53,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:46:53,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:54,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:54,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:46:54,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:46:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:46:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:54,022 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-08-04 21:46:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:54,134 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-08-04 21:46:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:46:54,134 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-04 21:46:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:54,135 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:46:54,135 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:46:54,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:46:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:46:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:46:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-04 21:46:54,139 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2019-08-04 21:46:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:54,139 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-04 21:46:54,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:46:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-04 21:46:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:46:54,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:54,140 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1] [2019-08-04 21:46:54,140 INFO L418 AbstractCegarLoop]: === Iteration 37 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:54,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1691519303, now seen corresponding path program 34 times [2019-08-04 21:46:54,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:54,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:46:54,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:54,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:54,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:46:54,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:46:54,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:46:54,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:54,384 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2019-08-04 21:46:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:54,618 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-08-04 21:46:54,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:46:54,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-08-04 21:46:54,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:54,620 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:46:54,620 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:46:54,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:46:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-08-04 21:46:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:46:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-08-04 21:46:54,623 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2019-08-04 21:46:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:54,623 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-08-04 21:46:54,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:46:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-08-04 21:46:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:46:54,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:54,624 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2019-08-04 21:46:54,624 INFO L418 AbstractCegarLoop]: === Iteration 38 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 897429319, now seen corresponding path program 35 times [2019-08-04 21:46:54,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:54,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:46:54,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:54,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:46:54,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:46:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:46:54,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:54,924 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2019-08-04 21:46:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:55,157 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-04 21:46:55,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:46:55,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-08-04 21:46:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:55,158 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:46:55,158 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:46:55,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:46:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:46:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:46:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-04 21:46:55,160 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2019-08-04 21:46:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:55,161 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-04 21:46:55,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:46:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-04 21:46:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:46:55,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:55,161 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2019-08-04 21:46:55,161 INFO L418 AbstractCegarLoop]: === Iteration 39 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash 508442605, now seen corresponding path program 36 times [2019-08-04 21:46:55,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:55,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:46:55,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:55,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:55,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:46:55,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:46:55,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:46:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:55,358 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-08-04 21:46:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:55,430 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-04 21:46:55,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:46:55,430 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-04 21:46:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:55,431 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:46:55,431 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:46:55,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:46:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:46:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:46:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-04 21:46:55,433 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-08-04 21:46:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:55,434 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-04 21:46:55,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:46:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-04 21:46:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:46:55,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:55,434 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1] [2019-08-04 21:46:55,435 INFO L418 AbstractCegarLoop]: === Iteration 40 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:55,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1418209951, now seen corresponding path program 37 times [2019-08-04 21:46:55,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:55,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:46:55,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:55,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:55,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:46:55,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:46:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:46:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:55,582 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2019-08-04 21:46:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:55,928 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-08-04 21:46:55,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:46:55,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-08-04 21:46:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:55,929 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:46:55,929 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:46:55,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:46:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-08-04 21:46:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:46:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-08-04 21:46:55,932 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2019-08-04 21:46:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:55,932 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-08-04 21:46:55,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:46:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-08-04 21:46:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:46:55,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:55,933 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2019-08-04 21:46:55,933 INFO L418 AbstractCegarLoop]: === Iteration 41 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1014897043, now seen corresponding path program 38 times [2019-08-04 21:46:55,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:55,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:46:55,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:56,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:56,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:46:56,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:46:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:46:56,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:56,072 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 16 states. [2019-08-04 21:46:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:56,365 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-04 21:46:56,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:46:56,366 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-08-04 21:46:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:56,367 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:46:56,367 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:46:56,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:46:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:46:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:46:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-04 21:46:56,369 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2019-08-04 21:46:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:56,370 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-04 21:46:56,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:46:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-04 21:46:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:46:56,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:56,370 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2019-08-04 21:46:56,370 INFO L418 AbstractCegarLoop]: === Iteration 42 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash -188583289, now seen corresponding path program 39 times [2019-08-04 21:46:56,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:56,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:46:56,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:56,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:56,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:46:56,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:46:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:46:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:46:56,495 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-08-04 21:46:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:56,547 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-04 21:46:56,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:46:56,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-04 21:46:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:56,549 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:46:56,549 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:46:56,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:46:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:46:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:46:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:46:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-04 21:46:56,551 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2019-08-04 21:46:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:56,551 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-04 21:46:56,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:46:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-04 21:46:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:46:56,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:56,552 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1] [2019-08-04 21:46:56,552 INFO L418 AbstractCegarLoop]: === Iteration 43 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1551176185, now seen corresponding path program 40 times [2019-08-04 21:46:56,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:56,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:46:56,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:56,843 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:46:56,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:56,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:46:56,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:46:56,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:46:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:46:56,845 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2019-08-04 21:46:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:57,298 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-08-04 21:46:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:46:57,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-08-04 21:46:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:57,299 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:46:57,299 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:46:57,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:46:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:46:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2019-08-04 21:46:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:46:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-08-04 21:46:57,302 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2019-08-04 21:46:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:57,302 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-08-04 21:46:57,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:46:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-08-04 21:46:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:46:57,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:57,303 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2019-08-04 21:46:57,303 INFO L418 AbstractCegarLoop]: === Iteration 44 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:57,303 INFO L82 PathProgramCache]: Analyzing trace with hash -841883001, now seen corresponding path program 41 times [2019-08-04 21:46:57,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:57,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:46:57,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:57,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:57,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:46:57,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:46:57,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:46:57,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:46:57,684 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 17 states. [2019-08-04 21:46:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:57,998 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-04 21:46:57,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:46:57,998 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-08-04 21:46:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:57,999 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:46:57,999 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:46:58,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:46:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:46:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:46:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:46:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-04 21:46:58,001 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2019-08-04 21:46:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:58,002 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-04 21:46:58,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:46:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-04 21:46:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:46:58,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:58,003 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2019-08-04 21:46:58,003 INFO L418 AbstractCegarLoop]: === Iteration 45 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:58,003 INFO L82 PathProgramCache]: Analyzing trace with hash -995960403, now seen corresponding path program 42 times [2019-08-04 21:46:58,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:58,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:46:58,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:58,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:58,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:46:58,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:46:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:46:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:46:58,416 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-08-04 21:46:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:58,493 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-08-04 21:46:58,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:46:58,494 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-08-04 21:46:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:58,494 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:46:58,494 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:46:58,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:46:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:46:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:46:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:46:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-04 21:46:58,497 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-08-04 21:46:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:58,497 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-04 21:46:58,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:46:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-04 21:46:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:46:58,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:58,498 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1] [2019-08-04 21:46:58,498 INFO L418 AbstractCegarLoop]: === Iteration 46 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash -810062943, now seen corresponding path program 43 times [2019-08-04 21:46:58,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:58,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:46:58,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:58,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:58,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:46:58,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:46:58,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:46:58,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:46:58,719 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 18 states. [2019-08-04 21:46:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:59,118 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-08-04 21:46:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:46:59,118 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-08-04 21:46:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:59,119 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:46:59,119 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:46:59,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:46:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:46:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2019-08-04 21:46:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:46:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-08-04 21:46:59,122 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2019-08-04 21:46:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:59,123 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-08-04 21:46:59,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:46:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-08-04 21:46:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:46:59,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:59,123 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2019-08-04 21:46:59,124 INFO L418 AbstractCegarLoop]: === Iteration 47 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:59,124 INFO L82 PathProgramCache]: Analyzing trace with hash 657791021, now seen corresponding path program 44 times [2019-08-04 21:46:59,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:59,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:46:59,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:59,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:59,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:46:59,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:46:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:46:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:46:59,313 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 18 states. [2019-08-04 21:46:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:59,671 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-04 21:46:59,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:46:59,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-08-04 21:46:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:59,672 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:46:59,672 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:46:59,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:46:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:46:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:46:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:46:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-04 21:46:59,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2019-08-04 21:46:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:59,676 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-04 21:46:59,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:46:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-04 21:46:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:46:59,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:59,676 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2019-08-04 21:46:59,677 INFO L418 AbstractCegarLoop]: === Iteration 48 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash 176358855, now seen corresponding path program 45 times [2019-08-04 21:46:59,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:59,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:46:59,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:59,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:59,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:46:59,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:46:59,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:46:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:46:59,924 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-08-04 21:46:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:59,989 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-04 21:46:59,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:46:59,990 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-04 21:46:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:59,990 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:46:59,990 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:46:59,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:46:59,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:46:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:46:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:46:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-04 21:46:59,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2019-08-04 21:46:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:59,993 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-04 21:46:59,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:46:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-04 21:46:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:46:59,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:59,994 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1] [2019-08-04 21:46:59,994 INFO L418 AbstractCegarLoop]: === Iteration 49 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:59,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:59,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1172095687, now seen corresponding path program 46 times [2019-08-04 21:46:59,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:00,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:47:00,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:00,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:00,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:47:00,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:47:00,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:47:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:47:00,203 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 19 states. [2019-08-04 21:47:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:00,590 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-08-04 21:47:00,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:47:00,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2019-08-04 21:47:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:00,591 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:47:00,591 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:47:00,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:47:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:47:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-08-04 21:47:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:47:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-08-04 21:47:00,594 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2019-08-04 21:47:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:00,595 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-08-04 21:47:00,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:47:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-08-04 21:47:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:47:00,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:00,595 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2019-08-04 21:47:00,596 INFO L418 AbstractCegarLoop]: === Iteration 50 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1975166407, now seen corresponding path program 47 times [2019-08-04 21:47:00,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:00,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:47:00,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:00,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:00,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:47:00,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:47:00,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:47:00,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:47:00,819 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 19 states. [2019-08-04 21:47:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:01,211 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-08-04 21:47:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:47:01,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-08-04 21:47:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:01,213 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:47:01,213 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:47:01,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:47:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:47:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:47:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:47:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-04 21:47:01,216 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2019-08-04 21:47:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:01,216 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-04 21:47:01,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:47:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-04 21:47:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:47:01,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:01,217 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2019-08-04 21:47:01,217 INFO L418 AbstractCegarLoop]: === Iteration 51 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash -64328851, now seen corresponding path program 48 times [2019-08-04 21:47:01,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:01,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:47:01,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:01,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:01,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:47:01,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:47:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:47:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:47:01,428 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-08-04 21:47:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:01,579 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-04 21:47:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:47:01,580 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-08-04 21:47:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:01,581 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:47:01,581 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:47:01,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:47:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:47:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:47:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:47:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-04 21:47:01,583 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-08-04 21:47:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:01,584 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-04 21:47:01,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:47:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-04 21:47:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:47:01,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:01,585 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1] [2019-08-04 21:47:01,585 INFO L418 AbstractCegarLoop]: === Iteration 52 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:01,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1994255903, now seen corresponding path program 49 times [2019-08-04 21:47:01,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:01,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:47:01,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:01,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:01,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:47:01,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:47:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:47:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:47:01,756 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 20 states. [2019-08-04 21:47:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:02,189 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-08-04 21:47:02,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:47:02,190 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2019-08-04 21:47:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:02,191 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:47:02,191 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:47:02,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:47:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:47:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-08-04 21:47:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:47:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-08-04 21:47:02,193 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2019-08-04 21:47:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:02,194 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-08-04 21:47:02,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:47:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-08-04 21:47:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:47:02,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:02,195 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2019-08-04 21:47:02,195 INFO L418 AbstractCegarLoop]: === Iteration 53 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:02,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1692452371, now seen corresponding path program 50 times [2019-08-04 21:47:02,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:02,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:47:02,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:02,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:02,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:47:02,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:47:02,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:47:02,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:47:02,471 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 20 states. [2019-08-04 21:47:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:02,915 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-04 21:47:02,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:47:02,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-08-04 21:47:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:02,916 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:47:02,916 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:47:02,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:47:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:47:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:47:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:47:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-04 21:47:02,919 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2019-08-04 21:47:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:02,920 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-04 21:47:02,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:47:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-04 21:47:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:47:02,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:02,920 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2019-08-04 21:47:02,921 INFO L418 AbstractCegarLoop]: === Iteration 54 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash -492295929, now seen corresponding path program 51 times [2019-08-04 21:47:02,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:02,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:47:02,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:03,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:03,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:47:03,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:47:03,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:47:03,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:47:03,163 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-08-04 21:47:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:03,274 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-08-04 21:47:03,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:47:03,275 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-04 21:47:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:03,275 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:47:03,275 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:47:03,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:47:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:47:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:47:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:47:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-04 21:47:03,277 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2019-08-04 21:47:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:03,277 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-04 21:47:03,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:47:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-04 21:47:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:47:03,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:03,278 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1] [2019-08-04 21:47:03,278 INFO L418 AbstractCegarLoop]: === Iteration 55 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1918633863, now seen corresponding path program 52 times [2019-08-04 21:47:03,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:03,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:47:03,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:03,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:03,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:47:03,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:47:03,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:47:03,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:47:03,662 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2019-08-04 21:47:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:04,162 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-08-04 21:47:04,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:47:04,163 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-08-04 21:47:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:04,164 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:47:04,164 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:47:04,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:47:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:47:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2019-08-04 21:47:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:47:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-08-04 21:47:04,166 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2019-08-04 21:47:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:04,166 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-08-04 21:47:04,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:47:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-08-04 21:47:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:47:04,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:04,167 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2019-08-04 21:47:04,168 INFO L418 AbstractCegarLoop]: === Iteration 56 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash -651953913, now seen corresponding path program 53 times [2019-08-04 21:47:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:04,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:47:04,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:04,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:04,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:47:04,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:47:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:47:04,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:47:04,365 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 21 states. [2019-08-04 21:47:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:04,854 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-08-04 21:47:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:47:04,855 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-08-04 21:47:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:04,855 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:47:04,856 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:47:04,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:47:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:47:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:47:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:47:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-04 21:47:04,870 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 42 [2019-08-04 21:47:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:04,870 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-04 21:47:04,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:47:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-04 21:47:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:47:04,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:04,871 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2019-08-04 21:47:04,871 INFO L418 AbstractCegarLoop]: === Iteration 57 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2101809875, now seen corresponding path program 54 times [2019-08-04 21:47:04,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:04,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:47:04,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:05,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:05,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:47:05,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:47:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:47:05,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:47:05,062 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-08-04 21:47:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:05,133 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-04 21:47:05,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:47:05,133 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-08-04 21:47:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:05,134 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:47:05,134 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:47:05,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:47:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:47:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:47:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:47:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-08-04 21:47:05,137 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-08-04 21:47:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:05,137 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-08-04 21:47:05,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:47:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-08-04 21:47:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:47:05,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:05,138 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1] [2019-08-04 21:47:05,138 INFO L418 AbstractCegarLoop]: === Iteration 58 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash -731658207, now seen corresponding path program 55 times [2019-08-04 21:47:05,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:05,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:47:05,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:05,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:05,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:47:05,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:47:05,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:47:05,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:47:05,343 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2019-08-04 21:47:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:05,869 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-08-04 21:47:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:47:05,870 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2019-08-04 21:47:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:05,871 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:47:05,871 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:47:05,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:47:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:47:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2019-08-04 21:47:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:47:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-08-04 21:47:05,873 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-08-04 21:47:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:05,873 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-08-04 21:47:05,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:47:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-08-04 21:47:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:47:05,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:05,874 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2019-08-04 21:47:05,874 INFO L418 AbstractCegarLoop]: === Iteration 59 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1206629459, now seen corresponding path program 56 times [2019-08-04 21:47:05,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:05,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:47:05,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:06,382 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:06,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:06,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:47:06,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:47:06,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:47:06,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:47:06,384 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 22 states. [2019-08-04 21:47:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:06,912 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-04 21:47:06,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:47:06,913 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2019-08-04 21:47:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:06,913 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:47:06,914 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:47:06,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:47:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:47:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:47:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:47:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-04 21:47:06,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2019-08-04 21:47:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:06,916 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-04 21:47:06,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:47:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-04 21:47:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:47:06,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:06,917 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2019-08-04 21:47:06,917 INFO L418 AbstractCegarLoop]: === Iteration 60 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1092475975, now seen corresponding path program 57 times [2019-08-04 21:47:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:06,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:47:06,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:07,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:07,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:47:07,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:47:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:47:07,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:47:07,304 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-08-04 21:47:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:08,552 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-04 21:47:08,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:47:08,553 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-04 21:47:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:08,553 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:47:08,553 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:47:08,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:47:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:47:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:47:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:47:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-04 21:47:08,555 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2019-08-04 21:47:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:08,555 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-04 21:47:08,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:47:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-04 21:47:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:47:08,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:08,556 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1] [2019-08-04 21:47:08,556 INFO L418 AbstractCegarLoop]: === Iteration 61 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash -493044665, now seen corresponding path program 58 times [2019-08-04 21:47:08,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:08,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:47:08,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:09,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:09,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:47:09,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:47:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:47:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:47:09,016 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 23 states. [2019-08-04 21:47:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:09,605 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-08-04 21:47:09,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:47:09,606 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-08-04 21:47:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:09,607 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:47:09,607 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:47:09,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:47:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:47:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2019-08-04 21:47:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:47:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-08-04 21:47:09,610 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2019-08-04 21:47:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:09,610 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-08-04 21:47:09,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:47:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-08-04 21:47:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:47:09,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:09,611 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2019-08-04 21:47:09,611 INFO L418 AbstractCegarLoop]: === Iteration 62 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:09,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1895423047, now seen corresponding path program 59 times [2019-08-04 21:47:09,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:09,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:47:09,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 21 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:09,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:09,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:47:09,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:47:09,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:47:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:47:09,863 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 23 states. [2019-08-04 21:47:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:10,431 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-04 21:47:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:47:10,431 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-08-04 21:47:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:10,432 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:47:10,432 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:47:10,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:47:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:47:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:47:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:47:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-04 21:47:10,435 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 46 [2019-08-04 21:47:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:10,435 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-04 21:47:10,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:47:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-04 21:47:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:47:10,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:10,436 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2019-08-04 21:47:10,436 INFO L418 AbstractCegarLoop]: === Iteration 63 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash 153247469, now seen corresponding path program 60 times [2019-08-04 21:47:10,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:10,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:47:10,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:10,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:47:10,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:47:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:47:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:47:10,784 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-08-04 21:47:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:10,974 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-08-04 21:47:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:47:10,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-08-04 21:47:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:10,976 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:47:10,976 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:47:10,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:47:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:47:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:47:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:47:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-04 21:47:10,979 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-08-04 21:47:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:10,979 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-04 21:47:10,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:47:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-04 21:47:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:47:10,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:10,980 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1] [2019-08-04 21:47:10,980 INFO L418 AbstractCegarLoop]: === Iteration 64 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:10,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 455642721, now seen corresponding path program 61 times [2019-08-04 21:47:10,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:10,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:47:10,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:11,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:11,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:47:11,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:47:11,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:47:11,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:47:11,328 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 24 states. [2019-08-04 21:47:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:11,978 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-08-04 21:47:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:47:11,979 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2019-08-04 21:47:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:11,979 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:47:11,980 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:47:11,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:47:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:47:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2019-08-04 21:47:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:47:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-08-04 21:47:11,982 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2019-08-04 21:47:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:11,983 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-08-04 21:47:11,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:47:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-08-04 21:47:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:47:11,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:11,983 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2019-08-04 21:47:11,984 INFO L418 AbstractCegarLoop]: === Iteration 65 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:11,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1239960941, now seen corresponding path program 62 times [2019-08-04 21:47:11,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:12,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:47:12,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:12,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:12,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:47:12,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:47:12,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:47:12,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:47:12,247 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 24 states. [2019-08-04 21:47:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:12,878 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-04 21:47:12,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:47:12,879 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-08-04 21:47:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:12,879 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:47:12,880 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:47:12,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:47:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:47:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:47:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:47:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-04 21:47:12,882 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 48 [2019-08-04 21:47:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:12,883 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-04 21:47:12,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:47:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-04 21:47:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:47:12,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:12,884 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2019-08-04 21:47:12,884 INFO L418 AbstractCegarLoop]: === Iteration 66 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1227874425, now seen corresponding path program 63 times [2019-08-04 21:47:12,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:12,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:47:12,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:13,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:13,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:47:13,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:47:13,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:47:13,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:47:13,268 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-08-04 21:47:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:13,360 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-04 21:47:13,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:47:13,361 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-04 21:47:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:13,362 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:47:13,362 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:47:13,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:47:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:47:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:47:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:47:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-08-04 21:47:13,364 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2019-08-04 21:47:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:13,365 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-08-04 21:47:13,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:47:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-08-04 21:47:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:47:13,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:13,366 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1] [2019-08-04 21:47:13,366 INFO L418 AbstractCegarLoop]: === Iteration 67 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:13,367 INFO L82 PathProgramCache]: Analyzing trace with hash 590536967, now seen corresponding path program 64 times [2019-08-04 21:47:13,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:13,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:47:13,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:13,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:13,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:47:13,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:47:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:47:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:47:13,943 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 25 states. [2019-08-04 21:47:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:14,632 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-08-04 21:47:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:47:14,633 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2019-08-04 21:47:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:14,633 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:47:14,634 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:47:14,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:47:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:47:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2019-08-04 21:47:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:47:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-08-04 21:47:14,635 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2019-08-04 21:47:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:14,636 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-08-04 21:47:14,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:47:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-08-04 21:47:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:47:14,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:14,636 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2019-08-04 21:47:14,636 INFO L418 AbstractCegarLoop]: === Iteration 68 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1126715271, now seen corresponding path program 65 times [2019-08-04 21:47:14,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:14,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:47:14,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:14,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:14,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:47:14,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:47:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:47:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:47:14,921 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 25 states. [2019-08-04 21:47:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:15,606 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-04 21:47:15,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:47:15,607 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-08-04 21:47:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:15,607 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:47:15,607 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:47:15,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:47:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:47:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:47:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:47:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-04 21:47:15,610 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 50 [2019-08-04 21:47:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:15,610 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-04 21:47:15,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:47:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-04 21:47:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:47:15,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:15,611 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2019-08-04 21:47:15,611 INFO L418 AbstractCegarLoop]: === Iteration 69 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1933230253, now seen corresponding path program 66 times [2019-08-04 21:47:15,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:15,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:47:15,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:15,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:15,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:47:15,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:47:15,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:47:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:47:15,982 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-08-04 21:47:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:16,065 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-04 21:47:16,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:47:16,065 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-08-04 21:47:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:16,066 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:47:16,066 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:47:16,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:47:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:47:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:47:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:47:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-04 21:47:16,068 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-08-04 21:47:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:16,069 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-04 21:47:16,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:47:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-04 21:47:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:47:16,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:16,070 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1] [2019-08-04 21:47:16,070 INFO L418 AbstractCegarLoop]: === Iteration 70 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash -199465823, now seen corresponding path program 67 times [2019-08-04 21:47:16,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:16,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:47:16,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:16,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:16,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:47:16,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:47:16,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:47:16,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:47:16,670 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 26 states. [2019-08-04 21:47:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:17,416 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-08-04 21:47:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:47:17,416 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-08-04 21:47:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:17,417 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:47:17,417 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:47:17,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:47:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:47:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2019-08-04 21:47:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:47:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-08-04 21:47:17,419 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2019-08-04 21:47:17,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:17,420 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-08-04 21:47:17,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:47:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-08-04 21:47:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:47:17,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:17,421 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2019-08-04 21:47:17,421 INFO L418 AbstractCegarLoop]: === Iteration 71 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:17,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1888534739, now seen corresponding path program 68 times [2019-08-04 21:47:17,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:17,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:47:17,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:17,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:17,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:47:17,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:47:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:47:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:47:17,701 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 26 states. [2019-08-04 21:47:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:18,465 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-04 21:47:18,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:47:18,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-08-04 21:47:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:18,466 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:47:18,466 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:47:18,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:47:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:47:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:47:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:47:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-04 21:47:18,469 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 52 [2019-08-04 21:47:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:18,469 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-04 21:47:18,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:47:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-04 21:47:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:47:18,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:18,470 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2019-08-04 21:47:18,470 INFO L418 AbstractCegarLoop]: === Iteration 72 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1638593223, now seen corresponding path program 69 times [2019-08-04 21:47:18,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:18,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:47:18,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:19,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:19,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:47:19,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:47:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:47:19,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:47:19,064 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-08-04 21:47:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:19,143 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-08-04 21:47:19,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:47:19,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-04 21:47:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:19,144 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:47:19,144 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:47:19,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:47:19,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:47:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:47:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:47:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-04 21:47:19,147 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 52 [2019-08-04 21:47:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:19,148 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-04 21:47:19,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:47:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-04 21:47:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:47:19,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:19,149 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1] [2019-08-04 21:47:19,149 INFO L418 AbstractCegarLoop]: === Iteration 73 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:19,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:19,149 INFO L82 PathProgramCache]: Analyzing trace with hash -743279161, now seen corresponding path program 70 times [2019-08-04 21:47:19,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:19,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:47:19,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:47:19,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:47:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:47:19,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:47:19,470 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 27 states. [2019-08-04 21:47:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:20,289 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-08-04 21:47:20,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:47:20,290 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2019-08-04 21:47:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:20,290 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:47:20,291 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:47:20,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:47:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:47:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2019-08-04 21:47:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:47:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-08-04 21:47:20,293 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2019-08-04 21:47:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:20,293 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-08-04 21:47:20,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:47:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-08-04 21:47:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:47:20,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:20,294 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2019-08-04 21:47:20,294 INFO L418 AbstractCegarLoop]: === Iteration 74 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1566879033, now seen corresponding path program 71 times [2019-08-04 21:47:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:20,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:47:20,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:20,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:20,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:47:20,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:47:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:47:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:47:20,571 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 27 states. [2019-08-04 21:47:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:21,386 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-08-04 21:47:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:47:21,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-08-04 21:47:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:21,388 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:47:21,388 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:47:21,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:47:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:47:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:47:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:47:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-04 21:47:21,390 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 54 [2019-08-04 21:47:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:21,391 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-04 21:47:21,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:47:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-04 21:47:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:47:21,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:21,392 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2019-08-04 21:47:21,392 INFO L418 AbstractCegarLoop]: === Iteration 75 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash 399905389, now seen corresponding path program 72 times [2019-08-04 21:47:21,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:21,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:47:21,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:21,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:21,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:47:21,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:47:21,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:47:21,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:47:21,735 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-08-04 21:47:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:21,827 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-08-04 21:47:21,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:47:21,827 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-04 21:47:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:21,828 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:47:21,828 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:47:21,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:47:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:47:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:47:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:47:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-08-04 21:47:21,832 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-08-04 21:47:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:21,832 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-08-04 21:47:21,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:47:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-08-04 21:47:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:47:21,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:21,833 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1] [2019-08-04 21:47:21,833 INFO L418 AbstractCegarLoop]: === Iteration 76 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash -487896351, now seen corresponding path program 73 times [2019-08-04 21:47:21,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:21,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:47:21,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:22,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:22,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:47:22,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:47:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:47:22,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:47:22,199 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 28 states. [2019-08-04 21:47:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:23,357 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-08-04 21:47:23,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:47:23,358 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2019-08-04 21:47:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:23,358 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:47:23,359 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:47:23,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:47:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:47:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2019-08-04 21:47:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:47:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-08-04 21:47:23,361 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2019-08-04 21:47:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:23,361 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-08-04 21:47:23,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:47:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-08-04 21:47:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:47:23,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:23,362 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2019-08-04 21:47:23,362 INFO L418 AbstractCegarLoop]: === Iteration 77 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:23,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2055020781, now seen corresponding path program 74 times [2019-08-04 21:47:23,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:23,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:47:23,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:24,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:24,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:47:24,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:47:24,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:47:24,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:47:24,059 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 28 states. [2019-08-04 21:47:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:24,933 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-04 21:47:24,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:47:24,934 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-08-04 21:47:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:24,935 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:47:24,935 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:47:24,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:47:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:47:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:47:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:47:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-04 21:47:24,938 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 56 [2019-08-04 21:47:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:24,938 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-04 21:47:24,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:47:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-04 21:47:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:47:24,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:24,939 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2019-08-04 21:47:24,939 INFO L418 AbstractCegarLoop]: === Iteration 78 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:24,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:24,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1399171577, now seen corresponding path program 75 times [2019-08-04 21:47:24,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:24,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:47:24,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:25,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:25,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:47:25,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:47:25,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:47:25,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:47:25,422 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-08-04 21:47:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:25,520 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-04 21:47:25,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:47:25,521 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-08-04 21:47:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:25,522 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:47:25,522 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:47:25,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:47:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:47:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:47:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:47:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-04 21:47:25,525 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2019-08-04 21:47:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:25,525 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-04 21:47:25,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:47:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-04 21:47:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:47:25,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:25,526 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1] [2019-08-04 21:47:25,527 INFO L418 AbstractCegarLoop]: === Iteration 79 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash -424707449, now seen corresponding path program 76 times [2019-08-04 21:47:25,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:25,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:47:25,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:25,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:47:25,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:47:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:47:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:47:25,974 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 29 states. [2019-08-04 21:47:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:26,971 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-08-04 21:47:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:47:26,972 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2019-08-04 21:47:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:26,973 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:47:26,973 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:47:26,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:47:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:47:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2019-08-04 21:47:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:47:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-08-04 21:47:26,976 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2019-08-04 21:47:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:26,976 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-08-04 21:47:26,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:47:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-08-04 21:47:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:47:26,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:26,977 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2019-08-04 21:47:26,977 INFO L418 AbstractCegarLoop]: === Iteration 80 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash -281090553, now seen corresponding path program 77 times [2019-08-04 21:47:26,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:26,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:47:26,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 27 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:27,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:27,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:47:27,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:47:27,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:47:27,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:47:27,350 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 29 states. [2019-08-04 21:47:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:28,280 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-08-04 21:47:28,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:47:28,280 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-08-04 21:47:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:28,281 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:47:28,281 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:47:28,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:47:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:47:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:47:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:47:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-04 21:47:28,284 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 58 [2019-08-04 21:47:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:28,284 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-04 21:47:28,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:47:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-04 21:47:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:47:28,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:28,285 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2019-08-04 21:47:28,285 INFO L418 AbstractCegarLoop]: === Iteration 81 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash 13128749, now seen corresponding path program 78 times [2019-08-04 21:47:28,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:28,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:47:28,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:28,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:28,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:47:28,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:47:28,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:47:28,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:47:28,634 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-08-04 21:47:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:28,729 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-08-04 21:47:28,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:47:28,730 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-08-04 21:47:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:28,730 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:47:28,730 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:47:28,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:47:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:47:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:47:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:47:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-08-04 21:47:28,734 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-08-04 21:47:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:28,734 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-08-04 21:47:28,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:47:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-08-04 21:47:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:47:28,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:28,734 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1] [2019-08-04 21:47:28,735 INFO L418 AbstractCegarLoop]: === Iteration 82 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash 406929697, now seen corresponding path program 79 times [2019-08-04 21:47:28,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:28,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:47:28,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:29,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:29,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:47:29,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:47:29,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:47:29,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:47:29,231 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 30 states. [2019-08-04 21:47:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:30,232 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-08-04 21:47:30,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:47:30,233 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2019-08-04 21:47:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:30,234 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:47:30,234 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:47:30,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:47:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:47:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2019-08-04 21:47:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:47:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-08-04 21:47:30,236 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2019-08-04 21:47:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:30,237 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-08-04 21:47:30,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:47:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-08-04 21:47:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:47:30,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:30,238 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2019-08-04 21:47:30,238 INFO L418 AbstractCegarLoop]: === Iteration 83 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash -270142803, now seen corresponding path program 80 times [2019-08-04 21:47:30,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:30,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:47:30,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:30,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:30,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:47:30,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:47:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:47:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:47:30,647 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 30 states. [2019-08-04 21:47:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:31,675 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-04 21:47:31,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:47:31,676 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2019-08-04 21:47:31,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:31,676 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:47:31,677 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:47:31,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:47:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:47:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:47:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:47:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-04 21:47:31,679 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 60 [2019-08-04 21:47:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:31,680 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-04 21:47:31,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:47:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-04 21:47:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:47:31,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:31,681 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2019-08-04 21:47:31,681 INFO L418 AbstractCegarLoop]: === Iteration 84 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash 260720967, now seen corresponding path program 81 times [2019-08-04 21:47:31,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:31,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:47:31,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:32,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:47:32,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:47:32,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:47:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:47:32,404 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-08-04 21:47:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:32,506 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-08-04 21:47:32,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:47:32,507 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-08-04 21:47:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:32,507 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:47:32,508 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:47:32,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 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:47:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:47:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:47:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:47:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-08-04 21:47:32,510 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 60 [2019-08-04 21:47:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:32,511 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-08-04 21:47:32,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:47:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-08-04 21:47:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:47:32,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:32,512 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1] [2019-08-04 21:47:32,512 INFO L418 AbstractCegarLoop]: === Iteration 85 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:32,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:32,512 INFO L82 PathProgramCache]: Analyzing trace with hash -507646137, now seen corresponding path program 82 times [2019-08-04 21:47:32,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:32,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-04 21:47:32,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:34,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:34,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:47:34,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:47:34,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:47:34,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:47:34,329 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 31 states. [2019-08-04 21:47:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:35,452 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-08-04 21:47:35,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:47:35,453 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2019-08-04 21:47:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:35,454 INFO L225 Difference]: With dead ends: 94 [2019-08-04 21:47:35,454 INFO L226 Difference]: Without dead ends: 92 [2019-08-04 21:47:35,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:47:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-04 21:47:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2019-08-04 21:47:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:47:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-08-04 21:47:35,456 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2019-08-04 21:47:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:35,457 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-08-04 21:47:35,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:47:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-08-04 21:47:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:47:35,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:35,458 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2019-08-04 21:47:35,458 INFO L418 AbstractCegarLoop]: === Iteration 86 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1442777415, now seen corresponding path program 83 times [2019-08-04 21:47:35,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:35,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-04 21:47:35,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:35,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:35,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:47:35,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:47:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:47:35,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:47:35,993 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 31 states. [2019-08-04 21:47:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:37,079 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-04 21:47:37,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:47:37,079 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-08-04 21:47:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:37,080 INFO L225 Difference]: With dead ends: 92 [2019-08-04 21:47:37,080 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:47:37,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:47:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:47:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:47:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:47:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-04 21:47:37,083 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 62 [2019-08-04 21:47:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:37,083 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-04 21:47:37,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:47:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-04 21:47:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:47:37,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:37,084 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2019-08-04 21:47:37,084 INFO L418 AbstractCegarLoop]: === Iteration 87 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash 719685101, now seen corresponding path program 84 times [2019-08-04 21:47:37,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:37,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:47:37,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:37,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:37,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:47:37,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:47:37,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:47:37,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:47:37,474 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-08-04 21:47:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:37,673 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-04 21:47:37,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:47:37,674 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-08-04 21:47:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:37,675 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:47:37,675 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:47:37,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:47:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:47:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:47:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:47:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-08-04 21:47:37,678 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-08-04 21:47:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:37,678 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-08-04 21:47:37,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:47:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-08-04 21:47:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:47:37,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:37,679 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1] [2019-08-04 21:47:37,679 INFO L418 AbstractCegarLoop]: === Iteration 88 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 835340129, now seen corresponding path program 85 times [2019-08-04 21:47:37,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:37,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-04 21:47:37,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:38,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:38,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:47:38,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:47:38,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:47:38,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:47:38,886 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 32 states. [2019-08-04 21:47:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:40,213 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2019-08-04 21:47:40,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:47:40,213 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2019-08-04 21:47:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:40,215 INFO L225 Difference]: With dead ends: 97 [2019-08-04 21:47:40,215 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:47:40,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:47:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:47:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2019-08-04 21:47:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:47:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-08-04 21:47:40,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2019-08-04 21:47:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:40,218 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-08-04 21:47:40,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:47:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-08-04 21:47:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:47:40,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:40,219 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2019-08-04 21:47:40,219 INFO L418 AbstractCegarLoop]: === Iteration 89 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash 125678701, now seen corresponding path program 86 times [2019-08-04 21:47:40,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:40,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-04 21:47:40,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:40,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:40,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:47:40,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:47:40,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:47:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:47:40,737 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-08-04 21:47:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:41,891 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-04 21:47:41,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:47:41,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2019-08-04 21:47:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:41,893 INFO L225 Difference]: With dead ends: 95 [2019-08-04 21:47:41,893 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:47:41,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:47:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:47:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:47:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:47:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-04 21:47:41,902 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 64 [2019-08-04 21:47:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:41,903 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-04 21:47:41,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:47:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-04 21:47:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:47:41,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:41,904 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2019-08-04 21:47:41,904 INFO L418 AbstractCegarLoop]: === Iteration 90 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash -815346553, now seen corresponding path program 87 times [2019-08-04 21:47:41,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:41,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:47:41,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:42,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:42,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:47:42,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:47:42,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:47:42,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:47:42,457 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-08-04 21:47:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:42,627 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-08-04 21:47:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:47:42,627 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-08-04 21:47:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:42,628 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:47:42,628 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:47:42,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:47:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:47:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:47:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:47:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-04 21:47:42,632 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 64 [2019-08-04 21:47:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:42,632 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-04 21:47:42,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:47:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-04 21:47:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:47:42,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:42,633 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1] [2019-08-04 21:47:42,633 INFO L418 AbstractCegarLoop]: === Iteration 91 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash 493999111, now seen corresponding path program 88 times [2019-08-04 21:47:42,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:42,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-04 21:47:42,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:43,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:43,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:47:43,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:47:43,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:47:43,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:47:43,049 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 33 states. [2019-08-04 21:47:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:44,426 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-08-04 21:47:44,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:47:44,426 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2019-08-04 21:47:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:44,427 INFO L225 Difference]: With dead ends: 100 [2019-08-04 21:47:44,428 INFO L226 Difference]: Without dead ends: 98 [2019-08-04 21:47:44,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:47:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-04 21:47:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2019-08-04 21:47:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:47:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-08-04 21:47:44,430 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2019-08-04 21:47:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:44,431 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-08-04 21:47:44,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:47:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-08-04 21:47:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:47:44,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:44,432 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2019-08-04 21:47:44,432 INFO L418 AbstractCegarLoop]: === Iteration 92 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:44,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:44,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1865958265, now seen corresponding path program 89 times [2019-08-04 21:47:44,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:44,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-04 21:47:44,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:44,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:44,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:47:44,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:47:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:47:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:47:44,840 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 33 states. [2019-08-04 21:47:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:46,062 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-04 21:47:46,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:47:46,062 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2019-08-04 21:47:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:46,063 INFO L225 Difference]: With dead ends: 98 [2019-08-04 21:47:46,063 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:47:46,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:47:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:47:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:47:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:47:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-04 21:47:46,066 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 66 [2019-08-04 21:47:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:46,066 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-04 21:47:46,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:47:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-04 21:47:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:47:46,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:46,067 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2019-08-04 21:47:46,067 INFO L418 AbstractCegarLoop]: === Iteration 93 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash -972970067, now seen corresponding path program 90 times [2019-08-04 21:47:46,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:46,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:47:46,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:46,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:46,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:47:46,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:47:46,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:47:46,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:47:46,549 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-08-04 21:47:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:46,719 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-04 21:47:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:47:46,720 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-08-04 21:47:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:46,720 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:47:46,720 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:47:46,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:47:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:47:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:47:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:47:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-08-04 21:47:46,722 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-08-04 21:47:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:46,723 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-08-04 21:47:46,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:47:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-08-04 21:47:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:47:46,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:46,723 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1] [2019-08-04 21:47:46,724 INFO L418 AbstractCegarLoop]: === Iteration 94 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:46,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash -97362527, now seen corresponding path program 91 times [2019-08-04 21:47:46,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:46,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-04 21:47:46,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:47,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:47,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:47:47,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:47:47,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:47:47,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:47:47,146 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 34 states. [2019-08-04 21:47:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:48,455 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-08-04 21:47:48,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:47:48,455 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-08-04 21:47:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:48,456 INFO L225 Difference]: With dead ends: 103 [2019-08-04 21:47:48,456 INFO L226 Difference]: Without dead ends: 101 [2019-08-04 21:47:48,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:47:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-04 21:47:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2019-08-04 21:47:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:47:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-08-04 21:47:48,459 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2019-08-04 21:47:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:48,459 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-08-04 21:47:48,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:47:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-08-04 21:47:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:47:48,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:48,460 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2019-08-04 21:47:48,460 INFO L418 AbstractCegarLoop]: === Iteration 95 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:48,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1276667437, now seen corresponding path program 92 times [2019-08-04 21:47:48,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:48,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-04 21:47:48,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:48,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:48,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:47:48,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:47:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:47:48,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:47:48,863 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 34 states. [2019-08-04 21:47:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:52,249 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-08-04 21:47:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:47:52,250 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-08-04 21:47:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:52,250 INFO L225 Difference]: With dead ends: 101 [2019-08-04 21:47:52,250 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:47:52,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:47:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:47:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:47:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:47:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-04 21:47:52,253 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 68 [2019-08-04 21:47:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:52,254 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-04 21:47:52,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:47:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-04 21:47:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:47:52,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:52,255 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2019-08-04 21:47:52,255 INFO L418 AbstractCegarLoop]: === Iteration 96 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:52,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:52,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1105469497, now seen corresponding path program 93 times [2019-08-04 21:47:52,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:52,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:47:52,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:52,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:52,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:47:52,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:47:52,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:47:52,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:47:52,745 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-08-04 21:47:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:52,865 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-08-04 21:47:52,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:47:52,866 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-08-04 21:47:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:52,866 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:47:52,867 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:47:52,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:47:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:47:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:47:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:47:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-08-04 21:47:52,869 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2019-08-04 21:47:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:52,869 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-08-04 21:47:52,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:47:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-08-04 21:47:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:47:52,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:52,870 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1] [2019-08-04 21:47:52,870 INFO L418 AbstractCegarLoop]: === Iteration 97 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 90122439, now seen corresponding path program 94 times [2019-08-04 21:47:52,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:52,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-04 21:47:52,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:53,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:53,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:47:53,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:47:53,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:47:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:47:53,387 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 35 states. [2019-08-04 21:47:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:54,934 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-08-04 21:47:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:47:54,935 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2019-08-04 21:47:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:54,936 INFO L225 Difference]: With dead ends: 106 [2019-08-04 21:47:54,936 INFO L226 Difference]: Without dead ends: 104 [2019-08-04 21:47:54,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:47:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-04 21:47:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2019-08-04 21:47:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:47:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-08-04 21:47:54,939 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2019-08-04 21:47:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:54,939 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-08-04 21:47:54,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:47:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-08-04 21:47:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:47:54,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:54,939 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2019-08-04 21:47:54,940 INFO L418 AbstractCegarLoop]: === Iteration 98 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:54,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1501233209, now seen corresponding path program 95 times [2019-08-04 21:47:54,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:54,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-04 21:47:54,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:55,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:55,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:47:55,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:47:55,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:47:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:47:55,374 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 35 states. [2019-08-04 21:47:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:56,764 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-08-04 21:47:56,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:47:56,764 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2019-08-04 21:47:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:56,765 INFO L225 Difference]: With dead ends: 104 [2019-08-04 21:47:56,765 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:47:56,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:47:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:47:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:47:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:47:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-04 21:47:56,768 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 70 [2019-08-04 21:47:56,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:56,768 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-04 21:47:56,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:47:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-04 21:47:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:47:56,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:56,769 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2019-08-04 21:47:56,769 INFO L418 AbstractCegarLoop]: === Iteration 99 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:56,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:56,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1961933165, now seen corresponding path program 96 times [2019-08-04 21:47:56,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:56,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:47:56,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:57,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:57,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:47:57,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:47:57,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:47:57,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:47:57,237 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-08-04 21:47:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:57,377 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-08-04 21:47:57,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:47:57,377 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-08-04 21:47:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:57,378 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:47:57,378 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:47:57,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:47:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:47:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:47:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:47:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-08-04 21:47:57,381 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-08-04 21:47:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:57,381 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-08-04 21:47:57,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:47:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-08-04 21:47:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:47:57,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:57,382 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1] [2019-08-04 21:47:57,382 INFO L418 AbstractCegarLoop]: === Iteration 100 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 690324449, now seen corresponding path program 97 times [2019-08-04 21:47:57,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:57,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-04 21:47:57,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:57,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:57,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:47:57,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:47:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:47:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:47:57,874 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 36 states. [2019-08-04 21:47:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:59,359 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-08-04 21:47:59,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:47:59,360 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2019-08-04 21:47:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:59,360 INFO L225 Difference]: With dead ends: 109 [2019-08-04 21:47:59,361 INFO L226 Difference]: Without dead ends: 107 [2019-08-04 21:47:59,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:47:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-04 21:47:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2019-08-04 21:47:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:47:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-08-04 21:47:59,363 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2019-08-04 21:47:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:59,363 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-08-04 21:47:59,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:47:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-08-04 21:47:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:47:59,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:59,364 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2019-08-04 21:47:59,364 INFO L418 AbstractCegarLoop]: === Iteration 101 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash -74840083, now seen corresponding path program 98 times [2019-08-04 21:47:59,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:59,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-04 21:47:59,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:00,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:00,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:48:00,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:48:00,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:48:00,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:48:00,182 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 36 states. [2019-08-04 21:48:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:01,660 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-04 21:48:01,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:48:01,661 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-08-04 21:48:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:01,661 INFO L225 Difference]: With dead ends: 107 [2019-08-04 21:48:01,661 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:48:01,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:48:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:48:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:48:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:48:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-04 21:48:01,664 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 72 [2019-08-04 21:48:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:01,664 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-04 21:48:01,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:48:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-04 21:48:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:48:01,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:01,664 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2019-08-04 21:48:01,665 INFO L418 AbstractCegarLoop]: === Iteration 102 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash -90864889, now seen corresponding path program 99 times [2019-08-04 21:48:01,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:01,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:48:01,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:02,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:02,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:48:02,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:48:02,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:48:02,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:48:02,198 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-08-04 21:48:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:02,315 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-04 21:48:02,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:48:02,315 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-08-04 21:48:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:02,316 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:48:02,316 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:48:02,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:48:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:48:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:48:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:48:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-08-04 21:48:02,318 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 72 [2019-08-04 21:48:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:02,319 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-08-04 21:48:02,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:48:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-08-04 21:48:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:48:02,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:02,320 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1] [2019-08-04 21:48:02,320 INFO L418 AbstractCegarLoop]: === Iteration 103 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:02,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1478094215, now seen corresponding path program 100 times [2019-08-04 21:48:02,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:02,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-04 21:48:02,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:02,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:02,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:48:02,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:48:02,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:48:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:48:02,845 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 37 states. [2019-08-04 21:48:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:04,413 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-08-04 21:48:04,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:48:04,413 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2019-08-04 21:48:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:04,414 INFO L225 Difference]: With dead ends: 112 [2019-08-04 21:48:04,414 INFO L226 Difference]: Without dead ends: 110 [2019-08-04 21:48:04,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:48:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-04 21:48:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2019-08-04 21:48:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:48:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-08-04 21:48:04,417 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2019-08-04 21:48:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:04,417 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-08-04 21:48:04,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:48:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-08-04 21:48:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:48:04,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:04,417 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2019-08-04 21:48:04,418 INFO L418 AbstractCegarLoop]: === Iteration 104 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:04,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1423781113, now seen corresponding path program 101 times [2019-08-04 21:48:04,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:04,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-04 21:48:04,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:05,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:05,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:48:05,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:48:05,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:48:05,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:48:05,169 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 37 states. [2019-08-04 21:48:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:06,709 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-08-04 21:48:06,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:48:06,710 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2019-08-04 21:48:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:06,711 INFO L225 Difference]: With dead ends: 110 [2019-08-04 21:48:06,711 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:48:06,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:48:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:48:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:48:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:48:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-04 21:48:06,713 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 74 [2019-08-04 21:48:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:06,714 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-04 21:48:06,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:48:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-04 21:48:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:48:06,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:06,714 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2019-08-04 21:48:06,715 INFO L418 AbstractCegarLoop]: === Iteration 105 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:06,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1920550099, now seen corresponding path program 102 times [2019-08-04 21:48:06,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:06,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:48:06,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:07,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:07,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:48:07,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:48:07,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:48:07,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:48:07,222 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-08-04 21:48:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:07,349 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-08-04 21:48:07,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:48:07,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-08-04 21:48:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:07,350 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:48:07,350 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:48:07,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:48:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:48:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:48:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:48:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-08-04 21:48:07,353 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-08-04 21:48:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:07,354 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-08-04 21:48:07,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:48:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-08-04 21:48:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:48:07,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:07,354 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1] [2019-08-04 21:48:07,355 INFO L418 AbstractCegarLoop]: === Iteration 106 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash 592427553, now seen corresponding path program 103 times [2019-08-04 21:48:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:07,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-04 21:48:07,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:07,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:07,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:48:07,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:48:07,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:48:07,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:48:07,912 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 38 states. [2019-08-04 21:48:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:09,559 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-08-04 21:48:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:48:09,559 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 75 [2019-08-04 21:48:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:09,561 INFO L225 Difference]: With dead ends: 115 [2019-08-04 21:48:09,561 INFO L226 Difference]: Without dead ends: 113 [2019-08-04 21:48:09,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:48:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-04 21:48:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2019-08-04 21:48:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:48:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-08-04 21:48:09,564 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2019-08-04 21:48:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:09,564 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-08-04 21:48:09,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:48:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-08-04 21:48:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:48:09,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:09,565 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2019-08-04 21:48:09,565 INFO L418 AbstractCegarLoop]: === Iteration 107 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1185323437, now seen corresponding path program 104 times [2019-08-04 21:48:09,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:09,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-04 21:48:09,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:10,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:10,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:48:10,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:48:10,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:48:10,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:48:10,392 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 38 states. [2019-08-04 21:48:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:12,042 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-04 21:48:12,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:48:12,043 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 76 [2019-08-04 21:48:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:12,044 INFO L225 Difference]: With dead ends: 113 [2019-08-04 21:48:12,044 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:48:12,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:48:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:48:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:48:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:48:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-04 21:48:12,046 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 76 [2019-08-04 21:48:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:12,046 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-04 21:48:12,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:48:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-04 21:48:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:48:12,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:12,047 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2019-08-04 21:48:12,047 INFO L418 AbstractCegarLoop]: === Iteration 108 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:12,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1329613241, now seen corresponding path program 105 times [2019-08-04 21:48:12,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:12,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:48:12,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:12,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:12,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:48:12,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:48:12,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:48:12,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:48:12,573 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-08-04 21:48:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:12,712 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-08-04 21:48:12,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:48:12,712 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-08-04 21:48:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:12,713 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:48:12,713 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:48:12,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:48:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:48:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:48:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:48:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-08-04 21:48:12,715 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 76 [2019-08-04 21:48:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:12,716 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-08-04 21:48:12,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:48:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-08-04 21:48:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:48:12,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:12,716 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1] [2019-08-04 21:48:12,716 INFO L418 AbstractCegarLoop]: === Iteration 109 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1731600967, now seen corresponding path program 106 times [2019-08-04 21:48:12,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:12,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-04 21:48:12,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:13,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:13,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:48:13,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:48:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:48:13,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:48:13,264 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 39 states. [2019-08-04 21:48:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:15,014 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-08-04 21:48:15,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:48:15,014 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 77 [2019-08-04 21:48:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:15,015 INFO L225 Difference]: With dead ends: 118 [2019-08-04 21:48:15,015 INFO L226 Difference]: Without dead ends: 116 [2019-08-04 21:48:15,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:48:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-04 21:48:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2019-08-04 21:48:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:48:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-08-04 21:48:15,018 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2019-08-04 21:48:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:15,018 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-08-04 21:48:15,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:48:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-08-04 21:48:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:48:15,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:15,019 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2019-08-04 21:48:15,019 INFO L418 AbstractCegarLoop]: === Iteration 110 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:15,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:15,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2139960903, now seen corresponding path program 107 times [2019-08-04 21:48:15,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:15,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-04 21:48:15,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:15,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:15,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:48:15,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:48:15,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:48:15,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:48:15,566 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 39 states. [2019-08-04 21:48:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:17,317 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2019-08-04 21:48:17,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:48:17,318 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2019-08-04 21:48:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:17,318 INFO L225 Difference]: With dead ends: 116 [2019-08-04 21:48:17,318 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:48:17,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:48:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:48:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:48:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:48:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-04 21:48:17,320 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 78 [2019-08-04 21:48:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:17,321 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-04 21:48:17,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:48:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-04 21:48:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:48:17,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:17,322 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2019-08-04 21:48:17,322 INFO L418 AbstractCegarLoop]: === Iteration 111 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:17,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1486335213, now seen corresponding path program 108 times [2019-08-04 21:48:17,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:17,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:48:17,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:18,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:18,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:48:18,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:48:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:48:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:48:18,214 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-08-04 21:48:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:18,352 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-08-04 21:48:18,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:48:18,353 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-08-04 21:48:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:18,353 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:48:18,353 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:48:18,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:48:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:48:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:48:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:48:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-08-04 21:48:18,356 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-08-04 21:48:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:18,356 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-08-04 21:48:18,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:48:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-08-04 21:48:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:48:18,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:18,357 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1] [2019-08-04 21:48:18,357 INFO L418 AbstractCegarLoop]: === Iteration 112 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:18,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1168310175, now seen corresponding path program 109 times [2019-08-04 21:48:18,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:18,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-04 21:48:18,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:18,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:18,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:48:18,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:48:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:48:18,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:48:18,936 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 40 states. [2019-08-04 21:48:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:20,928 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-08-04 21:48:20,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:48:20,928 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 79 [2019-08-04 21:48:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:20,929 INFO L225 Difference]: With dead ends: 121 [2019-08-04 21:48:20,929 INFO L226 Difference]: Without dead ends: 119 [2019-08-04 21:48:20,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:48:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-04 21:48:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-08-04 21:48:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:48:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-08-04 21:48:20,932 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2019-08-04 21:48:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:20,932 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-08-04 21:48:20,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:48:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-08-04 21:48:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:48:20,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:20,933 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2019-08-04 21:48:20,933 INFO L418 AbstractCegarLoop]: === Iteration 113 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1857938579, now seen corresponding path program 110 times [2019-08-04 21:48:20,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:20,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-04 21:48:20,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:21,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:21,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:48:21,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:48:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:48:21,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:48:21,555 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 40 states. [2019-08-04 21:48:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:23,395 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-04 21:48:23,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:48:23,396 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-08-04 21:48:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:23,396 INFO L225 Difference]: With dead ends: 119 [2019-08-04 21:48:23,396 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:48:23,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:48:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:48:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:48:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:48:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-04 21:48:23,399 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 80 [2019-08-04 21:48:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:23,399 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-04 21:48:23,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:48:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-04 21:48:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:48:23,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:23,400 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2019-08-04 21:48:23,400 INFO L418 AbstractCegarLoop]: === Iteration 114 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:23,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:23,400 INFO L82 PathProgramCache]: Analyzing trace with hash -645498489, now seen corresponding path program 111 times [2019-08-04 21:48:23,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:23,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:48:23,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:24,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:24,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:48:24,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:48:24,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:48:24,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:48:24,028 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-08-04 21:48:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:24,168 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-04 21:48:24,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:48:24,169 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-08-04 21:48:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:24,169 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:48:24,170 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:48:24,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:48:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:48:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:48:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:48:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-08-04 21:48:24,172 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2019-08-04 21:48:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:24,172 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-08-04 21:48:24,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:48:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-08-04 21:48:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:48:24,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:24,173 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1] [2019-08-04 21:48:24,173 INFO L418 AbstractCegarLoop]: === Iteration 115 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1464321799, now seen corresponding path program 112 times [2019-08-04 21:48:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:24,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-04 21:48:24,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:24,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:24,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:48:24,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:48:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:48:24,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:48:24,787 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 41 states. [2019-08-04 21:48:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:26,873 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-08-04 21:48:26,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:48:26,874 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 81 [2019-08-04 21:48:26,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:26,874 INFO L225 Difference]: With dead ends: 124 [2019-08-04 21:48:26,875 INFO L226 Difference]: Without dead ends: 122 [2019-08-04 21:48:26,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:48:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-04 21:48:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2019-08-04 21:48:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:48:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-08-04 21:48:26,877 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2019-08-04 21:48:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:26,877 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-08-04 21:48:26,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:48:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-08-04 21:48:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:48:26,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:26,878 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2019-08-04 21:48:26,879 INFO L418 AbstractCegarLoop]: === Iteration 116 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:26,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:26,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1850726009, now seen corresponding path program 113 times [2019-08-04 21:48:26,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:26,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-04 21:48:26,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 39 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:27,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:27,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:48:27,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:48:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:48:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:48:27,474 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 41 states. [2019-08-04 21:48:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:29,433 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2019-08-04 21:48:29,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:48:29,434 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2019-08-04 21:48:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:29,434 INFO L225 Difference]: With dead ends: 122 [2019-08-04 21:48:29,434 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:48:29,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:48:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:48:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:48:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:48:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-04 21:48:29,436 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 82 [2019-08-04 21:48:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:29,437 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-04 21:48:29,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:48:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-04 21:48:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:48:29,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:29,438 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2019-08-04 21:48:29,438 INFO L418 AbstractCegarLoop]: === Iteration 117 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:29,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:29,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1375178413, now seen corresponding path program 114 times [2019-08-04 21:48:29,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:29,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:48:29,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:30,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:30,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:48:30,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:48:30,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:48:30,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:48:30,074 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-08-04 21:48:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:30,272 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-08-04 21:48:30,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:48:30,273 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-08-04 21:48:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:30,273 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:48:30,273 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:48:30,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:48:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:48:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:48:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:48:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-08-04 21:48:30,274 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-08-04 21:48:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:30,275 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-08-04 21:48:30,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:48:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-08-04 21:48:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:48:30,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:30,275 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1] [2019-08-04 21:48:30,276 INFO L418 AbstractCegarLoop]: === Iteration 118 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash -319203679, now seen corresponding path program 115 times [2019-08-04 21:48:30,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:30,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-04 21:48:30,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:31,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:31,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:48:31,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:48:31,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:48:31,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:48:31,053 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 42 states. [2019-08-04 21:48:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:33,088 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-08-04 21:48:33,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:48:33,088 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2019-08-04 21:48:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:33,089 INFO L225 Difference]: With dead ends: 127 [2019-08-04 21:48:33,089 INFO L226 Difference]: Without dead ends: 125 [2019-08-04 21:48:33,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:48:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-04 21:48:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2019-08-04 21:48:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:48:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-08-04 21:48:33,091 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2019-08-04 21:48:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:33,092 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-08-04 21:48:33,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:48:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-08-04 21:48:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:48:33,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:33,093 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2019-08-04 21:48:33,093 INFO L418 AbstractCegarLoop]: === Iteration 119 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:33,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1305440979, now seen corresponding path program 116 times [2019-08-04 21:48:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:33,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-04 21:48:33,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 40 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:33,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:33,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:48:33,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:48:33,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:48:33,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:48:33,743 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 42 states. [2019-08-04 21:48:35,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:35,872 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-08-04 21:48:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:48:35,873 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 84 [2019-08-04 21:48:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:35,873 INFO L225 Difference]: With dead ends: 125 [2019-08-04 21:48:35,874 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:48:35,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:48:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:48:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:48:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:48:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-04 21:48:35,876 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 84 [2019-08-04 21:48:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:35,877 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-04 21:48:35,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:48:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-04 21:48:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:48:35,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:35,878 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2019-08-04 21:48:35,878 INFO L418 AbstractCegarLoop]: === Iteration 120 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash -86651705, now seen corresponding path program 117 times [2019-08-04 21:48:35,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:35,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:48:35,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:36,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:48:36,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:48:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:48:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:48:36,543 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-08-04 21:48:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:36,690 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-08-04 21:48:36,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:48:36,691 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-08-04 21:48:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:36,691 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:48:36,691 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:48:36,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:48:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:48:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:48:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:48:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-08-04 21:48:36,695 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 84 [2019-08-04 21:48:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:36,696 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-08-04 21:48:36,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:48:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-08-04 21:48:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:48:36,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:36,697 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1] [2019-08-04 21:48:36,697 INFO L418 AbstractCegarLoop]: === Iteration 121 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1608702919, now seen corresponding path program 118 times [2019-08-04 21:48:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:36,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-04 21:48:36,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:37,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:37,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:48:37,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:48:37,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:48:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:48:37,366 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 43 states. [2019-08-04 21:48:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:39,495 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-08-04 21:48:39,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:48:39,495 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2019-08-04 21:48:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:39,496 INFO L225 Difference]: With dead ends: 130 [2019-08-04 21:48:39,496 INFO L226 Difference]: Without dead ends: 128 [2019-08-04 21:48:39,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:48:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-04 21:48:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2019-08-04 21:48:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:48:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-08-04 21:48:39,499 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2019-08-04 21:48:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:39,499 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-08-04 21:48:39,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:48:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-08-04 21:48:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:48:39,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:39,500 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2019-08-04 21:48:39,500 INFO L418 AbstractCegarLoop]: === Iteration 122 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:39,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:39,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1669878585, now seen corresponding path program 119 times [2019-08-04 21:48:39,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:39,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-04 21:48:39,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 41 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:40,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:40,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:48:40,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:48:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:48:40,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:48:40,241 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 43 states. [2019-08-04 21:48:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:42,556 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-08-04 21:48:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:48:42,556 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2019-08-04 21:48:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:42,557 INFO L225 Difference]: With dead ends: 128 [2019-08-04 21:48:42,557 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:48:42,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:48:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:48:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:48:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:48:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-04 21:48:42,559 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 86 [2019-08-04 21:48:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:42,560 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-04 21:48:42,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:48:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-04 21:48:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:48:42,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:42,560 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2019-08-04 21:48:42,561 INFO L418 AbstractCegarLoop]: === Iteration 123 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1752850541, now seen corresponding path program 120 times [2019-08-04 21:48:42,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:42,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:48:42,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:43,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:43,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:48:43,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:48:43,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:48:43,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:48:43,268 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-08-04 21:48:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:43,409 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-04 21:48:43,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:48:43,409 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-08-04 21:48:43,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:43,410 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:48:43,410 INFO L226 Difference]: Without dead ends: 88 [2019-08-04 21:48:43,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:48:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-04 21:48:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-04 21:48:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:48:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-08-04 21:48:43,412 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-08-04 21:48:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:43,413 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-08-04 21:48:43,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:48:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-08-04 21:48:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-04 21:48:43,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:43,413 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1] [2019-08-04 21:48:43,414 INFO L418 AbstractCegarLoop]: === Iteration 124 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1496269599, now seen corresponding path program 121 times [2019-08-04 21:48:43,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:43,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-04 21:48:43,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:44,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:44,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:48:44,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:48:44,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:48:44,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:48:44,263 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 44 states. [2019-08-04 21:48:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:46,573 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-08-04 21:48:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:48:46,574 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 87 [2019-08-04 21:48:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:46,574 INFO L225 Difference]: With dead ends: 133 [2019-08-04 21:48:46,574 INFO L226 Difference]: Without dead ends: 131 [2019-08-04 21:48:46,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:48:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-04 21:48:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2019-08-04 21:48:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:48:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-08-04 21:48:46,576 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 87 [2019-08-04 21:48:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:46,577 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-08-04 21:48:46,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:48:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-08-04 21:48:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:48:46,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:46,577 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2019-08-04 21:48:46,577 INFO L418 AbstractCegarLoop]: === Iteration 125 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash 860221165, now seen corresponding path program 122 times [2019-08-04 21:48:46,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:46,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-04 21:48:46,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 42 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:47,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:47,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:48:47,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:48:47,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:48:47,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:48:47,322 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 44 states. [2019-08-04 21:48:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:49,955 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-04 21:48:49,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:48:49,955 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2019-08-04 21:48:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:49,956 INFO L225 Difference]: With dead ends: 131 [2019-08-04 21:48:49,956 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:48:49,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:48:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:48:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:48:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:48:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-04 21:48:49,959 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 88 [2019-08-04 21:48:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:49,959 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-04 21:48:49,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:48:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-04 21:48:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:48:49,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:49,960 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2019-08-04 21:48:49,960 INFO L418 AbstractCegarLoop]: === Iteration 126 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash -409358329, now seen corresponding path program 123 times [2019-08-04 21:48:49,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:49,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:48:49,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:50,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:50,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:48:50,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:48:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:48:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:48:50,679 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-08-04 21:48:50,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:50,928 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-08-04 21:48:50,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:48:50,928 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-08-04 21:48:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:50,929 INFO L225 Difference]: With dead ends: 90 [2019-08-04 21:48:50,929 INFO L226 Difference]: Without dead ends: 90 [2019-08-04 21:48:50,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:48:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-04 21:48:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-04 21:48:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:48:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-08-04 21:48:50,931 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 88 [2019-08-04 21:48:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:50,931 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-08-04 21:48:50,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:48:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-08-04 21:48:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-04 21:48:50,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:50,932 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1] [2019-08-04 21:48:50,933 INFO L418 AbstractCegarLoop]: === Iteration 127 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash 194732167, now seen corresponding path program 124 times [2019-08-04 21:48:50,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:50,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-04 21:48:50,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:51,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:51,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:48:51,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:48:51,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:48:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:48:51,686 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 45 states. [2019-08-04 21:48:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:54,036 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2019-08-04 21:48:54,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:48:54,037 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2019-08-04 21:48:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:54,037 INFO L225 Difference]: With dead ends: 136 [2019-08-04 21:48:54,038 INFO L226 Difference]: Without dead ends: 134 [2019-08-04 21:48:54,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:48:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-04 21:48:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2019-08-04 21:48:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-04 21:48:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-08-04 21:48:54,040 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 89 [2019-08-04 21:48:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:54,040 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-08-04 21:48:54,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:48:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-08-04 21:48:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:48:54,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:54,040 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2019-08-04 21:48:54,041 INFO L418 AbstractCegarLoop]: === Iteration 128 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1741668359, now seen corresponding path program 125 times [2019-08-04 21:48:54,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:54,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-04 21:48:54,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 43 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:54,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:54,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:48:54,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:48:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:48:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:48:54,778 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 45 states. [2019-08-04 21:48:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:57,177 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-08-04 21:48:57,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:48:57,178 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2019-08-04 21:48:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:57,178 INFO L225 Difference]: With dead ends: 134 [2019-08-04 21:48:57,179 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:48:57,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:48:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:48:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:48:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:48:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-04 21:48:57,182 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 90 [2019-08-04 21:48:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:57,182 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-04 21:48:57,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:48:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-04 21:48:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:48:57,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:57,183 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2019-08-04 21:48:57,183 INFO L418 AbstractCegarLoop]: === Iteration 129 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:57,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1039409709, now seen corresponding path program 126 times [2019-08-04 21:48:57,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:57,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:48:57,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:57,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:57,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:48:57,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:48:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:48:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:48:57,948 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-08-04 21:48:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:58,100 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-04 21:48:58,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:48:58,101 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-08-04 21:48:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:58,102 INFO L225 Difference]: With dead ends: 92 [2019-08-04 21:48:58,102 INFO L226 Difference]: Without dead ends: 92 [2019-08-04 21:48:58,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:48:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-04 21:48:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-04 21:48:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-04 21:48:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-08-04 21:48:58,104 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-08-04 21:48:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:58,104 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-08-04 21:48:58,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:48:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-08-04 21:48:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-04 21:48:58,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:58,105 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1] [2019-08-04 21:48:58,106 INFO L418 AbstractCegarLoop]: === Iteration 130 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2138098911, now seen corresponding path program 127 times [2019-08-04 21:48:58,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:58,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 175 conjunts are in the unsatisfiable core [2019-08-04 21:48:58,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:58,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:58,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:48:58,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:48:58,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:48:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:48:58,882 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 46 states. [2019-08-04 21:49:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:01,470 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2019-08-04 21:49:01,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:49:01,471 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2019-08-04 21:49:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:01,471 INFO L225 Difference]: With dead ends: 139 [2019-08-04 21:49:01,471 INFO L226 Difference]: Without dead ends: 137 [2019-08-04 21:49:01,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:49:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-04 21:49:01,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 94. [2019-08-04 21:49:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-04 21:49:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-08-04 21:49:01,474 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2019-08-04 21:49:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:01,474 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-08-04 21:49:01,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:49:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-08-04 21:49:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:49:01,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:01,475 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2019-08-04 21:49:01,475 INFO L418 AbstractCegarLoop]: === Iteration 131 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1856618323, now seen corresponding path program 128 times [2019-08-04 21:49:01,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:01,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 175 conjunts are in the unsatisfiable core [2019-08-04 21:49:01,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:02,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:02,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:49:02,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:49:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:49:02,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:49:02,235 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 46 states. [2019-08-04 21:49:04,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:04,673 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-08-04 21:49:04,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:49:04,674 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 92 [2019-08-04 21:49:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:04,674 INFO L225 Difference]: With dead ends: 137 [2019-08-04 21:49:04,674 INFO L226 Difference]: Without dead ends: 93 [2019-08-04 21:49:04,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:49:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-04 21:49:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-04 21:49:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:49:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-04 21:49:04,677 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 92 [2019-08-04 21:49:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:04,677 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-04 21:49:04,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:49:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-04 21:49:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:49:04,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:04,678 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2019-08-04 21:49:04,679 INFO L418 AbstractCegarLoop]: === Iteration 132 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2143167303, now seen corresponding path program 129 times [2019-08-04 21:49:04,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:04,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:49:04,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:05,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:05,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:49:05,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:49:05,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:49:05,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:49:05,479 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-08-04 21:49:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:05,636 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-08-04 21:49:05,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:49:05,636 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-08-04 21:49:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:05,637 INFO L225 Difference]: With dead ends: 94 [2019-08-04 21:49:05,637 INFO L226 Difference]: Without dead ends: 94 [2019-08-04 21:49:05,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:49:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-04 21:49:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-04 21:49:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-04 21:49:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-08-04 21:49:05,639 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2019-08-04 21:49:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:05,639 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-08-04 21:49:05,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:49:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-08-04 21:49:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-04 21:49:05,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:05,641 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1] [2019-08-04 21:49:05,641 INFO L418 AbstractCegarLoop]: === Iteration 133 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:05,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2013615431, now seen corresponding path program 130 times [2019-08-04 21:49:05,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:05,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-04 21:49:05,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:06,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:06,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:49:06,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:49:06,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:49:06,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:49:06,494 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 47 states. [2019-08-04 21:49:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:09,062 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2019-08-04 21:49:09,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:49:09,062 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 93 [2019-08-04 21:49:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:09,063 INFO L225 Difference]: With dead ends: 142 [2019-08-04 21:49:09,063 INFO L226 Difference]: Without dead ends: 140 [2019-08-04 21:49:09,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:49:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-04 21:49:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2019-08-04 21:49:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-04 21:49:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-08-04 21:49:09,065 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 93 [2019-08-04 21:49:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:09,066 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-08-04 21:49:09,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:49:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-08-04 21:49:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:49:09,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:09,067 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2019-08-04 21:49:09,067 INFO L418 AbstractCegarLoop]: === Iteration 134 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2002492601, now seen corresponding path program 131 times [2019-08-04 21:49:09,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:09,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-04 21:49:09,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 45 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:09,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:09,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:49:09,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:49:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:49:09,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:49:09,884 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 47 states. [2019-08-04 21:49:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:12,457 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2019-08-04 21:49:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:49:12,457 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 94 [2019-08-04 21:49:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:12,458 INFO L225 Difference]: With dead ends: 140 [2019-08-04 21:49:12,458 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:49:12,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:49:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:49:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-04 21:49:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-04 21:49:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-04 21:49:12,460 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 94 [2019-08-04 21:49:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:12,461 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-04 21:49:12,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:49:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-04 21:49:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:49:12,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:12,461 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2019-08-04 21:49:12,461 INFO L418 AbstractCegarLoop]: === Iteration 135 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1731777517, now seen corresponding path program 132 times [2019-08-04 21:49:12,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:12,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:49:12,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:13,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:13,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:49:13,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:49:13,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:49:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:49:13,270 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-08-04 21:49:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:13,440 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-08-04 21:49:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:49:13,440 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-08-04 21:49:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:13,441 INFO L225 Difference]: With dead ends: 96 [2019-08-04 21:49:13,441 INFO L226 Difference]: Without dead ends: 96 [2019-08-04 21:49:13,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:49:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-04 21:49:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-04 21:49:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-04 21:49:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-08-04 21:49:13,443 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-08-04 21:49:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:13,443 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-08-04 21:49:13,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:49:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-08-04 21:49:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-04 21:49:13,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:13,444 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1] [2019-08-04 21:49:13,444 INFO L418 AbstractCegarLoop]: === Iteration 136 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:13,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:13,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2145433953, now seen corresponding path program 133 times [2019-08-04 21:49:13,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:13,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-04 21:49:13,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:14,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:14,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:49:14,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:49:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:49:14,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:49:14,271 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 48 states. [2019-08-04 21:49:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:17,014 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-08-04 21:49:17,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:49:17,014 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 95 [2019-08-04 21:49:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:17,015 INFO L225 Difference]: With dead ends: 145 [2019-08-04 21:49:17,015 INFO L226 Difference]: Without dead ends: 143 [2019-08-04 21:49:17,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:49:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-04 21:49:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2019-08-04 21:49:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-04 21:49:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-08-04 21:49:17,017 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 95 [2019-08-04 21:49:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:17,018 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-08-04 21:49:17,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:49:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-08-04 21:49:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:49:17,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:17,019 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2019-08-04 21:49:17,019 INFO L418 AbstractCegarLoop]: === Iteration 137 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2083881581, now seen corresponding path program 134 times [2019-08-04 21:49:17,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:17,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-04 21:49:17,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:17,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:17,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:49:17,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:49:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:49:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:49:17,919 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 48 states. [2019-08-04 21:49:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:20,597 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-04 21:49:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:49:20,597 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-08-04 21:49:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:20,598 INFO L225 Difference]: With dead ends: 143 [2019-08-04 21:49:20,598 INFO L226 Difference]: Without dead ends: 97 [2019-08-04 21:49:20,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:49:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-04 21:49:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-04 21:49:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-04 21:49:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-04 21:49:20,601 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 96 [2019-08-04 21:49:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:20,601 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-04 21:49:20,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:49:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-04 21:49:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:49:20,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:20,602 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2019-08-04 21:49:20,602 INFO L418 AbstractCegarLoop]: === Iteration 138 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1882138247, now seen corresponding path program 135 times [2019-08-04 21:49:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:20,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:49:20,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:21,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:49:21,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:49:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:49:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:49:21,417 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-08-04 21:49:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:21,614 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-04 21:49:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:49:21,615 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-08-04 21:49:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:21,615 INFO L225 Difference]: With dead ends: 98 [2019-08-04 21:49:21,616 INFO L226 Difference]: Without dead ends: 98 [2019-08-04 21:49:21,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:49:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-04 21:49:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-04 21:49:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-04 21:49:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-08-04 21:49:21,618 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 96 [2019-08-04 21:49:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:21,618 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-08-04 21:49:21,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:49:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-08-04 21:49:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-04 21:49:21,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:21,619 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1] [2019-08-04 21:49:21,619 INFO L418 AbstractCegarLoop]: === Iteration 139 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1783318009, now seen corresponding path program 136 times [2019-08-04 21:49:21,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-04 21:49:21,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:22,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:22,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:49:22,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:49:22,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:49:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:49:22,505 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 49 states. [2019-08-04 21:49:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:25,303 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-08-04 21:49:25,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:49:25,304 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 97 [2019-08-04 21:49:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:25,304 INFO L225 Difference]: With dead ends: 148 [2019-08-04 21:49:25,304 INFO L226 Difference]: Without dead ends: 146 [2019-08-04 21:49:25,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:49:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-04 21:49:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2019-08-04 21:49:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-04 21:49:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-08-04 21:49:25,306 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 97 [2019-08-04 21:49:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:25,307 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-08-04 21:49:25,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:49:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-08-04 21:49:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-04 21:49:25,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:25,307 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2019-08-04 21:49:25,307 INFO L418 AbstractCegarLoop]: === Iteration 140 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:25,307 INFO L82 PathProgramCache]: Analyzing trace with hash 551655047, now seen corresponding path program 137 times [2019-08-04 21:49:25,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:25,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-04 21:49:25,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:26,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:26,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:49:26,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:49:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:49:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:49:26,179 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 49 states. [2019-08-04 21:49:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:28,978 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2019-08-04 21:49:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:49:28,978 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2019-08-04 21:49:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:28,979 INFO L225 Difference]: With dead ends: 146 [2019-08-04 21:49:28,979 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:49:28,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:49:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:49:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-04 21:49:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-04 21:49:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-04 21:49:28,981 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 98 [2019-08-04 21:49:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:28,981 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-04 21:49:28,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:49:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-04 21:49:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-04 21:49:28,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:28,982 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2019-08-04 21:49:28,982 INFO L418 AbstractCegarLoop]: === Iteration 141 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:28,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1407421011, now seen corresponding path program 138 times [2019-08-04 21:49:28,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:29,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:49:29,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:29,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:29,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:49:29,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:49:29,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:49:29,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:49:29,839 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-08-04 21:49:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:30,044 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-08-04 21:49:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:49:30,045 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-08-04 21:49:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:30,045 INFO L225 Difference]: With dead ends: 100 [2019-08-04 21:49:30,045 INFO L226 Difference]: Without dead ends: 100 [2019-08-04 21:49:30,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:49:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-04 21:49:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-04 21:49:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-04 21:49:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-08-04 21:49:30,047 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-08-04 21:49:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:30,048 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-08-04 21:49:30,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:49:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-08-04 21:49:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-04 21:49:30,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:30,049 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1] [2019-08-04 21:49:30,049 INFO L418 AbstractCegarLoop]: === Iteration 142 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -680439903, now seen corresponding path program 139 times [2019-08-04 21:49:30,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:30,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-04 21:49:30,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:31,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:31,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:49:31,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:49:31,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:49:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:49:31,010 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 50 states. [2019-08-04 21:49:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:33,928 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2019-08-04 21:49:33,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:49:33,928 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 99 [2019-08-04 21:49:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:33,929 INFO L225 Difference]: With dead ends: 151 [2019-08-04 21:49:33,929 INFO L226 Difference]: Without dead ends: 149 [2019-08-04 21:49:33,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:49:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-04 21:49:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2019-08-04 21:49:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-04 21:49:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-08-04 21:49:33,931 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 99 [2019-08-04 21:49:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:33,932 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-08-04 21:49:33,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:49:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-08-04 21:49:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:49:33,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:33,932 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2019-08-04 21:49:33,933 INFO L418 AbstractCegarLoop]: === Iteration 143 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 381137965, now seen corresponding path program 140 times [2019-08-04 21:49:33,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:33,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-04 21:49:33,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 48 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:34,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:34,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:49:34,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:49:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:49:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:49:34,914 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 50 states. [2019-08-04 21:49:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:37,828 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-08-04 21:49:37,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:49:37,829 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-08-04 21:49:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:37,829 INFO L225 Difference]: With dead ends: 149 [2019-08-04 21:49:37,830 INFO L226 Difference]: Without dead ends: 101 [2019-08-04 21:49:37,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:49:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-04 21:49:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-04 21:49:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-04 21:49:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-04 21:49:37,832 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 100 [2019-08-04 21:49:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:37,833 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-04 21:49:37,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:49:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-04 21:49:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:49:37,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:37,833 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2019-08-04 21:49:37,834 INFO L418 AbstractCegarLoop]: === Iteration 144 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -220677689, now seen corresponding path program 141 times [2019-08-04 21:49:37,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:37,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:49:37,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:38,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:38,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:49:38,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:49:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:49:38,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:49:38,731 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-08-04 21:49:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:38,917 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-08-04 21:49:38,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:49:38,917 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-08-04 21:49:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:38,918 INFO L225 Difference]: With dead ends: 102 [2019-08-04 21:49:38,918 INFO L226 Difference]: Without dead ends: 102 [2019-08-04 21:49:38,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:49:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-04 21:49:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-04 21:49:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-04 21:49:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-08-04 21:49:38,920 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 100 [2019-08-04 21:49:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:38,920 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-08-04 21:49:38,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:49:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-08-04 21:49:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-04 21:49:38,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:38,921 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1] [2019-08-04 21:49:38,922 INFO L418 AbstractCegarLoop]: === Iteration 145 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1748864711, now seen corresponding path program 142 times [2019-08-04 21:49:38,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:38,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-04 21:49:38,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:39,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:39,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:49:39,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:49:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:49:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:49:39,883 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 51 states. [2019-08-04 21:49:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:42,934 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2019-08-04 21:49:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:49:42,935 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 101 [2019-08-04 21:49:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:42,936 INFO L225 Difference]: With dead ends: 154 [2019-08-04 21:49:42,936 INFO L226 Difference]: Without dead ends: 152 [2019-08-04 21:49:42,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:49:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-04 21:49:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 104. [2019-08-04 21:49:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-04 21:49:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-08-04 21:49:42,938 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 101 [2019-08-04 21:49:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:42,939 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-08-04 21:49:42,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:49:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-08-04 21:49:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-04 21:49:42,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:42,940 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2019-08-04 21:49:42,940 INFO L418 AbstractCegarLoop]: === Iteration 146 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1619830329, now seen corresponding path program 143 times [2019-08-04 21:49:42,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:42,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-04 21:49:42,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 49 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:43,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:43,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:49:43,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:49:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:49:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:49:43,920 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 51 states. [2019-08-04 21:49:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:46,957 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-08-04 21:49:46,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:49:46,958 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 102 [2019-08-04 21:49:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:46,958 INFO L225 Difference]: With dead ends: 152 [2019-08-04 21:49:46,959 INFO L226 Difference]: Without dead ends: 103 [2019-08-04 21:49:46,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:49:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-04 21:49:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-04 21:49:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-04 21:49:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-04 21:49:46,961 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 102 [2019-08-04 21:49:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:46,961 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-04 21:49:46,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:49:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-04 21:49:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-04 21:49:46,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:46,962 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2019-08-04 21:49:46,962 INFO L418 AbstractCegarLoop]: === Iteration 147 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1198720877, now seen corresponding path program 144 times [2019-08-04 21:49:46,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:47,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:49:47,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:47,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:47,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:49:47,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:49:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:49:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:49:47,948 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-08-04 21:49:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:48,333 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-08-04 21:49:48,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:49:48,333 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-08-04 21:49:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:48,334 INFO L225 Difference]: With dead ends: 104 [2019-08-04 21:49:48,334 INFO L226 Difference]: Without dead ends: 104 [2019-08-04 21:49:48,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:49:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-04 21:49:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-04 21:49:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-04 21:49:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-08-04 21:49:48,336 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-08-04 21:49:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:48,337 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-08-04 21:49:48,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:49:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-08-04 21:49:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-04 21:49:48,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:48,337 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1] [2019-08-04 21:49:48,338 INFO L418 AbstractCegarLoop]: === Iteration 148 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:48,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1494419999, now seen corresponding path program 145 times [2019-08-04 21:49:48,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:48,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-04 21:49:48,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:49,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:49:49,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:49:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:49:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:49:49,342 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 52 states. [2019-08-04 21:49:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:52,518 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2019-08-04 21:49:52,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:49:52,518 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 103 [2019-08-04 21:49:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:52,519 INFO L225 Difference]: With dead ends: 157 [2019-08-04 21:49:52,519 INFO L226 Difference]: Without dead ends: 155 [2019-08-04 21:49:52,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:49:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-04 21:49:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2019-08-04 21:49:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-04 21:49:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-08-04 21:49:52,522 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 103 [2019-08-04 21:49:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:52,522 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-08-04 21:49:52,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:49:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-08-04 21:49:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:49:52,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:52,523 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2019-08-04 21:49:52,523 INFO L418 AbstractCegarLoop]: === Iteration 149 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash 917558765, now seen corresponding path program 146 times [2019-08-04 21:49:52,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:52,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-04 21:49:52,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 50 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:53,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:53,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:49:53,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:49:53,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:49:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:49:53,503 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 52 states. [2019-08-04 21:49:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:56,666 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-04 21:49:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:49:56,666 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2019-08-04 21:49:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:56,667 INFO L225 Difference]: With dead ends: 155 [2019-08-04 21:49:56,667 INFO L226 Difference]: Without dead ends: 105 [2019-08-04 21:49:56,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:49:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-04 21:49:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-04 21:49:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-04 21:49:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-04 21:49:56,669 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2019-08-04 21:49:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:56,669 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-04 21:49:56,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:49:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-04 21:49:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:49:56,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:56,670 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2019-08-04 21:49:56,670 INFO L418 AbstractCegarLoop]: === Iteration 150 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1901667065, now seen corresponding path program 147 times [2019-08-04 21:49:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:56,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:49:56,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:57,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:57,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:49:57,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:49:57,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:49:57,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:49:57,656 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-08-04 21:49:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:57,838 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-04 21:49:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:49:57,839 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-08-04 21:49:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:57,839 INFO L225 Difference]: With dead ends: 106 [2019-08-04 21:49:57,839 INFO L226 Difference]: Without dead ends: 106 [2019-08-04 21:49:57,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:49:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-04 21:49:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-04 21:49:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-04 21:49:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-04 21:49:57,842 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2019-08-04 21:49:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:57,842 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-04 21:49:57,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:49:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-04 21:49:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-04 21:49:57,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:57,843 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1] [2019-08-04 21:49:57,843 INFO L418 AbstractCegarLoop]: === Iteration 151 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1177801607, now seen corresponding path program 148 times [2019-08-04 21:49:57,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:57,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-04 21:49:57,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:58,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:49:58,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:49:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:49:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:49:58,862 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 53 states. [2019-08-04 21:50:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:02,159 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2019-08-04 21:50:02,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:50:02,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 105 [2019-08-04 21:50:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:02,160 INFO L225 Difference]: With dead ends: 160 [2019-08-04 21:50:02,160 INFO L226 Difference]: Without dead ends: 158 [2019-08-04 21:50:02,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:50:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-04 21:50:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2019-08-04 21:50:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-04 21:50:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-08-04 21:50:02,162 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2019-08-04 21:50:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:02,163 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-08-04 21:50:02,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:50:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-08-04 21:50:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:50:02,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:02,163 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2019-08-04 21:50:02,163 INFO L418 AbstractCegarLoop]: === Iteration 152 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:02,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2142917369, now seen corresponding path program 149 times [2019-08-04 21:50:02,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:02,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-04 21:50:02,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 51 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:03,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:03,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:50:03,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:50:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:50:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:50:03,243 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 53 states. [2019-08-04 21:50:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:06,550 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2019-08-04 21:50:06,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:50:06,550 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2019-08-04 21:50:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:06,551 INFO L225 Difference]: With dead ends: 158 [2019-08-04 21:50:06,551 INFO L226 Difference]: Without dead ends: 107 [2019-08-04 21:50:06,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:50:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-04 21:50:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-04 21:50:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-04 21:50:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-04 21:50:06,554 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 106 [2019-08-04 21:50:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:06,554 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-04 21:50:06,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:50:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-04 21:50:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:50:06,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:06,555 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2019-08-04 21:50:06,555 INFO L418 AbstractCegarLoop]: === Iteration 153 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 655395117, now seen corresponding path program 150 times [2019-08-04 21:50:06,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:06,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:50:06,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:07,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:07,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:50:07,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:50:07,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:50:07,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:50:07,608 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-08-04 21:50:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:07,800 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-08-04 21:50:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:50:07,800 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-08-04 21:50:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:07,801 INFO L225 Difference]: With dead ends: 108 [2019-08-04 21:50:07,801 INFO L226 Difference]: Without dead ends: 108 [2019-08-04 21:50:07,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:50:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-04 21:50:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-04 21:50:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-04 21:50:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-08-04 21:50:07,803 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-08-04 21:50:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:07,804 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-08-04 21:50:07,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:50:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-08-04 21:50:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-04 21:50:07,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:07,805 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1] [2019-08-04 21:50:07,806 INFO L418 AbstractCegarLoop]: === Iteration 154 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1157649375, now seen corresponding path program 151 times [2019-08-04 21:50:07,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:07,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-04 21:50:07,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:08,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:08,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:50:08,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:50:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:50:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:50:08,886 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 54 states. [2019-08-04 21:50:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:12,371 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2019-08-04 21:50:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:50:12,372 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 107 [2019-08-04 21:50:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:12,372 INFO L225 Difference]: With dead ends: 163 [2019-08-04 21:50:12,372 INFO L226 Difference]: Without dead ends: 161 [2019-08-04 21:50:12,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:50:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-04 21:50:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2019-08-04 21:50:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-04 21:50:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-08-04 21:50:12,375 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 107 [2019-08-04 21:50:12,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:12,375 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-08-04 21:50:12,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:50:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-08-04 21:50:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:50:12,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:12,376 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2019-08-04 21:50:12,376 INFO L418 AbstractCegarLoop]: === Iteration 155 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1527453779, now seen corresponding path program 152 times [2019-08-04 21:50:12,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:12,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-04 21:50:12,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 52 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:13,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:13,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:50:13,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:50:13,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:50:13,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:50:13,548 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 54 states. [2019-08-04 21:50:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:16,968 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-08-04 21:50:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:50:16,969 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 108 [2019-08-04 21:50:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:16,969 INFO L225 Difference]: With dead ends: 161 [2019-08-04 21:50:16,969 INFO L226 Difference]: Without dead ends: 109 [2019-08-04 21:50:16,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:50:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-04 21:50:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-04 21:50:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-04 21:50:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-04 21:50:16,971 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 108 [2019-08-04 21:50:16,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:16,972 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-04 21:50:16,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:50:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-04 21:50:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:50:16,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:16,973 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2019-08-04 21:50:16,973 INFO L418 AbstractCegarLoop]: === Iteration 156 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:16,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:16,973 INFO L82 PathProgramCache]: Analyzing trace with hash -679112633, now seen corresponding path program 153 times [2019-08-04 21:50:16,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:16,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:50:17,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:18,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:18,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:50:18,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:50:18,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:50:18,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:50:18,040 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-08-04 21:50:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:18,240 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-08-04 21:50:18,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:50:18,241 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-08-04 21:50:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:18,241 INFO L225 Difference]: With dead ends: 110 [2019-08-04 21:50:18,241 INFO L226 Difference]: Without dead ends: 110 [2019-08-04 21:50:18,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:50:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-04 21:50:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-04 21:50:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-04 21:50:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-08-04 21:50:18,243 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 108 [2019-08-04 21:50:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:18,244 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-08-04 21:50:18,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:50:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-08-04 21:50:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-04 21:50:18,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:18,244 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1] [2019-08-04 21:50:18,245 INFO L418 AbstractCegarLoop]: === Iteration 157 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash 422283335, now seen corresponding path program 154 times [2019-08-04 21:50:18,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:18,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-04 21:50:18,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:19,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:19,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:50:19,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:50:19,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:50:19,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:50:19,350 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 55 states. [2019-08-04 21:50:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:22,884 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2019-08-04 21:50:22,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:50:22,885 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 109 [2019-08-04 21:50:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:22,885 INFO L225 Difference]: With dead ends: 166 [2019-08-04 21:50:22,886 INFO L226 Difference]: Without dead ends: 164 [2019-08-04 21:50:22,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:50:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-04 21:50:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2019-08-04 21:50:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-04 21:50:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-08-04 21:50:22,888 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 109 [2019-08-04 21:50:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:22,888 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-08-04 21:50:22,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:50:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-08-04 21:50:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-04 21:50:22,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:22,889 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2019-08-04 21:50:22,889 INFO L418 AbstractCegarLoop]: === Iteration 158 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 205819975, now seen corresponding path program 155 times [2019-08-04 21:50:22,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:22,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-04 21:50:22,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 53 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:24,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:24,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:50:24,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:50:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:50:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:50:24,003 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 55 states. [2019-08-04 21:50:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:27,408 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2019-08-04 21:50:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:50:27,408 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2019-08-04 21:50:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:27,409 INFO L225 Difference]: With dead ends: 164 [2019-08-04 21:50:27,409 INFO L226 Difference]: Without dead ends: 111 [2019-08-04 21:50:27,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:50:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-04 21:50:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-04 21:50:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-04 21:50:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-04 21:50:27,411 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 110 [2019-08-04 21:50:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:27,411 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-04 21:50:27,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:50:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-04 21:50:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-04 21:50:27,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:27,412 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2019-08-04 21:50:27,412 INFO L418 AbstractCegarLoop]: === Iteration 159 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash 734591725, now seen corresponding path program 156 times [2019-08-04 21:50:27,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:27,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:50:27,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:28,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:28,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:50:28,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:50:28,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:50:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:50:28,496 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-08-04 21:50:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:28,677 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-04 21:50:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:50:28,677 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-08-04 21:50:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:28,678 INFO L225 Difference]: With dead ends: 112 [2019-08-04 21:50:28,678 INFO L226 Difference]: Without dead ends: 112 [2019-08-04 21:50:28,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:50:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-04 21:50:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-04 21:50:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-04 21:50:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-08-04 21:50:28,680 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-08-04 21:50:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:28,680 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-08-04 21:50:28,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:50:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-08-04 21:50:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-04 21:50:28,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:28,681 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1] [2019-08-04 21:50:28,681 INFO L418 AbstractCegarLoop]: === Iteration 160 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1297445473, now seen corresponding path program 157 times [2019-08-04 21:50:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:28,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-04 21:50:28,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:29,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:29,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:50:29,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:50:29,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:50:29,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:50:29,849 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 56 states. [2019-08-04 21:50:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:33,390 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2019-08-04 21:50:33,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:50:33,391 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 111 [2019-08-04 21:50:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:33,391 INFO L225 Difference]: With dead ends: 169 [2019-08-04 21:50:33,391 INFO L226 Difference]: Without dead ends: 167 [2019-08-04 21:50:33,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:50:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-04 21:50:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2019-08-04 21:50:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-04 21:50:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-08-04 21:50:33,393 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2019-08-04 21:50:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:33,393 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-08-04 21:50:33,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:50:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-08-04 21:50:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:50:33,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:33,394 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2019-08-04 21:50:33,394 INFO L418 AbstractCegarLoop]: === Iteration 161 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:33,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1566042477, now seen corresponding path program 158 times [2019-08-04 21:50:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:33,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-04 21:50:33,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 54 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:34,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:34,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:50:34,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:50:34,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:50:34,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:50:34,547 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 56 states. [2019-08-04 21:50:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:38,054 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-08-04 21:50:38,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:50:38,054 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2019-08-04 21:50:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:38,055 INFO L225 Difference]: With dead ends: 167 [2019-08-04 21:50:38,055 INFO L226 Difference]: Without dead ends: 113 [2019-08-04 21:50:38,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:50:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-04 21:50:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-04 21:50:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-04 21:50:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-08-04 21:50:38,057 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 112 [2019-08-04 21:50:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:38,057 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-08-04 21:50:38,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:50:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-08-04 21:50:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:50:38,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:38,058 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2019-08-04 21:50:38,058 INFO L418 AbstractCegarLoop]: === Iteration 162 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash 778097543, now seen corresponding path program 159 times [2019-08-04 21:50:38,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:38,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-04 21:50:38,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:39,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:39,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:50:39,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:50:39,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:50:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:50:39,625 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-08-04 21:50:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:39,804 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2019-08-04 21:50:39,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:50:39,804 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-08-04 21:50:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:39,805 INFO L225 Difference]: With dead ends: 114 [2019-08-04 21:50:39,805 INFO L226 Difference]: Without dead ends: 114 [2019-08-04 21:50:39,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:50:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-04 21:50:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-04 21:50:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-04 21:50:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-08-04 21:50:39,807 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 112 [2019-08-04 21:50:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:39,807 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-08-04 21:50:39,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:50:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-08-04 21:50:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-04 21:50:39,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:39,809 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1] [2019-08-04 21:50:39,809 INFO L418 AbstractCegarLoop]: === Iteration 163 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1648841465, now seen corresponding path program 160 times [2019-08-04 21:50:39,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:39,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-04 21:50:39,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:40,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:40,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:50:40,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:50:40,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:50:40,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:50:40,965 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 57 states. [2019-08-04 21:50:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:44,627 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-08-04 21:50:44,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:50:44,628 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 113 [2019-08-04 21:50:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:44,629 INFO L225 Difference]: With dead ends: 172 [2019-08-04 21:50:44,629 INFO L226 Difference]: Without dead ends: 170 [2019-08-04 21:50:44,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:50:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-04 21:50:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2019-08-04 21:50:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-04 21:50:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-08-04 21:50:44,631 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 113 [2019-08-04 21:50:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:44,631 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-08-04 21:50:44,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:50:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-08-04 21:50:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-04 21:50:44,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:44,632 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2019-08-04 21:50:44,632 INFO L418 AbstractCegarLoop]: === Iteration 164 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:44,633 INFO L82 PathProgramCache]: Analyzing trace with hash 425460615, now seen corresponding path program 161 times [2019-08-04 21:50:44,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:44,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-04 21:50:44,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-04 21:50:45,097 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:50:45,097 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:50:45,101 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:50:45,101 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:50:45 BoogieIcfgContainer [2019-08-04 21:50:45,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:50:45,103 INFO L168 Benchmark]: Toolchain (without parser) took 243695.71 ms. Allocated memory was 134.2 MB in the beginning and 296.2 MB in the end (delta: 162.0 MB). Free memory was 111.8 MB in the beginning and 231.4 MB in the end (delta: -119.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:50:45,103 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory is still 112.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:50:45,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.78 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 109.7 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:50:45,104 INFO L168 Benchmark]: Boogie Preprocessor took 26.35 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 108.4 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:50:45,104 INFO L168 Benchmark]: RCFGBuilder took 342.76 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 99.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:50:45,105 INFO L168 Benchmark]: TraceAbstraction took 243282.23 ms. Allocated memory was 134.2 MB in the beginning and 296.2 MB in the end (delta: 162.0 MB). Free memory was 98.9 MB in the beginning and 231.4 MB in the end (delta: -132.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:50:45,107 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.24 ms. Allocated memory is still 134.2 MB. Free memory is still 112.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.78 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 109.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.35 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 108.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.76 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 99.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243282.23 ms. Allocated memory was 134.2 MB in the beginning and 296.2 MB in the end (delta: 162.0 MB). Free memory was 98.9 MB in the beginning and 231.4 MB in the end (delta: -132.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 55,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 55,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 2 error locations. TIMEOUT Result, 243.2s OverallTime, 164 OverallIterations, 55 TraceHistogramMax, 156.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 655 SDtfs, 756 SDslu, 7640 SDs, 0 SdLazy, 233856 SolverSat, 1648 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 127.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9452 GetRequests, 4888 SyntacticMatches, 0 SemanticMatches, 4564 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 79.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=163, 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.3s AutomataMinimizationTime, 163 MinimizatonAttempts, 1485 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 82.2s InterpolantComputationTime, 9615 NumberOfCodeBlocks, 9615 NumberOfCodeBlocksAsserted, 163 NumberOfCheckSat, 9452 ConstructedInterpolants, 0 QuantifiedInterpolants, 2094798 SizeOfPredicates, 54 NumberOfNonLiveVariables, 41558 ConjunctsInSsa, 15015 ConjunctsInUnsatCore, 163 InterpolantComputations, 3 PerfectInterpolantSequences, 29204/163349 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown